./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_loopvsstraightlinecode_25-1loop_file-78.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 c2fd7fb27bc7851d54e677fa9fb3be51bb09b78aa3b59eb4223bc2d43faa03f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:32:21,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:32:21,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:32:21,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:32:21,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:32:21,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:32:21,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:32:21,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:32:21,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:32:21,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:32:21,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:32:21,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:32:21,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:32:21,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:32:21,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:32:21,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:32:21,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:32:21,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:32:21,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:32:21,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:32:21,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:32:21,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:32:21,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:32:21,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:32:21,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:32:21,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:32:21,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:32:21,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:32:21,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:32:21,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:32:21,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:32:21,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:32:21,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:32:21,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:32:21,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:32:21,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:32:21,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:32:21,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:32:21,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:32:21,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:32:21,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:32:21,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:32:21,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:32:21,412 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 -> c2fd7fb27bc7851d54e677fa9fb3be51bb09b78aa3b59eb4223bc2d43faa03f5 [2025-03-17 03:32:21,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:32:21,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:32:21,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:32:21,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:32:21,684 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:32:21,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-78.i [2025-03-17 03:32:22,936 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001170434/9173d228e8b24ca587ad4439b97fa33a/FLAGa0a7852c6 [2025-03-17 03:32:23,188 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:32:23,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-78.i [2025-03-17 03:32:23,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001170434/9173d228e8b24ca587ad4439b97fa33a/FLAGa0a7852c6 [2025-03-17 03:32:23,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001170434/9173d228e8b24ca587ad4439b97fa33a [2025-03-17 03:32:23,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:32:23,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:32:23,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:32:23,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:32:23,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:32:23,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b59cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23, skipping insertion in model container [2025-03-17 03:32:23,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:32:23,334 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_loopvsstraightlinecode_25-1loop_file-78.i[915,928] [2025-03-17 03:32:23,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:32:23,381 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:32:23,389 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_loopvsstraightlinecode_25-1loop_file-78.i[915,928] [2025-03-17 03:32:23,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:32:23,412 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:32:23,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23 WrapperNode [2025-03-17 03:32:23,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:32:23,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:32:23,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:32:23,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:32:23,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,452 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-03-17 03:32:23,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:32:23,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:32:23,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:32:23,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:32:23,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,474 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-17 03:32:23,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:32:23,482 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:32:23,482 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:32:23,482 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:32:23,483 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (1/1) ... [2025-03-17 03:32:23,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:32:23,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:32:23,513 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-17 03:32:23,519 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-17 03:32:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:32:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:32:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:32:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:32:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:32:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:32:23,585 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:32:23,586 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:32:23,810 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:32:23,812 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:32:23,819 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:32:23,820 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:32:23,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:23 BoogieIcfgContainer [2025-03-17 03:32:23,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:32:23,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:32:23,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:32:23,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:32:23,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:32:23" (1/3) ... [2025-03-17 03:32:23,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c126fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:32:23, skipping insertion in model container [2025-03-17 03:32:23,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:23" (2/3) ... [2025-03-17 03:32:23,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c126fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:32:23, skipping insertion in model container [2025-03-17 03:32:23,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:23" (3/3) ... [2025-03-17 03:32:23,827 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-78.i [2025-03-17 03:32:23,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:32:23,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-78.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:32:23,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:32:23,889 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;@259efb80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:32:23,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:32:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 03:32:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 03:32:23,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:23,901 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:32:23,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:23,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1910077232, now seen corresponding path program 1 times [2025-03-17 03:32:23,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:32:23,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728271680] [2025-03-17 03:32:23,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:32:23,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 03:32:23,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 03:32:23,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:23,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 03:32:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:32:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728271680] [2025-03-17 03:32:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728271680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:32:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441862826] [2025-03-17 03:32:24,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:24,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:32:24,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:32:24,110 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-17 03:32:24,112 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-17 03:32:24,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 03:32:24,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 03:32:24,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:24,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:24,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:32:24,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:32:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 03:32:24,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:32:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441862826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:32:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:32:24,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:32:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052125528] [2025-03-17 03:32:24,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:32:24,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:32:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:32:24,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:32:24,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:32:24,292 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 03:32:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:32:24,309 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2025-03-17 03:32:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:32:24,311 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2025-03-17 03:32:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:32:24,315 INFO L225 Difference]: With dead ends: 99 [2025-03-17 03:32:24,315 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 03:32:24,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-17 03:32:24,319 INFO L435 NwaCegarLoop]: 73 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, 73 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-17 03:32:24,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:32:24,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 03:32:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 03:32:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 03:32:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-03-17 03:32:24,346 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 121 [2025-03-17 03:32:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:32:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-03-17 03:32:24,346 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 03:32:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-03-17 03:32:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 03:32:24,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:24,349 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:32:24,356 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-17 03:32:24,550 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-17 03:32:24,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:24,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash 206829967, now seen corresponding path program 1 times [2025-03-17 03:32:24,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:32:24,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936074043] [2025-03-17 03:32:24,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:24,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:32:24,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 03:32:24,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 03:32:24,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:24,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:32:24,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:32:24,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 03:32:24,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 03:32:24,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:24,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:32:24,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:32:24,787 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:32:24,788 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:32:24,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:32:24,790 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:32:24,854 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:32:24,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:32:24 BoogieIcfgContainer [2025-03-17 03:32:24,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:32:24,857 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:32:24,857 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:32:24,857 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:32:24,858 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:23" (3/4) ... [2025-03-17 03:32:24,859 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:32:24,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:32:24,861 INFO L158 Benchmark]: Toolchain (without parser) took 1643.14ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 114.9MB in the end (delta: 14.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2025-03-17 03:32:24,861 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:32:24,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.37ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 117.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:32:24,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.98ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 115.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:32:24,862 INFO L158 Benchmark]: Boogie Preprocessor took 27.87ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 113.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:32:24,862 INFO L158 Benchmark]: IcfgBuilder took 338.12ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 97.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:32:24,862 INFO L158 Benchmark]: TraceAbstraction took 1034.46ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 115.0MB in the end (delta: -18.3MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2025-03-17 03:32:24,862 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 114.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:32:24,863 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.34ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.37ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 117.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.98ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 115.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.87ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 113.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 338.12ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 97.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1034.46ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 115.0MB in the end (delta: -18.3MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 114.9MB in the end (delta: 50.8kB). 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 91, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someUnaryDOUBLEoperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_6 = 128; [L26] signed long int var_1_7 = 10; [L27] signed short int var_1_8 = 0; [L28] signed short int var_1_9 = 25; [L29] signed short int var_1_10 = 32; [L30] signed short int var_1_11 = 1000; [L31] signed short int var_1_12 = 25; [L32] signed short int var_1_13 = 128; [L33] unsigned long int var_1_14 = 5; [L34] float var_1_15 = 8.25; [L35] float var_1_16 = 63.5; [L36] float var_1_17 = -0.6; [L37] signed long int last_1_var_1_1 = -200; [L103] isInitial = 1 [L104] FCALL initially() [L105] int k_loop; [L106] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L106] COND TRUE k_loop < 1 [L107] CALL updateLastVariables() [L96] last_1_var_1_1 = var_1_1 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L66] var_1_3 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L67] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L68] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L69] var_1_6 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L71] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L74] RET assume_abort_if_not(var_1_7 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L78] var_1_10 = __VERIFIER_nondet_short() [L79] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L80] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L81] var_1_11 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_11 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L82] RET assume_abort_if_not(var_1_11 >= -8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_11 <= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L83] RET assume_abort_if_not(var_1_11 <= 8192) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L84] var_1_12 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_12 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_12 >= -8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L86] CALL assume_abort_if_not(var_1_12 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_12 <= 8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L87] var_1_13 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L89] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L90] var_1_16 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L92] var_1_17 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L108] RET updateVariables() [L109] CALL step() [L41] COND TRUE \read(var_1_3) [L42] var_1_14 = (2931747731u - var_1_10) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L44] unsigned char stepLocal_1 = var_1_3; [L45] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=-256, stepLocal_1=-255, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L46] COND FALSE !(var_1_2 && stepLocal_1) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=-256, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=1] [L53] COND FALSE !(var_1_14 > var_1_14) [L56] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_13) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=-256, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=33/4, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=1] [L58] COND TRUE var_1_11 >= var_1_1 [L59] var_1_15 = ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=-256, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=2931747736, var_1_16=2931747736, var_1_17=2931747736, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=1] [L109] RET step() [L110] CALL, EXPR property() [L99-L100] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_14 > last_1_var_1_1)) ? (var_1_1 == ((signed long int) (var_1_6 - var_1_7))) : (var_1_1 == ((signed long int) var_1_6))) : 1) && ((var_1_14 > var_1_14) ? (var_1_8 == ((signed short int) ((var_1_9 - var_1_10) + ((((-4) < ((var_1_11 + var_1_12))) ? (-4) : ((var_1_11 + var_1_12))))))) : (var_1_8 == ((signed short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_13))))) && (var_1_3 ? (var_1_14 == ((unsigned long int) (2931747731u - var_1_10))) : 1)) && ((var_1_11 >= var_1_1) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=2931747736, var_1_16=2931747736, var_1_17=2931747736, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=-200, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=2931747736, var_1_16=2931747736, var_1_17=2931747736, var_1_1=-200, var_1_2=-256, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 96 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 73 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 281 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1482/1520 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-17 03:32:24,877 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_loopvsstraightlinecode_25-1loop_file-78.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 c2fd7fb27bc7851d54e677fa9fb3be51bb09b78aa3b59eb4223bc2d43faa03f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:32:26,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:32:26,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:32:26,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:32:26,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:32:26,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:32:26,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:32:26,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:32:26,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:32:26,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:32:26,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:32:26,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:32:26,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:32:26,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:32:26,901 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:32:26,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:32:26,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:32:26,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:32:26,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:32:26,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:32:26,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:32:26,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:32:26,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:32:26,901 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:32:26,901 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:32:26,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:32:26,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:32:26,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:32:26,902 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 -> c2fd7fb27bc7851d54e677fa9fb3be51bb09b78aa3b59eb4223bc2d43faa03f5 [2025-03-17 03:32:27,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:32:27,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:32:27,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:32:27,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:32:27,209 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:32:27,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-78.i [2025-03-17 03:32:28,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc32bec4d/ef6927f5871e4f91afbdcaff73b87fcb/FLAGdb8579660 [2025-03-17 03:32:28,724 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:32:28,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-78.i [2025-03-17 03:32:28,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc32bec4d/ef6927f5871e4f91afbdcaff73b87fcb/FLAGdb8579660 [2025-03-17 03:32:28,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc32bec4d/ef6927f5871e4f91afbdcaff73b87fcb [2025-03-17 03:32:28,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:32:28,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:32:28,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:32:28,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:32:28,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:32:28,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:28,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53731e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28, skipping insertion in model container [2025-03-17 03:32:28,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:28,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:32:28,871 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_loopvsstraightlinecode_25-1loop_file-78.i[915,928] [2025-03-17 03:32:28,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:32:28,938 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:32:28,947 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_loopvsstraightlinecode_25-1loop_file-78.i[915,928] [2025-03-17 03:32:28,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:32:28,986 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:32:28,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28 WrapperNode [2025-03-17 03:32:28,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:32:28,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:32:28,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:32:28,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:32:28,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:28,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,020 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-03-17 03:32:29,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:32:29,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:32:29,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:32:29,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:32:29,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,050 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-17 03:32:29,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:32:29,074 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:32:29,074 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:32:29,074 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:32:29,075 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (1/1) ... [2025-03-17 03:32:29,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:32:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:32:29,104 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-17 03:32:29,110 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-17 03:32:29,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:32:29,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:32:29,129 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:32:29,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:32:29,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:32:29,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:32:29,184 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:32:29,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:32:29,412 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:32:29,412 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:32:29,423 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:32:29,425 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:32:29,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:29 BoogieIcfgContainer [2025-03-17 03:32:29,426 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:32:29,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:32:29,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:32:29,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:32:29,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:32:28" (1/3) ... [2025-03-17 03:32:29,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7dc7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:32:29, skipping insertion in model container [2025-03-17 03:32:29,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:28" (2/3) ... [2025-03-17 03:32:29,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7dc7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:32:29, skipping insertion in model container [2025-03-17 03:32:29,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:29" (3/3) ... [2025-03-17 03:32:29,434 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-78.i [2025-03-17 03:32:29,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:32:29,450 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-78.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:32:29,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:32:29,511 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;@52742f37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:32:29,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:32:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 03:32:29,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 03:32:29,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:29,522 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:32:29,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:29,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:29,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1910077232, now seen corresponding path program 1 times [2025-03-17 03:32:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:32:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947189541] [2025-03-17 03:32:29,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:29,538 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-17 03:32:29,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:32:29,540 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-17 03:32:29,541 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-17 03:32:29,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 03:32:29,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 03:32:29,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:29,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:29,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:32:29,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:32:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-17 03:32:29,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:32:29,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:32:29,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947189541] [2025-03-17 03:32:29,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947189541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:32:29,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:32:29,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:32:29,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934398762] [2025-03-17 03:32:29,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:32:29,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:32:29,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:32:29,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:32:29,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:32:29,755 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 03:32:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:32:29,770 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2025-03-17 03:32:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:32:29,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2025-03-17 03:32:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:32:29,776 INFO L225 Difference]: With dead ends: 99 [2025-03-17 03:32:29,776 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 03:32:29,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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-17 03:32:29,780 INFO L435 NwaCegarLoop]: 73 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, 73 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-17 03:32:29,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:32:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 03:32:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 03:32:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 03:32:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-03-17 03:32:29,814 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 121 [2025-03-17 03:32:29,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:32:29,814 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-03-17 03:32:29,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 03:32:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-03-17 03:32:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 03:32:29,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:29,819 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:32:29,826 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 (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:32:30,023 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-17 03:32:30,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:30,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash 206829967, now seen corresponding path program 1 times [2025-03-17 03:32:30,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:32:30,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584295486] [2025-03-17 03:32:30,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:30,025 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-17 03:32:30,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:32:30,029 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-17 03:32:30,030 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-17 03:32:30,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 03:32:30,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 03:32:30,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:30,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:30,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 03:32:30,164 INFO L279 TraceCheckSpWp]: Computing forward predicates...