./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-invariants/recursified_const.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-invariants/recursified_const.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df68cc134d4c89196adaa50333a41be4199690de58eaf3e6fbecc9a5100092fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:49:27,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:49:27,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:49:27,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:49:27,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:49:27,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:49:27,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:49:27,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:49:27,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:49:27,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:49:27,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:49:27,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:49:27,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:49:27,371 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:49:27,371 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:49:27,371 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:49:27,371 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:49:27,371 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:49:27,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:49:27,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:49:27,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:49:27,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:49:27,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:49:27,373 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:49:27,373 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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(F end) ) 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 -> df68cc134d4c89196adaa50333a41be4199690de58eaf3e6fbecc9a5100092fe [2025-02-06 19:49:27,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:49:27,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:49:27,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:49:27,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:49:27,613 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:49:27,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-invariants/recursified_const.c [2025-02-06 19:49:28,766 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cb1e65cd/20af1e4f51384b6993b432456ac658d8/FLAGf81c4524c [2025-02-06 19:49:29,176 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:49:29,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_const.c [2025-02-06 19:49:29,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cb1e65cd/20af1e4f51384b6993b432456ac658d8/FLAGf81c4524c [2025-02-06 19:49:29,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cb1e65cd/20af1e4f51384b6993b432456ac658d8 [2025-02-06 19:49:29,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:49:29,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:49:29,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:49:29,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:49:29,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:49:29,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b14ec55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29, skipping insertion in model container [2025-02-06 19:49:29,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:49:29,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:49:29,416 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:49:29,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:49:29,446 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:49:29,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29 WrapperNode [2025-02-06 19:49:29,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:49:29,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:49:29,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:49:29,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:49:29,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,481 INFO L138 Inliner]: procedures = 15, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2025-02-06 19:49:29,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:49:29,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:49:29,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:49:29,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:49:29,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,503 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 8, 5]. 53 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 8, 1]. The 1 writes are split as follows [0, 0, 1]. [2025-02-06 19:49:29,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:49:29,511 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:49:29,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:49:29,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:49:29,514 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (1/1) ... [2025-02-06 19:49:29,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:49:29,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:49:29,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:49:29,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:49:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:49:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_18_0 [2025-02-06 19:49:29,559 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_18_0 [2025-02-06 19:49:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:49:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 19:49:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 19:49:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:49:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:49:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:49:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 19:49:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:49:29,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:49:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:49:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:49:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 19:49:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:49:29,620 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:49:29,621 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:49:29,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L67: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-06 19:49:29,718 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-06 19:49:29,718 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:49:29,726 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:49:29,726 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:49:29,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:49:29 BoogieIcfgContainer [2025-02-06 19:49:29,727 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:49:29,727 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:49:29,727 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:49:29,731 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:49:29,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:49:29,732 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:49:29" (1/3) ... [2025-02-06 19:49:29,732 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c73835a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:49:29, skipping insertion in model container [2025-02-06 19:49:29,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:49:29,732 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:29" (2/3) ... [2025-02-06 19:49:29,733 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c73835a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:49:29, skipping insertion in model container [2025-02-06 19:49:29,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:49:29,733 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:49:29" (3/3) ... [2025-02-06 19:49:29,733 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_const.c [2025-02-06 19:49:29,770 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:49:29,770 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:49:29,770 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:49:29,770 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:49:29,770 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:49:29,770 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:49:29,770 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:49:29,770 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:49:29,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:49:29,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-02-06 19:49:29,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:49:29,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:49:29,792 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:49:29,792 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:49:29,792 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:49:29,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:49:29,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-02-06 19:49:29,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:49:29,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:49:29,795 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:49:29,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:49:29,799 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(99, 2, 0, 1);call write~init~int#1(111, 2, 1, 1);call write~init~int#1(110, 2, 2, 1);call write~init~int#1(115, 2, 3, 1);call write~init~int#1(116, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#s~0#1.base, main_~#s~0#1.offset;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(0, main_~#s~0#1.base, main_~#s~0#1.offset, 4);" "call func_to_recursive_line_13_to_18_0(main_~#s~0#1.base, main_~#s~0#1.offset);"< [2025-02-06 19:49:29,799 INFO L754 eck$LassoCheckResult]: Loop: "~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;havoc #t~nondet4#1;" "assume 0 != #t~nondet4#1 % 4294967296;havoc #t~nondet4#1;call #t~mem5#1 := read~int#2(~s#1.base, ~s#1.offset, 4);" "assume 0 != #t~mem5#1 % 4294967296;havoc #t~mem5#1;call #t~mem6#1 := read~int#2(~s#1.base, ~s#1.offset, 4);#t~pre7#1 := 1 + #t~mem6#1;call write~int#2(1 + #t~mem6#1, ~s#1.base, ~s#1.offset, 4);havoc #t~mem6#1;havoc #t~pre7#1;" "havoc #t~nondet8#1;" "assume !(0 != #t~nondet8#1 % 4294967296);havoc #t~nondet8#1;" "call func_to_recursive_line_13_to_18_0(~s#1.base, ~s#1.offset);"< [2025-02-06 19:49:29,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:49:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash 51610, now seen corresponding path program 1 times [2025-02-06 19:49:29,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:49:29,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072153263] [2025-02-06 19:49:29,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:49:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:49:29,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:49:29,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:49:29,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:29,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:29,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:49:29,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:49:29,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:49:29,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:29,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:29,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:49:29,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:49:29,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1299700878, now seen corresponding path program 1 times [2025-02-06 19:49:29,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:49:29,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197756207] [2025-02-06 19:49:29,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:49:29,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:49:29,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:49:29,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:49:29,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:29,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:29,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:49:29,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:49:29,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:49:29,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:29,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:29,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:49:29,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:49:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1349038233, now seen corresponding path program 1 times [2025-02-06 19:49:29,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:49:29,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289060157] [2025-02-06 19:49:29,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:49:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:49:29,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:49:29,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:49:29,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:29,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:49:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:49:30,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:49:30,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289060157] [2025-02-06 19:49:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289060157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:49:30,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:49:30,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:49:30,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443539923] [2025-02-06 19:49:30,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:49:30,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:49:30,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:49:30,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:49:30,490 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:49:30,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:49:30,568 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-02-06 19:49:30,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2025-02-06 19:49:30,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-06 19:49:30,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 11 states and 12 transitions. [2025-02-06 19:49:30,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-06 19:49:30,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:49:30,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2025-02-06 19:49:30,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:49:30,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-02-06 19:49:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2025-02-06 19:49:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-06 19:49:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:49:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-02-06 19:49:30,596 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-02-06 19:49:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:49:30,600 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-02-06 19:49:30,600 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:49:30,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2025-02-06 19:49:30,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-06 19:49:30,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:49:30,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:49:30,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:49:30,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:49:30,601 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(99, 2, 0, 1);call write~init~int#1(111, 2, 1, 1);call write~init~int#1(110, 2, 2, 1);call write~init~int#1(115, 2, 3, 1);call write~init~int#1(116, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#s~0#1.base, main_~#s~0#1.offset;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(0, main_~#s~0#1.base, main_~#s~0#1.offset, 4);" "call func_to_recursive_line_13_to_18_0(main_~#s~0#1.base, main_~#s~0#1.offset);"< [2025-02-06 19:49:30,601 INFO L754 eck$LassoCheckResult]: Loop: "~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;havoc #t~nondet4#1;" "assume 0 != #t~nondet4#1 % 4294967296;havoc #t~nondet4#1;call #t~mem5#1 := read~int#2(~s#1.base, ~s#1.offset, 4);" "assume !(0 != #t~mem5#1 % 4294967296);havoc #t~mem5#1;" "havoc #t~nondet8#1;" "assume !(0 != #t~nondet8#1 % 4294967296);havoc #t~nondet8#1;" "call func_to_recursive_line_13_to_18_0(~s#1.base, ~s#1.offset);"< [2025-02-06 19:49:30,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:49:30,602 INFO L85 PathProgramCache]: Analyzing trace with hash 51610, now seen corresponding path program 2 times [2025-02-06 19:49:30,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:49:30,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891106289] [2025-02-06 19:49:30,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:49:30,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:49:30,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:49:30,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:49:30,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:49:30,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:30,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:49:30,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:49:30,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:49:30,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:30,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:30,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:49:30,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:49:30,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1299730669, now seen corresponding path program 1 times [2025-02-06 19:49:30,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:49:30,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194140997] [2025-02-06 19:49:30,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:49:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:49:30,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:49:30,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:49:30,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:30,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:30,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:49:30,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:49:30,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:49:30,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:30,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:30,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:49:30,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:49:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1349008442, now seen corresponding path program 1 times [2025-02-06 19:49:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:49:30,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899249022] [2025-02-06 19:49:30,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:49:30,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:49:30,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:49:30,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:49:30,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:30,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:30,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:49:30,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:49:30,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:49:30,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:30,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:30,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:49:31,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:49:31,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:49:31,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:31,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:31,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:49:31,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:49:31,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:49:31,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:49:31,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:49:31,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:49:31 BoogieIcfgContainer [2025-02-06 19:49:31,254 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:49:31,255 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:49:31,255 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:49:31,255 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:49:31,255 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:49:29" (3/4) ... [2025-02-06 19:49:31,256 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-06 19:49:31,274 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 19:49:31,274 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:49:31,274 INFO L158 Benchmark]: Toolchain (without parser) took 2047.76ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 77.9MB in the end (delta: 36.1MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2025-02-06 19:49:31,274 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:49:31,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.13ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 103.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:49:31,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.02ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 102.4MB in the end (delta: 862.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:49:31,275 INFO L158 Benchmark]: Boogie Preprocessor took 28.79ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:49:31,275 INFO L158 Benchmark]: IcfgBuilder took 215.80ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 89.3MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:49:31,275 INFO L158 Benchmark]: BuchiAutomizer took 1527.18ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 80.7MB in the end (delta: 8.6MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2025-02-06 19:49:31,275 INFO L158 Benchmark]: Witness Printer took 19.14ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 77.9MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:49:31,276 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.13ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.13ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 103.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.02ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 102.4MB in the end (delta: 862.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.79ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 215.80ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 89.3MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1527.18ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 80.7MB in the end (delta: 8.6MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Witness Printer took 19.14ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 77.9MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 13 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 38]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L67] unsigned int s = 0; [L67] unsigned int s = 0; [L68] CALL func_to_recursive_line_13_to_18_0(&s) Loop: [L40] COND TRUE __VERIFIER_nondet_uint() [L43] EXPR \read(*s) [L43] COND FALSE !((*s) != 0) [L50] COND FALSE !(__VERIFIER_nondet_uint()) [L58] CALL func_to_recursive_line_13_to_18_0(s) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L67] unsigned int s = 0; [L67] unsigned int s = 0; [L68] CALL func_to_recursive_line_13_to_18_0(&s) Loop: [L40] COND TRUE __VERIFIER_nondet_uint() [L43] EXPR \read(*s) [L43] COND FALSE !((*s) != 0) [L50] COND FALSE !(__VERIFIER_nondet_uint()) [L58] CALL func_to_recursive_line_13_to_18_0(s) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-06 19:49:31,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)