./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.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 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:33:20,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:33:20,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:33:20,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:33:20,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:33:20,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:33:20,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:33:20,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:33:20,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:33:20,883 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:33:20,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:33:20,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:33:20,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:33:20,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:33:20,884 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:33:20,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:33:20,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:33:20,885 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:33:20,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:33:20,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:33:20,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:33:20,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:33:20,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:33:20,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:33:20,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:33:20,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:33:20,886 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:33:20,886 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:33:20,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:33:20,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:33:20,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:33:20,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:33:20,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:33:20,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:33:20,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:33:20,887 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:33:20,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:33:20,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:33:20,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:33:20,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:33:20,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:33:20,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:33:20,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:33:20,887 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 -> 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c [2025-03-17 03:33:21,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:33:21,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:33:21,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:33:21,145 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:33:21,145 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:33:21,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i [2025-03-17 03:33:22,290 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1285ff5e/ed253d737392459c8da6d175bdf599de/FLAG483f226fb [2025-03-17 03:33:22,555 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:33:22,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i [2025-03-17 03:33:22,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1285ff5e/ed253d737392459c8da6d175bdf599de/FLAG483f226fb [2025-03-17 03:33:22,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1285ff5e/ed253d737392459c8da6d175bdf599de [2025-03-17 03:33:22,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:33:22,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:33:22,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:33:22,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:33:22,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:33:22,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:33:22" (1/1) ... [2025-03-17 03:33:22,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eec23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:22, skipping insertion in model container [2025-03-17 03:33:22,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:33:22" (1/1) ... [2025-03-17 03:33:22,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:33:22,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i[915,928] [2025-03-17 03:33:23,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:33:23,046 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:33:23,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i[915,928] [2025-03-17 03:33:23,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:33:23,092 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:33:23,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23 WrapperNode [2025-03-17 03:33:23,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:33:23,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:33:23,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:33:23,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:33:23,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,135 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-17 03:33:23,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:33:23,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:33:23,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:33:23,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:33:23,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,162 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:33:23,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:33:23,184 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:33:23,187 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:33:23,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:33:23,188 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (1/1) ... [2025-03-17 03:33:23,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:33:23,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:33:23,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:33:23,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:33:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:33:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:33:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:33:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:33:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:33:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:33:23,288 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:33:23,290 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:33:23,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2025-03-17 03:33:23,493 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-17 03:33:23,494 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:33:23,511 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:33:23,511 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:33:23,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:33:23 BoogieIcfgContainer [2025-03-17 03:33:23,512 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:33:23,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:33:23,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:33:23,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:33:23,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:33:22" (1/3) ... [2025-03-17 03:33:23,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4f3d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:33:23, skipping insertion in model container [2025-03-17 03:33:23,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:23" (2/3) ... [2025-03-17 03:33:23,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4f3d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:33:23, skipping insertion in model container [2025-03-17 03:33:23,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:33:23" (3/3) ... [2025-03-17 03:33:23,519 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-85.i [2025-03-17 03:33:23,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:33:23,531 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-85.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:33:23,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:33:23,579 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;@17b847de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:33:23,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:33:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:33:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 03:33:23,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:23,593 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:33:23,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:23,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash 605691171, now seen corresponding path program 1 times [2025-03-17 03:33:23,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:33:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394414483] [2025-03-17 03:33:23,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:33:23,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 03:33:23,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 03:33:23,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:23,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:33:23,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:33:23,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394414483] [2025-03-17 03:33:23,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394414483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:33:23,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443377652] [2025-03-17 03:33:23,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:23,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:33:23,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:33:23,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:33:23,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:33:23,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 03:33:23,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 03:33:23,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:23,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:23,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:33:23,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:33:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:33:23,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:33:23,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443377652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:33:23,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:33:23,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:33:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685866842] [2025-03-17 03:33:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:33:23,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:33:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:33:23,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:33:23,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:33:23,981 INFO L87 Difference]: Start difference. First operand has 59 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:33:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:33:24,004 INFO L93 Difference]: Finished difference Result 117 states and 195 transitions. [2025-03-17 03:33:24,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:33:24,007 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2025-03-17 03:33:24,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:33:24,011 INFO L225 Difference]: With dead ends: 117 [2025-03-17 03:33:24,011 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 03:33:24,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:33:24,015 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:33:24,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:33:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 03:33:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 03:33:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:33:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-03-17 03:33:24,047 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 101 [2025-03-17 03:33:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:33:24,048 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-03-17 03:33:24,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:33:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-03-17 03:33:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 03:33:24,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:24,051 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:33:24,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:33:24,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:33:24,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:24,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash 923528321, now seen corresponding path program 1 times [2025-03-17 03:33:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:33:24,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941064611] [2025-03-17 03:33:24,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:33:24,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 03:33:24,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 03:33:24,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:24,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:33:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:33:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941064611] [2025-03-17 03:33:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941064611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:33:24,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:33:24,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:33:24,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124482964] [2025-03-17 03:33:24,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:33:24,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:33:24,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:33:24,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:33:24,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:33:24,908 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:33:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:33:25,061 INFO L93 Difference]: Finished difference Result 158 states and 232 transitions. [2025-03-17 03:33:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:33:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-03-17 03:33:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:33:25,065 INFO L225 Difference]: With dead ends: 158 [2025-03-17 03:33:25,065 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 03:33:25,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:33:25,066 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:33:25,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 330 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:33:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 03:33:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2025-03-17 03:33:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 64 states have internal predecessors, (82), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:33:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2025-03-17 03:33:25,088 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 101 [2025-03-17 03:33:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:33:25,088 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2025-03-17 03:33:25,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:33:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2025-03-17 03:33:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 03:33:25,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:25,090 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:33:25,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:33:25,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:25,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:25,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2036183994, now seen corresponding path program 1 times [2025-03-17 03:33:25,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:33:25,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641785922] [2025-03-17 03:33:25,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:25,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:33:25,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 03:33:25,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 03:33:25,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:25,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:33:25,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:33:25,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641785922] [2025-03-17 03:33:25,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641785922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:33:25,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:33:25,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:33:25,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842916216] [2025-03-17 03:33:25,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:33:25,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:33:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:33:25,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:33:25,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:33:25,160 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:33:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:33:25,196 INFO L93 Difference]: Finished difference Result 186 states and 264 transitions. [2025-03-17 03:33:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:33:25,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2025-03-17 03:33:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:33:25,197 INFO L225 Difference]: With dead ends: 186 [2025-03-17 03:33:25,199 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 03:33:25,200 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-17 03:33:25,200 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 55 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:33:25,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 173 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:33:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 03:33:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2025-03-17 03:33:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:33:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2025-03-17 03:33:25,210 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 102 [2025-03-17 03:33:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:33:25,211 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2025-03-17 03:33:25,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:33:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2025-03-17 03:33:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 03:33:25,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:25,214 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:33:25,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:33:25,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:25,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:25,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1371708323, now seen corresponding path program 1 times [2025-03-17 03:33:25,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:33:25,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454468467] [2025-03-17 03:33:25,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:25,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:33:25,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 03:33:25,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 03:33:25,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:25,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:33:25,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:33:25,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454468467] [2025-03-17 03:33:25,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454468467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:33:25,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:33:25,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:33:25,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486325609] [2025-03-17 03:33:25,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:33:25,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:33:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:33:25,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:33:25,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:33:25,573 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:33:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:33:25,757 INFO L93 Difference]: Finished difference Result 191 states and 255 transitions. [2025-03-17 03:33:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:33:25,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2025-03-17 03:33:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:33:25,761 INFO L225 Difference]: With dead ends: 191 [2025-03-17 03:33:25,763 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 03:33:25,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:33:25,764 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 62 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:33:25,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 424 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:33:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 03:33:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2025-03-17 03:33:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:33:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2025-03-17 03:33:25,773 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 102 [2025-03-17 03:33:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:33:25,774 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2025-03-17 03:33:25,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:33:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2025-03-17 03:33:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:33:25,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:25,775 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:33:25,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:33:25,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:25,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1921054175, now seen corresponding path program 1 times [2025-03-17 03:33:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:33:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712936837] [2025-03-17 03:33:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:33:25,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:33:25,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:33:25,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:25,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:33:25,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:33:25,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:33:25,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:33:25,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:25,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:33:25,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:33:25,904 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:33:25,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:33:25,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:33:25,914 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 03:33:25,965 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:33:25,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:33:25 BoogieIcfgContainer [2025-03-17 03:33:25,969 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:33:25,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:33:25,970 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:33:25,970 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:33:25,971 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:33:23" (3/4) ... [2025-03-17 03:33:25,973 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:33:25,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:33:25,975 INFO L158 Benchmark]: Toolchain (without parser) took 3109.58ms. Allocated memory is still 201.3MB. Free memory was 153.1MB in the beginning and 158.1MB in the end (delta: -4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:33:25,975 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:33:25,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.86ms. Allocated memory is still 201.3MB. Free memory was 152.8MB in the beginning and 140.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:33:25,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.86ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 138.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:33:25,975 INFO L158 Benchmark]: Boogie Preprocessor took 46.43ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 137.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:33:25,976 INFO L158 Benchmark]: IcfgBuilder took 327.71ms. Allocated memory is still 201.3MB. Free memory was 137.0MB in the beginning and 118.7MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:33:25,976 INFO L158 Benchmark]: TraceAbstraction took 2455.45ms. Allocated memory is still 201.3MB. Free memory was 118.0MB in the beginning and 158.1MB in the end (delta: -40.2MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2025-03-17 03:33:25,976 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 158.1MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:33:25,977 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.20ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.86ms. Allocated memory is still 201.3MB. Free memory was 152.8MB in the beginning and 140.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.86ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 138.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.43ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 137.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 327.71ms. Allocated memory is still 201.3MB. Free memory was 137.0MB in the beginning and 118.7MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2455.45ms. Allocated memory is still 201.3MB. Free memory was 118.0MB in the beginning and 158.1MB in the end (delta: -40.2MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 158.1MB in the end (delta: 60.0kB). 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 someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = -64; [L25] signed long int var_1_4 = -4; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] signed char var_1_7 = 32; [L29] signed char var_1_8 = -8; [L30] signed char var_1_9 = 10; [L31] double var_1_10 = 1.6; [L32] double var_1_11 = 127.25; [L33] double var_1_12 = 2.5; [L104] isInitial = 1 [L105] FCALL initially() [L106] int k_loop; [L107] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=0, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L107] COND TRUE k_loop < 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L75] RET assume_abort_if_not(var_1_3 >= -1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L76] CALL assume_abort_if_not(var_1_3 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L76] RET assume_abort_if_not(var_1_3 <= 1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L78] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L79] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L79] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L80] var_1_5 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L82] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L82] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L83] var_1_6 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L85] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L85] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L86] var_1_8 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=10] [L87] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=10] [L88] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=10] [L88] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=10] [L89] var_1_9 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L90] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L91] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L91] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L92] var_1_11 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && 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_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L93] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L94] var_1_12 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L95] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L109] RET updateVariables() [L110] CALL step() [L37] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L38] COND FALSE !(\read(var_1_6)) VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L43] COND TRUE \read(var_1_2) [L44] var_1_1 = (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))) VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L56] unsigned char stepLocal_2 = var_1_5; [L57] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=-127, stepLocal_2=-255, var_1_10=8/5, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L58] COND TRUE ! var_1_6 [L59] var_1_10 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=-127, stepLocal_2=-255, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L110] RET step() [L111] CALL, EXPR property() [L100] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L100] EXPR (! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L100] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L100-L101] return ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] [L19] reach_error() VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=126, var_1_9=-127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 106 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 1013 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 631 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 382 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 82 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 2370/2400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:33:25,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.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 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:33:27,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:33:27,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:33:27,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:33:27,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:33:28,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:33:28,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:33:28,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:33:28,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:33:28,011 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:33:28,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:33:28,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:33:28,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:33:28,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:33:28,013 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:33:28,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:33:28,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:33:28,013 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:33:28,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:33:28,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:33:28,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:33:28,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:33:28,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:33:28,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:33:28,014 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:33:28,014 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:33:28,014 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:33:28,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:33:28,014 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:33:28,014 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:33:28,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:33:28,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:33:28,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:33:28,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:33:28,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:33:28,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:33:28,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:33:28,015 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:33:28,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:33:28,016 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:33:28,016 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:33:28,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:33:28,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:33:28,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:33:28,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:33:28,016 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 -> 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c [2025-03-17 03:33:28,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:33:28,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:33:28,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:33:28,257 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:33:28,257 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:33:28,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i [2025-03-17 03:33:29,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d5321ab/30a24961c2e2450fa0881f583a0b0c52/FLAGe265f10d2 [2025-03-17 03:33:29,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:33:29,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i [2025-03-17 03:33:29,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d5321ab/30a24961c2e2450fa0881f583a0b0c52/FLAGe265f10d2 [2025-03-17 03:33:30,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d5321ab/30a24961c2e2450fa0881f583a0b0c52 [2025-03-17 03:33:30,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:33:30,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:33:30,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:33:30,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:33:30,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:33:30,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@daed09e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30, skipping insertion in model container [2025-03-17 03:33:30,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:33:30,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i[915,928] [2025-03-17 03:33:30,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:33:30,256 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:33:30,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i[915,928] [2025-03-17 03:33:30,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:33:30,302 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:33:30,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30 WrapperNode [2025-03-17 03:33:30,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:33:30,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:33:30,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:33:30,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:33:30,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,343 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-17 03:33:30,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:33:30,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:33:30,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:33:30,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:33:30,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,364 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:33:30,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:33:30,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:33:30,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:33:30,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:33:30,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (1/1) ... [2025-03-17 03:33:30,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:33:30,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:33:30,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:33:30,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:33:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:33:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:33:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:33:30,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:33:30,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:33:30,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:33:30,488 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:33:30,489 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:33:30,737 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 03:33:30,737 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:33:30,749 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:33:30,749 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:33:30,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:33:30 BoogieIcfgContainer [2025-03-17 03:33:30,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:33:30,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:33:30,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:33:30,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:33:30,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:33:30" (1/3) ... [2025-03-17 03:33:30,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9c7146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:33:30, skipping insertion in model container [2025-03-17 03:33:30,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:33:30" (2/3) ... [2025-03-17 03:33:30,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9c7146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:33:30, skipping insertion in model container [2025-03-17 03:33:30,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:33:30" (3/3) ... [2025-03-17 03:33:30,760 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-85.i [2025-03-17 03:33:30,770 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:33:30,771 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-85.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:33:30,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:33:30,819 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;@57a4bfc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:33:30,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:33:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:33:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:33:30,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:30,847 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:33:30,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:30,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1931630259, now seen corresponding path program 1 times [2025-03-17 03:33:30,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:33:30,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544631418] [2025-03-17 03:33:30,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:30,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:33:30,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:33:30,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:33:30,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:33:30,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:33:31,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:33:31,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:31,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:31,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:33:31,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:33:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-17 03:33:31,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:33:31,058 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:33:31,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544631418] [2025-03-17 03:33:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544631418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:33:31,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:33:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:33:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485736925] [2025-03-17 03:33:31,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:33:31,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:33:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:33:31,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:33:31,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:33:31,081 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:33:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:33:31,096 INFO L93 Difference]: Finished difference Result 93 states and 159 transitions. [2025-03-17 03:33:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:33:31,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2025-03-17 03:33:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:33:31,103 INFO L225 Difference]: With dead ends: 93 [2025-03-17 03:33:31,104 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 03:33:31,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:33:31,110 INFO L435 NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:33:31,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:33:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 03:33:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 03:33:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:33:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2025-03-17 03:33:31,143 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 68 transitions. Word has length 98 [2025-03-17 03:33:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:33:31,144 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 68 transitions. [2025-03-17 03:33:31,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:33:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2025-03-17 03:33:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:33:31,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:33:31,147 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:33:31,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:33:31,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:33:31,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:33:31,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:33:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash -757643601, now seen corresponding path program 1 times [2025-03-17 03:33:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:33:31,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716975065] [2025-03-17 03:33:31,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:33:31,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:33:31,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:33:31,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:33:31,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:33:31,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:33:31,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:33:31,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:33:31,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:33:31,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 03:33:31,490 INFO L279 TraceCheckSpWp]: Computing forward predicates...