./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_53_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_53_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8c16e63d4bd71bd90daf137b7db0d62f9db1f0b09e5beed24f4a0b94c559f662 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:24:18,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:24:18,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:24:18,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:24:18,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:24:18,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:24:18,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:24:18,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:24:18,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:24:18,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:24:18,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:24:18,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:24:18,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:24:18,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:24:18,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:24:18,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:24:18,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:24:18,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:24:18,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:24:18,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:24:18,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:24:18,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:24:18,477 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:24:18,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:24:18,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:24:18,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:24:18,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:24:18,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:24:18,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:24:18,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:24:18,477 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c16e63d4bd71bd90daf137b7db0d62f9db1f0b09e5beed24f4a0b94c559f662 [2025-03-09 05:24:18,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:24:18,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:24:18,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:24:18,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:24:18,689 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:24:18,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_53_good.i [2025-03-09 05:24:19,761 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f1fe1d23/d0d8506e4e6e4d6e8b3dd3c740ff9636/FLAGd04fe73d5 [2025-03-09 05:24:20,146 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:24:20,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_53_good.i [2025-03-09 05:24:20,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f1fe1d23/d0d8506e4e6e4d6e8b3dd3c740ff9636/FLAGd04fe73d5 [2025-03-09 05:24:20,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f1fe1d23/d0d8506e4e6e4d6e8b3dd3c740ff9636 [2025-03-09 05:24:20,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:24:20,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:24:20,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:24:20,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:24:20,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:24:20,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:24:20" (1/1) ... [2025-03-09 05:24:20,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728b5183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:20, skipping insertion in model container [2025-03-09 05:24:20,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:24:20" (1/1) ... [2025-03-09 05:24:20,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:24:20,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:24:20,916 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:24:20,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:24:21,050 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:24:21,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21 WrapperNode [2025-03-09 05:24:21,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:24:21,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:24:21,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:24:21,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:24:21,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,082 INFO L138 Inliner]: procedures = 505, calls = 34, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 60 [2025-03-09 05:24:21,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:24:21,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:24:21,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:24:21,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:24:21,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,097 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 05:24:21,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:24:21,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:24:21,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:24:21,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:24:21,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (1/1) ... [2025-03-09 05:24:21,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:24:21,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:24:21,131 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-09 05:24:21,136 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-09 05:24:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 05:24:21,150 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 05:24:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 05:24:21,150 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 05:24:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:24:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:24:21,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:24:21,247 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:24:21,249 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:24:21,349 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-09 05:24:21,349 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:24:21,356 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:24:21,356 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:24:21,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:24:21 BoogieIcfgContainer [2025-03-09 05:24:21,356 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:24:21,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:24:21,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:24:21,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:24:21,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:24:20" (1/3) ... [2025-03-09 05:24:21,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1738b7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:24:21, skipping insertion in model container [2025-03-09 05:24:21,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:24:21" (2/3) ... [2025-03-09 05:24:21,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1738b7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:24:21, skipping insertion in model container [2025-03-09 05:24:21,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:24:21" (3/3) ... [2025-03-09 05:24:21,364 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_sub_53_good.i [2025-03-09 05:24:21,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:24:21,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_sub_53_good.i that has 3 procedures, 39 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 05:24:21,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:24:21,414 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;@629b9fb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:24:21,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 05:24:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 32 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 05:24:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 05:24:21,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:24:21,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:24:21,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 05:24:21,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:24:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1215794343, now seen corresponding path program 1 times [2025-03-09 05:24:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:24:21,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206844367] [2025-03-09 05:24:21,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:24:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:24:21,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 05:24:21,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 05:24:21,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:24:21,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:24:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:24:21,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:24:21,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206844367] [2025-03-09 05:24:21,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206844367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:24:21,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:24:21,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:24:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681112398] [2025-03-09 05:24:21,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:24:21,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:24:21,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:24:21,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:24:21,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:24:21,672 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 32 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:24:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:24:21,691 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-03-09 05:24:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:24:21,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2025-03-09 05:24:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:24:21,699 INFO L225 Difference]: With dead ends: 39 [2025-03-09 05:24:21,699 INFO L226 Difference]: Without dead ends: 25 [2025-03-09 05:24:21,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 05:24:21,703 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:24:21,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:24:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-09 05:24:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-09 05:24:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:24:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2025-03-09 05:24:21,739 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 9 [2025-03-09 05:24:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:24:21,739 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2025-03-09 05:24:21,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:24:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2025-03-09 05:24:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 05:24:21,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:24:21,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:24:21,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:24:21,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 05:24:21,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:24:21,741 INFO L85 PathProgramCache]: Analyzing trace with hash 965081031, now seen corresponding path program 1 times [2025-03-09 05:24:21,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:24:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494386807] [2025-03-09 05:24:21,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:24:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:24:21,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 05:24:21,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 05:24:21,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:24:21,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:24:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:24:21,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:24:21,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494386807] [2025-03-09 05:24:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494386807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:24:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:24:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:24:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035616133] [2025-03-09 05:24:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:24:21,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:24:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:24:21,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:24:21,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:24:21,825 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:24:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:24:21,836 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2025-03-09 05:24:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:24:21,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-09 05:24:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:24:21,837 INFO L225 Difference]: With dead ends: 25 [2025-03-09 05:24:21,837 INFO L226 Difference]: Without dead ends: 24 [2025-03-09 05:24:21,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 05:24:21,838 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:24:21,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:24:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-09 05:24:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-09 05:24:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:24:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-03-09 05:24:21,842 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 10 [2025-03-09 05:24:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:24:21,843 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-03-09 05:24:21,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:24:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-03-09 05:24:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 05:24:21,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:24:21,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:24:21,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 05:24:21,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 05:24:21,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:24:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -248484590, now seen corresponding path program 1 times [2025-03-09 05:24:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:24:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037394693] [2025-03-09 05:24:21,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:24:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:24:21,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 05:24:21,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 05:24:21,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:24:21,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:24:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:24:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:24:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037394693] [2025-03-09 05:24:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037394693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:24:21,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:24:21,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:24:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633199693] [2025-03-09 05:24:21,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:24:21,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:24:21,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:24:21,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:24:21,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:24:21,901 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:24:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:24:21,907 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2025-03-09 05:24:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:24:21,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-09 05:24:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:24:21,908 INFO L225 Difference]: With dead ends: 24 [2025-03-09 05:24:21,908 INFO L226 Difference]: Without dead ends: 23 [2025-03-09 05:24:21,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 05:24:21,909 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:24:21,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:24:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-09 05:24:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-09 05:24:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:24:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2025-03-09 05:24:21,912 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2025-03-09 05:24:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:24:21,912 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2025-03-09 05:24:21,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:24:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2025-03-09 05:24:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:24:21,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:24:21,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:24:21,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:24:21,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 05:24:21,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:24:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash 886912289, now seen corresponding path program 1 times [2025-03-09 05:24:21,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:24:21,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187967521] [2025-03-09 05:24:21,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:24:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:24:21,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:24:21,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:24:21,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:24:21,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:24:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:24:21,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:24:21,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187967521] [2025-03-09 05:24:21,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187967521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:24:21,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:24:21,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:24:21,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303941482] [2025-03-09 05:24:21,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:24:21,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:24:21,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:24:21,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:24:21,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:24:21,970 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:24:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:24:21,975 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2025-03-09 05:24:21,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:24:21,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-09 05:24:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:24:21,976 INFO L225 Difference]: With dead ends: 23 [2025-03-09 05:24:21,976 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 05:24:21,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 05:24:21,977 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 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-09 05:24:21,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:24:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 05:24:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 05:24:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:24:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 05:24:21,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2025-03-09 05:24:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:24:21,977 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 05:24:21,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:24:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 05:24:21,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 05:24:21,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-09 05:24:21,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-09 05:24:21,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-09 05:24:21,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-09 05:24:21,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 05:24:21,984 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 05:24:21,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 05:24:21,997 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:24:22,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:24:22 BoogieIcfgContainer [2025-03-09 05:24:22,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:24:22,003 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:24:22,003 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:24:22,003 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:24:22,004 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:24:21" (3/4) ... [2025-03-09 05:24:22,005 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 05:24:22,008 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 05:24:22,008 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 05:24:22,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-09 05:24:22,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 05:24:22,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 05:24:22,063 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 05:24:22,064 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 05:24:22,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:24:22,064 INFO L158 Benchmark]: Toolchain (without parser) took 1721.78ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 113.9MB in the end (delta: 40.8MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2025-03-09 05:24:22,064 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:24:22,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 708.22ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 93.5MB in the end (delta: 60.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 05:24:22,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.40ms. Allocated memory is still 201.3MB. Free memory was 93.5MB in the beginning and 90.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:24:22,065 INFO L158 Benchmark]: Boogie Preprocessor took 20.51ms. Allocated memory is still 201.3MB. Free memory was 90.8MB in the beginning and 89.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:24:22,065 INFO L158 Benchmark]: IcfgBuilder took 252.21ms. Allocated memory is still 201.3MB. Free memory was 89.4MB in the beginning and 76.1MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 05:24:22,065 INFO L158 Benchmark]: TraceAbstraction took 642.97ms. Allocated memory is still 201.3MB. Free memory was 75.7MB in the beginning and 119.5MB in the end (delta: -43.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:24:22,065 INFO L158 Benchmark]: Witness Printer took 60.90ms. Allocated memory is still 201.3MB. Free memory was 119.5MB in the beginning and 113.9MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:24:22,067 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 708.22ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 93.5MB in the end (delta: 60.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.40ms. Allocated memory is still 201.3MB. Free memory was 93.5MB in the beginning and 90.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.51ms. Allocated memory is still 201.3MB. Free memory was 90.8MB in the beginning and 89.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 252.21ms. Allocated memory is still 201.3MB. Free memory was 89.4MB in the beginning and 76.1MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 642.97ms. Allocated memory is still 201.3MB. Free memory was 75.7MB in the beginning and 119.5MB in the end (delta: -43.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.90ms. Allocated memory is still 201.3MB. Free memory was 119.5MB in the beginning and 113.9MB in the end (delta: 5.5MB). 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 - PositiveResult [Line: 1608]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1608]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1600]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1600]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 48 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 102 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 80 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 05:24:22,081 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 Writing output log to file Ultimate.log Result: TRUE