./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:05:33,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:05:33,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:05:33,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:05:33,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:05:33,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:05:33,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:05:33,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:05:33,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:05:33,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:05:33,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:05:33,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:05:33,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:05:33,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:05:33,852 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:05:33,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:05:33,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:05:33,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:05:33,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:05:33,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:05:33,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:05:33,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:05:33,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:33,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:05:33,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:05:33,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:05:33,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:05:33,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:05:33,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:05:33,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:05:33,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:05:33,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:05:33,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:05:33,855 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 [2025-03-04 00:05:34,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:05:34,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:05:34,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:05:34,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:05:34,092 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:05:34,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-03-04 00:05:35,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b178d9a08/95fb44b7e5014867893d0a63bd577145/FLAG687546c5b [2025-03-04 00:05:35,551 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:05:35,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-03-04 00:05:35,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b178d9a08/95fb44b7e5014867893d0a63bd577145/FLAG687546c5b [2025-03-04 00:05:35,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b178d9a08/95fb44b7e5014867893d0a63bd577145 [2025-03-04 00:05:35,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:05:35,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:05:35,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:35,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:05:35,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:05:35,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a864e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35, skipping insertion in model container [2025-03-04 00:05:35,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:05:35,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i[915,928] [2025-03-04 00:05:35,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:35,762 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:05:35,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i[915,928] [2025-03-04 00:05:35,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:35,799 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:05:35,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35 WrapperNode [2025-03-04 00:05:35,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:35,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:35,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:05:35,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:05:35,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,825 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-04 00:05:35,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:35,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:05:35,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:05:35,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:05:35,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,843 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:05:35,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,847 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:05:35,851 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:05:35,851 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:05:35,851 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:05:35,852 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (1/1) ... [2025-03-04 00:05:35,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:35,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:35,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:05:35,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:05:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:05:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:05:35,893 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:05:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:05:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:05:35,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:05:35,936 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:05:35,938 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:05:36,054 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:05:36,054 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:05:36,062 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:05:36,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:05:36,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:36 BoogieIcfgContainer [2025-03-04 00:05:36,064 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:05:36,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:05:36,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:05:36,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:05:36,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:05:35" (1/3) ... [2025-03-04 00:05:36,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e9037a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:36, skipping insertion in model container [2025-03-04 00:05:36,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:35" (2/3) ... [2025-03-04 00:05:36,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e9037a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:36, skipping insertion in model container [2025-03-04 00:05:36,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:36" (3/3) ... [2025-03-04 00:05:36,073 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-71.i [2025-03-04 00:05:36,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:05:36,090 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-71.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:05:36,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:05:36,143 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7625d413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:05:36,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:05:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:05:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 00:05:36,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:36,152 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:36,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:36,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash 690740013, now seen corresponding path program 1 times [2025-03-04 00:05:36,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:05:36,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527986132] [2025-03-04 00:05:36,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:05:36,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 00:05:36,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 00:05:36,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:36,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 00:05:36,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:05:36,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527986132] [2025-03-04 00:05:36,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527986132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:05:36,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615739522] [2025-03-04 00:05:36,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:36,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:05:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:36,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:05:36,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:05:36,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 00:05:36,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 00:05:36,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:36,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:36,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:05:36,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 00:05:36,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615739522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:36,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:05:36,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:05:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440223915] [2025-03-04 00:05:36,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:36,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:05:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:05:36,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:05:36,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:36,451 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:05:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:36,464 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2025-03-04 00:05:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:05:36,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-04 00:05:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:36,471 INFO L225 Difference]: With dead ends: 76 [2025-03-04 00:05:36,472 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 00:05:36,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:36,478 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:36,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:05:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 00:05:36,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 00:05:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:05:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2025-03-04 00:05:36,510 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 79 [2025-03-04 00:05:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:36,510 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-03-04 00:05:36,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:05:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2025-03-04 00:05:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 00:05:36,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:36,514 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:36,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:05:36,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:05:36,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:36,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1033113385, now seen corresponding path program 1 times [2025-03-04 00:05:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:05:36,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798657217] [2025-03-04 00:05:36,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:05:36,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 00:05:36,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 00:05:36,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:36,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 00:05:37,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:05:37,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798657217] [2025-03-04 00:05:37,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798657217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:37,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:37,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:05:37,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733576661] [2025-03-04 00:05:37,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:37,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:05:37,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:05:37,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:05:37,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:05:37,510 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:05:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:37,613 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2025-03-04 00:05:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:05:37,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2025-03-04 00:05:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:37,614 INFO L225 Difference]: With dead ends: 55 [2025-03-04 00:05:37,615 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 00:05:37,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:05:37,616 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 15 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:37,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 235 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:05:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 00:05:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2025-03-04 00:05:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:05:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-03-04 00:05:37,627 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 79 [2025-03-04 00:05:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:37,629 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-03-04 00:05:37,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:05:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-03-04 00:05:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 00:05:37,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:37,631 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:37,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:05:37,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:37,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1034036906, now seen corresponding path program 1 times [2025-03-04 00:05:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:05:37,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872105178] [2025-03-04 00:05:37,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:05:37,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 00:05:37,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 00:05:37,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:37,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:05:37,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:05:37,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 00:05:37,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 00:05:37,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:37,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:05:37,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:05:37,734 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:05:37,734 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:05:37,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:05:37,738 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:05:37,786 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:05:37,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:05:37 BoogieIcfgContainer [2025-03-04 00:05:37,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:05:37,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:05:37,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:05:37,790 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:05:37,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:36" (3/4) ... [2025-03-04 00:05:37,793 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:05:37,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:05:37,794 INFO L158 Benchmark]: Toolchain (without parser) took 2203.32ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 70.8MB in the end (delta: 42.1MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2025-03-04 00:05:37,794 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:37,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.57ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.0MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:37,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.48ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:37,795 INFO L158 Benchmark]: Boogie Preprocessor took 25.15ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 98.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:37,795 INFO L158 Benchmark]: IcfgBuilder took 212.42ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 84.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:37,795 INFO L158 Benchmark]: TraceAbstraction took 1723.66ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 70.8MB in the end (delta: 13.4MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2025-03-04 00:05:37,795 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 70.8MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:37,796 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.57ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.0MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.48ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.15ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 98.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 212.42ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 84.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1723.66ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 70.8MB in the end (delta: 13.4MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 70.8MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 31.25; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 0.25; [L26] float var_1_5 = 10.5; [L27] unsigned char var_1_6 = 16; [L28] double var_1_7 = 10.75; [L29] double var_1_8 = 2.675; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 2; VAL [isInitial=0, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L73] isInitial = 1 [L74] FCALL initially() [L75] COND TRUE 1 [L76] FCALL updateLastVariables() [L77] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L48] var_1_3 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L49] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L50] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L50] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L51] var_1_4 = __VERIFIER_nondet_float() [L52] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L52] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L53] var_1_5 = __VERIFIER_nondet_float() [L54] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L54] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L55] var_1_7 = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L56] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L57] var_1_8 = __VERIFIER_nondet_double() [L58] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L58] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L59] var_1_9 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L60] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L61] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L61] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L62] var_1_10 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L63] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L64] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L64] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L77] RET updateVariables() [L78] CALL step() [L35] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L40] COND FALSE !((var_1_7 - var_1_8) >= (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L78] RET step() [L79] CALL, EXPR property() [L69-L70] return (var_1_2 ? (var_1_3 ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) : 1) && (((var_1_7 - var_1_8) >= (var_1_1 + var_1_4)) ? (var_1_6 == ((unsigned char) (var_1_9 - var_1_10))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L79] RET, EXPR property() [L79] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L19] reach_error() VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 103 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 770/792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:05:37,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:05:39,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:05:39,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:05:39,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:05:39,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:05:39,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:05:39,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:05:39,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:05:39,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:05:39,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:05:39,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:05:39,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:05:39,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:05:39,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:05:39,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:05:39,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:05:39,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:05:39,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:05:39,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:05:39,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:05:39,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:05:39,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:05:39,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:05:39,783 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:05:39,783 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:05:39,783 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:05:39,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:05:39,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:05:39,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:05:39,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:05:39,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:05:39,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:05:39,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:05:39,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:05:39,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:39,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:05:39,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:05:39,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:05:39,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:05:39,784 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:05:39,784 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:05:39,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:05:39,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:05:39,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:05:39,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:05:39,785 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 [2025-03-04 00:05:40,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:05:40,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:05:40,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:05:40,079 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:05:40,079 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:05:40,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-03-04 00:05:41,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af606d239/b2ee09b8b6cf468795ec31f261954142/FLAG7afcdc9db [2025-03-04 00:05:41,555 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:05:41,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-03-04 00:05:41,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af606d239/b2ee09b8b6cf468795ec31f261954142/FLAG7afcdc9db [2025-03-04 00:05:41,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af606d239/b2ee09b8b6cf468795ec31f261954142 [2025-03-04 00:05:41,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:05:41,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:05:41,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:41,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:05:41,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:05:41,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7013fe13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41, skipping insertion in model container [2025-03-04 00:05:41,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:05:41,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i[915,928] [2025-03-04 00:05:41,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:41,769 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:05:41,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i[915,928] [2025-03-04 00:05:41,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:41,813 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:05:41,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41 WrapperNode [2025-03-04 00:05:41,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:41,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:41,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:05:41,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:05:41,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,842 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-04 00:05:41,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:41,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:05:41,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:05:41,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:05:41,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,865 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:05:41,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:05:41,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:05:41,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:05:41,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:05:41,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (1/1) ... [2025-03-04 00:05:41,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:41,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:41,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:05:41,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:05:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:05:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:05:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:05:41,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:05:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:05:41,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:05:41,981 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:05:41,983 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:05:45,688 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:05:45,688 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:05:45,695 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:05:45,695 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:05:45,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:45 BoogieIcfgContainer [2025-03-04 00:05:45,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:05:45,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:05:45,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:05:45,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:05:45,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:05:41" (1/3) ... [2025-03-04 00:05:45,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bb6c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:45, skipping insertion in model container [2025-03-04 00:05:45,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:41" (2/3) ... [2025-03-04 00:05:45,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bb6c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:45, skipping insertion in model container [2025-03-04 00:05:45,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:45" (3/3) ... [2025-03-04 00:05:45,703 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-71.i [2025-03-04 00:05:45,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:05:45,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-71.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:05:45,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:05:45,769 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a5cd782, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:05:45,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:05:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:05:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 00:05:45,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:45,778 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:45,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:45,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:45,783 INFO L85 PathProgramCache]: Analyzing trace with hash 690740013, now seen corresponding path program 1 times [2025-03-04 00:05:45,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:45,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205632862] [2025-03-04 00:05:45,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:45,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:45,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:45,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:05:45,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:05:45,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 00:05:45,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 00:05:45,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:45,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:46,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:05:46,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-04 00:05:46,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:46,025 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:46,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205632862] [2025-03-04 00:05:46,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205632862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:46,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:46,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:05:46,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140789394] [2025-03-04 00:05:46,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:46,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:05:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:46,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:05:46,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:46,043 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:05:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:46,060 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2025-03-04 00:05:46,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:05:46,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-04 00:05:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:46,066 INFO L225 Difference]: With dead ends: 76 [2025-03-04 00:05:46,066 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 00:05:46,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:46,070 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:46,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:05:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 00:05:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 00:05:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:05:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2025-03-04 00:05:46,094 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 79 [2025-03-04 00:05:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:46,095 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-03-04 00:05:46,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:05:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2025-03-04 00:05:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 00:05:46,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:46,097 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:46,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:05:46,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:46,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:46,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1033113385, now seen corresponding path program 1 times [2025-03-04 00:05:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:46,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453966071] [2025-03-04 00:05:46,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:46,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:05:46,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:46,306 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:05:46,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:05:46,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 00:05:46,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 00:05:46,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:46,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:46,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:05:46,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 00:05:57,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:57,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:57,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453966071] [2025-03-04 00:05:57,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453966071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:57,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:57,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:05:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543872421] [2025-03-04 00:05:57,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:05:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:57,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:05:57,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:05:57,425 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:06:00,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:06:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:01,446 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2025-03-04 00:06:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:06:01,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2025-03-04 00:06:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:01,448 INFO L225 Difference]: With dead ends: 55 [2025-03-04 00:06:01,448 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 00:06:01,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:06:01,448 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 15 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:01,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 232 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-04 00:06:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 00:06:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2025-03-04 00:06:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:06:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-03-04 00:06:01,458 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 79 [2025-03-04 00:06:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:01,460 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-03-04 00:06:01,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:06:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-03-04 00:06:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 00:06:01,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:01,463 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:01,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:06:01,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:01,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1034036906, now seen corresponding path program 1 times [2025-03-04 00:06:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:01,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308607898] [2025-03-04 00:06:01,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:01,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:01,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:01,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:06:01,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:06:01,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 00:06:01,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 00:06:01,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:01,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:01,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:06:01,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 00:06:25,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:06:25,994 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:06:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308607898] [2025-03-04 00:06:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308607898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:06:25,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:06:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:06:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201241282] [2025-03-04 00:06:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:25,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:06:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:06:25,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:06:25,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:06:25,996 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:06:28,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:06:29,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:06:31,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:06:32,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:06:33,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:06:42,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:06:52,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:06:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:52,569 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2025-03-04 00:06:52,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:06:52,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2025-03-04 00:06:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:52,586 INFO L225 Difference]: With dead ends: 53 [2025-03-04 00:06:52,586 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 00:06:52,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:06:52,587 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 16 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:52,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 197 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2025-03-04 00:06:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 00:06:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2025-03-04 00:06:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:06:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-03-04 00:06:52,592 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 79 [2025-03-04 00:06:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:52,592 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-03-04 00:06:52,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:06:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-03-04 00:06:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 00:06:52,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:52,593 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:06:52,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 00:06:52,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:52,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:52,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1132483546, now seen corresponding path program 1 times [2025-03-04 00:06:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239174627] [2025-03-04 00:06:52,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:52,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:52,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:52,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:06:52,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 00:06:52,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 00:06:52,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 00:06:52,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:52,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:52,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:06:52,951 INFO L279 TraceCheckSpWp]: Computing forward predicates...