./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_codestructure_steplocals_file-23.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 9a6eb020dd5fc267d88746fe4eb11cf317cd32bdb77c0e2b4d0f38e8ddbe11e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:10:30,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:10:31,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:10:31,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:10:31,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:10:31,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:10:31,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:10:31,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:10:31,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:10:31,038 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:10:31,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:10:31,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:10:31,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:10:31,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:10:31,039 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:10:31,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:10:31,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:10:31,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:10:31,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:10:31,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:10:31,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:10:31,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:10:31,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:10:31,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:10:31,041 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:10:31,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:10:31,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:10:31,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:10:31,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:10:31,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:10:31,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:10:31,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:10:31,042 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 -> 9a6eb020dd5fc267d88746fe4eb11cf317cd32bdb77c0e2b4d0f38e8ddbe11e3 [2025-03-08 10:10:31,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:10:31,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:10:31,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:10:31,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:10:31,277 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:10:31,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-23.i [2025-03-08 10:10:32,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4e4df27/12cc96dded434b55aca591dc5802820c/FLAG3a66a9a13 [2025-03-08 10:10:32,687 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:10:32,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-23.i [2025-03-08 10:10:32,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4e4df27/12cc96dded434b55aca591dc5802820c/FLAG3a66a9a13 [2025-03-08 10:10:33,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4e4df27/12cc96dded434b55aca591dc5802820c [2025-03-08 10:10:33,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:10:33,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:10:33,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:10:33,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:10:33,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:10:33,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67fdf3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33, skipping insertion in model container [2025-03-08 10:10:33,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:10:33,143 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_codestructure_steplocals_file-23.i[917,930] [2025-03-08 10:10:33,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:10:33,213 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:10:33,222 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_codestructure_steplocals_file-23.i[917,930] [2025-03-08 10:10:33,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:10:33,270 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:10:33,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33 WrapperNode [2025-03-08 10:10:33,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:10:33,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:10:33,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:10:33,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:10:33,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,317 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2025-03-08 10:10:33,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:10:33,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:10:33,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:10:33,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:10:33,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,350 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-08 10:10:33,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:10:33,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:10:33,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:10:33,363 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:10:33,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (1/1) ... [2025-03-08 10:10:33,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:10:33,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:10:33,389 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-08 10:10:33,392 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-08 10:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:10:33,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:10:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:10:33,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:10:33,475 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:10:33,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:10:33,738 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:10:33,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:10:33,745 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:10:33,747 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:10:33,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:10:33 BoogieIcfgContainer [2025-03-08 10:10:33,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:10:33,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:10:33,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:10:33,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:10:33,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:10:33" (1/3) ... [2025-03-08 10:10:33,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e77cc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:10:33, skipping insertion in model container [2025-03-08 10:10:33,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:33" (2/3) ... [2025-03-08 10:10:33,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e77cc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:10:33, skipping insertion in model container [2025-03-08 10:10:33,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:10:33" (3/3) ... [2025-03-08 10:10:33,755 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-23.i [2025-03-08 10:10:33,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:10:33,765 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-23.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:10:33,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:10:33,809 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;@4150fee3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:10:33,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:10:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:10:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:10:33,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:10:33,825 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:10:33,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:10:33,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:10:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1770355671, now seen corresponding path program 1 times [2025-03-08 10:10:33,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:10:33,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389527387] [2025-03-08 10:10:33,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:33,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:10:33,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:10:33,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:10:33,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:33,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:10:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 10:10:34,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:10:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389527387] [2025-03-08 10:10:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389527387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:10:34,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660164729] [2025-03-08 10:10:34,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:34,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:10:34,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:10:34,137 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-08 10:10:34,139 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-08 10:10:34,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:10:34,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:10:34,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:34,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:10:34,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:10:34,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:10:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 10:10:34,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:10:34,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660164729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:10:34,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:10:34,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:10:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081464890] [2025-03-08 10:10:34,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:10:34,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:10:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:10:34,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:10:34,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:10:34,340 INFO L87 Difference]: Start difference. First operand has 75 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 10:10:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:10:34,364 INFO L93 Difference]: Finished difference Result 144 states and 248 transitions. [2025-03-08 10:10:34,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:10:34,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2025-03-08 10:10:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:10:34,371 INFO L225 Difference]: With dead ends: 144 [2025-03-08 10:10:34,371 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 10:10:34,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 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-08 10:10:34,378 INFO L435 NwaCegarLoop]: 108 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, 108 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-08 10:10:34,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:10:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 10:10:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-08 10:10:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:10:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2025-03-08 10:10:34,412 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 170 [2025-03-08 10:10:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:10:34,412 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2025-03-08 10:10:34,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 10:10:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2025-03-08 10:10:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:10:34,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:10:34,416 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:10:34,423 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-08 10:10:34,617 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-08 10:10:34,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:10:34,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:10:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2121280064, now seen corresponding path program 1 times [2025-03-08 10:10:34,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:10:34,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506892884] [2025-03-08 10:10:34,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:34,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:10:34,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:10:34,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:10:34,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:34,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:10:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:10:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:10:34,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506892884] [2025-03-08 10:10:34,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506892884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:10:34,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:10:34,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:10:34,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613066017] [2025-03-08 10:10:34,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:10:34,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:10:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:10:34,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:10:34,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:10:34,835 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:10:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:10:34,880 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2025-03-08 10:10:34,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:10:34,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:10:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:10:34,885 INFO L225 Difference]: With dead ends: 162 [2025-03-08 10:10:34,885 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 10:10:34,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:10:34,886 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 28 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:10:34,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 201 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:10:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 10:10:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2025-03-08 10:10:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:10:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 127 transitions. [2025-03-08 10:10:34,898 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 127 transitions. Word has length 170 [2025-03-08 10:10:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:10:34,899 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 127 transitions. [2025-03-08 10:10:34,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:10:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 127 transitions. [2025-03-08 10:10:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:10:34,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:10:34,902 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:10:34,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:10:34,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:10:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:10:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1992197345, now seen corresponding path program 1 times [2025-03-08 10:10:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:10:34,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831654406] [2025-03-08 10:10:34,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:10:34,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:10:35,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:10:35,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:35,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:10:35,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765075415] [2025-03-08 10:10:35,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:35,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:10:35,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:10:35,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:10:35,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:10:35,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:10:35,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:10:35,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:35,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:10:35,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:10:35,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:10:35,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:10:35,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:35,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:10:35,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:10:35,398 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:10:35,398 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:10:35,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:10:35,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 10:10:35,602 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 10:10:35,686 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:10:35,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:10:35 BoogieIcfgContainer [2025-03-08 10:10:35,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:10:35,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:10:35,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:10:35,694 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:10:35,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:10:33" (3/4) ... [2025-03-08 10:10:35,696 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:10:35,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:10:35,698 INFO L158 Benchmark]: Toolchain (without parser) took 2677.97ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 57.9MB in the end (delta: 54.2MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2025-03-08 10:10:35,698 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:10:35,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.98ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:10:35,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.12ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 93.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:10:35,700 INFO L158 Benchmark]: Boogie Preprocessor took 43.62ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 86.9MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:10:35,700 INFO L158 Benchmark]: IcfgBuilder took 385.52ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 63.5MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:10:35,701 INFO L158 Benchmark]: TraceAbstraction took 1943.15ms. Allocated memory is still 142.6MB. Free memory was 62.6MB in the beginning and 57.9MB in the end (delta: 4.7MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2025-03-08 10:10:35,701 INFO L158 Benchmark]: Witness Printer took 4.74ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 57.9MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:10:35,702 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.98ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.12ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 93.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.62ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 86.9MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 385.52ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 63.5MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1943.15ms. Allocated memory is still 142.6MB. Free memory was 62.6MB in the beginning and 57.9MB in the end (delta: 4.7MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Witness Printer took 4.74ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 57.9MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someUnaryDOUBLEoperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 1.4; [L26] double var_1_5 = 3.6; [L27] double var_1_6 = 10.6; [L28] float var_1_7 = 9.25; [L29] float var_1_8 = 1.2; [L30] float var_1_9 = 0.0; [L31] float var_1_10 = 3.1; [L32] float var_1_11 = 500.5; [L33] signed long int var_1_12 = 0; [L34] unsigned char var_1_13 = 10; [L35] unsigned char var_1_14 = 8; [L36] signed long int var_1_15 = 8; [L37] signed long int var_1_16 = -25; [L38] unsigned char var_1_17 = 64; [L39] unsigned long int var_1_18 = 25; [L40] signed char var_1_19 = -100; [L41] signed short int var_1_20 = -4; [L42] unsigned short int var_1_21 = 200; [L43] unsigned short int var_1_22 = 54878; [L44] double var_1_23 = 9999.8; [L45] float var_1_24 = -0.25; [L46] signed char var_1_25 = 50; VAL [isInitial=0, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L151] isInitial = 1 [L152] FCALL initially() [L153] COND TRUE 1 [L154] FCALL updateLastVariables() [L155] CALL updateVariables() [L100] var_1_2 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L101] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_3=0, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L102] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L103] var_1_3 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L104] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L105] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_5=18/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L106] var_1_5 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L107] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_6=53/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L108] var_1_6 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L109] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L110] var_1_7 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L111] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L112] var_1_8 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_9=0] [L113] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5, var_1_9=0] [L114] var_1_9 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_9 >= 4611686.018427382800e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L115] RET assume_abort_if_not((var_1_9 >= 4611686.018427382800e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L116] var_1_10 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L117] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L118] var_1_11 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L119] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L120] var_1_13 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L121] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=0, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L122] CALL assume_abort_if_not(var_1_13 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L122] RET assume_abort_if_not(var_1_13 <= 64) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=8, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L123] var_1_14 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L124] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L125] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L125] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=8, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L126] var_1_15 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L127] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L128] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L128] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-25, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L129] var_1_16 = __VERIFIER_nondet_long() [L130] CALL assume_abort_if_not(var_1_16 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L130] RET assume_abort_if_not(var_1_16 >= -1073741823) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L131] CALL assume_abort_if_not(var_1_16 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L131] RET assume_abort_if_not(var_1_16 <= 1073741823) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L132] var_1_17 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L133] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L134] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L134] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L135] CALL assume_abort_if_not(var_1_17 != 127) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L135] RET assume_abort_if_not(var_1_17 != 127) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L136] var_1_20 = __VERIFIER_nondet_short() [L137] CALL assume_abort_if_not(var_1_20 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L137] RET assume_abort_if_not(var_1_20 >= -32768) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L138] CALL assume_abort_if_not(var_1_20 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L138] RET assume_abort_if_not(var_1_20 <= 32767) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L139] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L139] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L140] var_1_22 = __VERIFIER_nondet_ushort() [L141] CALL assume_abort_if_not(var_1_22 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L141] RET assume_abort_if_not(var_1_22 >= 32767) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L142] CALL assume_abort_if_not(var_1_22 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L142] RET assume_abort_if_not(var_1_22 <= 65534) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L155] RET updateVariables() [L156] CALL step() [L50] COND TRUE \read(var_1_2) [L51] var_1_1 = var_1_3 VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L53] unsigned char stepLocal_0 = var_1_5 <= var_1_6; VAL [isInitial=1, stepLocal_0=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=7/5] [L54] COND TRUE stepLocal_0 || var_1_2 [L55] var_1_4 = ((((31.5f) > (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (31.5f) : (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))) VAL [isInitial=1, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L59] signed long int stepLocal_3 = (200 - var_1_13) - var_1_14; [L60] signed long int stepLocal_2 = var_1_15 / (128 - var_1_17); [L61] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_1=4, stepLocal_2=-1, stepLocal_3=69, var_1_12=0, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L62] COND TRUE stepLocal_3 != var_1_15 [L63] var_1_12 = (var_1_13 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, stepLocal_1=4, stepLocal_2=-1, var_1_12=3, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L75] COND TRUE (- (var_1_13 / var_1_17)) > var_1_15 [L76] var_1_18 = var_1_13 VAL [isInitial=1, stepLocal_1=4, stepLocal_2=-1, var_1_12=3, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=4, var_1_19=-100, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L78] COND TRUE (var_1_16 / ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20)))) > var_1_18 [L79] var_1_19 = ((((var_1_17) > (var_1_13)) ? (var_1_17) : (var_1_13))) VAL [isInitial=1, stepLocal_1=4, stepLocal_2=-1, var_1_12=3, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=4, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L83] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, stepLocal_1=4, stepLocal_2=-1, stepLocal_4=261, var_1_12=3, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=4, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L84] COND TRUE 5 <= stepLocal_4 [L85] var_1_21 = (var_1_22 - var_1_17) VAL [isInitial=1, stepLocal_1=4, stepLocal_2=-1, var_1_12=3, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=4, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=32762, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L95] var_1_23 = var_1_10 [L96] var_1_24 = 31.75f [L97] var_1_25 = -5 VAL [isInitial=1, stepLocal_1=4, stepLocal_2=-1, var_1_10=2, var_1_12=3, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=4, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=32762, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L156] RET step() [L157] CALL, EXPR property() [L147-L148] return ((((((((var_1_2 ? (var_1_1 == ((unsigned char) var_1_3)) : 1) && (((var_1_5 <= var_1_6) || var_1_2) ? (var_1_4 == ((float) ((((31.5f) > (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (31.5f) : (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))))) : (var_1_4 == ((float) ((var_1_9 - var_1_10) - var_1_11))))) && ((((200 - var_1_13) - var_1_14) != var_1_15) ? (var_1_12 == ((signed long int) (var_1_13 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : (((var_1_15 / (128 - var_1_17)) < var_1_13) ? ((var_1_13 >= var_1_15) ? (var_1_12 == ((signed long int) var_1_14)) : (var_1_12 == ((signed long int) var_1_17))) : (var_1_12 == ((signed long int) var_1_17))))) && (((- (var_1_13 / var_1_17)) > var_1_15) ? (var_1_18 == ((unsigned long int) var_1_13)) : 1)) && (((var_1_16 / ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20)))) > var_1_18) ? (var_1_19 == ((signed char) ((((var_1_17) > (var_1_13)) ? (var_1_17) : (var_1_13))))) : (var_1_19 == ((signed char) var_1_17)))) && ((5 <= var_1_17) ? (var_1_21 == ((unsigned short int) (var_1_22 - var_1_17))) : (var_1_1 ? (var_1_2 ? (var_1_21 == ((unsigned short int) var_1_17)) : (var_1_21 == ((unsigned short int) var_1_17))) : 1))) && (var_1_23 == ((double) var_1_10))) && (var_1_24 == ((float) 31.75f))) && (var_1_25 == ((signed char) -5)) ; VAL [\result=0, isInitial=1, var_1_10=2, var_1_12=3, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=4, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=32762, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L157] RET, EXPR property() [L157] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=4, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=32762, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=4, var_1_14=127, var_1_15=-123, var_1_16=-1, var_1_17=261, var_1_18=4, var_1_19=5, var_1_1=0, var_1_20=1, var_1_21=32762, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 140 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 213 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 850 NumberOfCodeBlocks, 850 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 4160/4212 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-08 10:10:35,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_codestructure_steplocals_file-23.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 9a6eb020dd5fc267d88746fe4eb11cf317cd32bdb77c0e2b4d0f38e8ddbe11e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:10:37,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:10:37,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:10:37,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:10:37,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:10:37,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:10:37,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:10:37,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:10:37,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:10:37,643 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:10:37,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:10:37,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:10:37,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:10:37,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:10:37,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:10:37,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:10:37,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:10:37,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:10:37,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:10:37,645 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 -> 9a6eb020dd5fc267d88746fe4eb11cf317cd32bdb77c0e2b4d0f38e8ddbe11e3 [2025-03-08 10:10:37,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:10:37,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:10:37,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:10:37,900 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:10:37,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:10:37,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-23.i [2025-03-08 10:10:39,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9e4e53c/064ed1941429445c843a55c4429e7b71/FLAG42a64e67b [2025-03-08 10:10:39,306 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:10:39,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-23.i [2025-03-08 10:10:39,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9e4e53c/064ed1941429445c843a55c4429e7b71/FLAG42a64e67b [2025-03-08 10:10:39,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9e4e53c/064ed1941429445c843a55c4429e7b71 [2025-03-08 10:10:39,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:10:39,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:10:39,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:10:39,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:10:39,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:10:39,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b7b808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39, skipping insertion in model container [2025-03-08 10:10:39,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:10:39,763 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_codestructure_steplocals_file-23.i[917,930] [2025-03-08 10:10:39,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:10:39,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:10:39,825 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_codestructure_steplocals_file-23.i[917,930] [2025-03-08 10:10:39,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:10:39,857 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:10:39,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39 WrapperNode [2025-03-08 10:10:39,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:10:39,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:10:39,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:10:39,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:10:39,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,900 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-03-08 10:10:39,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:10:39,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:10:39,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:10:39,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:10:39,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,925 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-08 10:10:39,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:10:39,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:10:39,948 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:10:39,948 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:10:39,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (1/1) ... [2025-03-08 10:10:39,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:10:39,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:10:39,981 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-08 10:10:39,984 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-08 10:10:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:10:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:10:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:10:40,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:10:40,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:10:40,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:10:40,077 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:10:40,079 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:10:41,356 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:10:41,356 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:10:41,364 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:10:41,366 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:10:41,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:10:41 BoogieIcfgContainer [2025-03-08 10:10:41,366 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:10:41,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:10:41,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:10:41,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:10:41,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:10:39" (1/3) ... [2025-03-08 10:10:41,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bc79de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:10:41, skipping insertion in model container [2025-03-08 10:10:41,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:39" (2/3) ... [2025-03-08 10:10:41,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bc79de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:10:41, skipping insertion in model container [2025-03-08 10:10:41,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:10:41" (3/3) ... [2025-03-08 10:10:41,375 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-23.i [2025-03-08 10:10:41,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:10:41,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-23.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:10:41,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:10:41,438 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;@1b2683fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:10:41,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:10:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:10:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:10:41,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:10:41,465 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:10:41,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:10:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:10:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1770355671, now seen corresponding path program 1 times [2025-03-08 10:10:41,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:10:41,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475154023] [2025-03-08 10:10:41,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:41,488 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-08 10:10:41,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:10:41,493 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-08 10:10:41,494 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-08 10:10:41,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:10:41,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:10:41,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:41,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:10:41,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:10:41,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:10:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2025-03-08 10:10:41,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:10:41,908 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:10:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475154023] [2025-03-08 10:10:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475154023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:10:41,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:10:41,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:10:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539866629] [2025-03-08 10:10:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:10:41,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:10:41,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:10:41,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:10:41,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:10:41,927 INFO L87 Difference]: Start difference. First operand has 75 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 10:10:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:10:41,949 INFO L93 Difference]: Finished difference Result 144 states and 248 transitions. [2025-03-08 10:10:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:10:41,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2025-03-08 10:10:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:10:41,955 INFO L225 Difference]: With dead ends: 144 [2025-03-08 10:10:41,955 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 10:10:41,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-08 10:10:41,959 INFO L435 NwaCegarLoop]: 108 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, 108 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-08 10:10:41,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:10:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 10:10:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-08 10:10:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:10:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2025-03-08 10:10:41,997 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 170 [2025-03-08 10:10:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:10:41,997 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2025-03-08 10:10:41,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 10:10:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2025-03-08 10:10:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:10:42,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:10:42,002 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:10:42,014 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-08 10:10:42,202 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-08 10:10:42,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:10:42,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:10:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2121280064, now seen corresponding path program 1 times [2025-03-08 10:10:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:10:42,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310495268] [2025-03-08 10:10:42,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:42,204 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-08 10:10:42,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:10:42,207 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-08 10:10:42,208 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-08 10:10:42,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:10:42,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:10:42,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:42,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:10:42,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 10:10:42,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:10:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:10:42,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:10:42,580 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:10:42,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310495268] [2025-03-08 10:10:42,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310495268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:10:42,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:10:42,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:10:42,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679787101] [2025-03-08 10:10:42,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:10:42,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:10:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:10:42,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:10:42,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:10:42,582 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:10:44,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:10:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:10:44,756 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2025-03-08 10:10:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:10:44,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:10:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:10:44,776 INFO L225 Difference]: With dead ends: 162 [2025-03-08 10:10:44,776 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 10:10:44,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:10:44,777 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 28 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:10:44,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 200 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 10:10:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 10:10:44,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2025-03-08 10:10:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:10:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 127 transitions. [2025-03-08 10:10:44,786 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 127 transitions. Word has length 170 [2025-03-08 10:10:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:10:44,789 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 127 transitions. [2025-03-08 10:10:44,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:10:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 127 transitions. [2025-03-08 10:10:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:10:44,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:10:44,792 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:10:44,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 10:10:44,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:10:44,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:10:44,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:10:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1992197345, now seen corresponding path program 1 times [2025-03-08 10:10:44,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:10:44,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150796366] [2025-03-08 10:10:44,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:10:44,994 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-08 10:10:44,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:10:44,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:10:44,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 10:10:45,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:10:45,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:10:45,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:10:45,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:10:45,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 10:10:45,310 INFO L279 TraceCheckSpWp]: Computing forward predicates...