./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash da65a08be7a694e995d17e45362055fa5f60ddf40e08c5ba36204464b294ccf0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:39:33,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:39:33,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:39:33,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:39:33,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:39:33,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:39:33,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:39:33,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:39:33,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:39:33,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:39:33,718 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:39:33,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:39:33,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:39:33,719 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:39:33,719 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:39:33,719 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:39:33,719 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:39:33,719 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:39:33,719 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:39:33,719 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:39:33,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:39:33,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:39:33,720 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:39:33,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:39:33,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:39:33,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:39:33,721 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:39:33,721 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/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da65a08be7a694e995d17e45362055fa5f60ddf40e08c5ba36204464b294ccf0 [2025-03-04 15:39:33,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:39:33,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:39:33,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:39:33,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:39:33,947 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:39:33,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i [2025-03-04 15:39:35,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ae9dda7/a47b4e7f0f7f4c108d18e73a8ca9bddc/FLAGe30d21865 [2025-03-04 15:39:35,272 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:39:35,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i [2025-03-04 15:39:35,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ae9dda7/a47b4e7f0f7f4c108d18e73a8ca9bddc/FLAGe30d21865 [2025-03-04 15:39:35,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ae9dda7/a47b4e7f0f7f4c108d18e73a8ca9bddc [2025-03-04 15:39:35,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:39:35,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:39:35,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:39:35,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:39:35,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:39:35,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e6420d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35, skipping insertion in model container [2025-03-04 15:39:35,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:39:35,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:39:35,794 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:39:35,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:39:35,842 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:39:35,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35 WrapperNode [2025-03-04 15:39:35,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:39:35,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:39:35,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:39:35,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:39:35,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,869 INFO L138 Inliner]: procedures = 111, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-03-04 15:39:35,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:39:35,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:39:35,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:39:35,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:39:35,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,890 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [4, 3, 7]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [2, 2, 3]. [2025-03-04 15:39:35,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:39:35,897 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:39:35,897 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:39:35,897 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:39:35,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (1/1) ... [2025-03-04 15:39:35,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:35,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:35,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:39:35,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:39:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:39:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:39:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:39:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:39:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:39:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:39:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:39:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:39:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:39:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:39:36,004 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:39:36,005 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:39:36,089 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: havoc f_#t~mem12#1;call ULTIMATE.dealloc(f_#t~malloc2#1.base, f_#t~malloc2#1.offset);havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call ULTIMATE.dealloc(f_#t~malloc3#1.base, f_#t~malloc3#1.offset);havoc f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call ULTIMATE.dealloc(f_#t~malloc4#1.base, f_#t~malloc4#1.offset);havoc f_#t~malloc4#1.base, f_#t~malloc4#1.offset; [2025-03-04 15:39:36,100 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 15:39:36,100 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:39:36,105 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:39:36,106 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:39:36,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:39:36 BoogieIcfgContainer [2025-03-04 15:39:36,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:39:36,107 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:39:36,107 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:39:36,110 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:39:36,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:36,111 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:39:35" (1/3) ... [2025-03-04 15:39:36,112 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@341656d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:39:36, skipping insertion in model container [2025-03-04 15:39:36,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:36,112 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:39:35" (2/3) ... [2025-03-04 15:39:36,112 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@341656d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:39:36, skipping insertion in model container [2025-03-04 15:39:36,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:39:36,112 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:39:36" (3/3) ... [2025-03-04 15:39:36,113 INFO L363 chiAutomizerObserver]: Analyzing ICFG aviad_true-alloca.i [2025-03-04 15:39:36,140 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:39:36,141 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:39:36,141 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:39:36,141 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:39:36,141 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:39:36,141 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:39:36,141 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:39:36,141 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:39:36,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-04 15:39:36,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:39:36,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:36,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:36,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:39:36,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:39:36,160 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:39:36,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-04 15:39:36,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:39:36,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:39:36,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:39:36,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:39:36,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:39:36,165 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_~x~0#1, main_~count~1#1;havoc main_#t~nondet13#1;main_~x~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_f } true;f_#in~a#1 := main_~x~0#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~mem5#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~post11#1, f_#t~mem12#1, f_~a#1, f_~a_ref~0#1.base, f_~a_ref~0#1.offset, f_~tmp~0#1.base, f_~tmp~0#1.offset, f_~count~0#1.base, f_~count~0#1.offset;f_~a#1 := f_#in~a#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~a_ref~0#1.base, f_~a_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~tmp~0#1.base, f_~tmp~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~count~0#1.base, f_~count~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call write~int#2(f_~a#1, f_~a_ref~0#1.base, f_~a_ref~0#1.offset, 4);call write~int#1(0, f_~tmp~0#1.base, f_~tmp~0#1.offset, 4);call write~int#0(0, f_~count~0#1.base, f_~count~0#1.offset, 4);" [2025-03-04 15:39:36,166 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call f_#t~mem5#1 := read~int#2(f_~a_ref~0#1.base, f_~a_ref~0#1.offset, 4);" "assume f_#t~mem5#1 > 1;havoc f_#t~mem5#1;call f_#t~mem6#1 := read~int#2(f_~a_ref~0#1.base, f_~a_ref~0#1.offset, 4);call write~int#1((if f_#t~mem6#1 < 0 && 0 != f_#t~mem6#1 % 2 then f_#t~mem6#1 % 2 - 2 else f_#t~mem6#1 % 2), f_~tmp~0#1.base, f_~tmp~0#1.offset, 4);havoc f_#t~mem6#1;call f_#t~mem7#1 := read~int#1(f_~tmp~0#1.base, f_~tmp~0#1.offset, 4);" "assume 0 == f_#t~mem7#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int#2(f_~a_ref~0#1.base, f_~a_ref~0#1.offset, 4);call write~int#2((if f_#t~mem8#1 < 0 && 0 != f_#t~mem8#1 % 2 then 1 + f_#t~mem8#1 / 2 else f_#t~mem8#1 / 2), f_~a_ref~0#1.base, f_~a_ref~0#1.offset, 4);" "call f_#t~mem10#1 := read~int#0(f_~count~0#1.base, f_~count~0#1.offset, 4);f_#t~post11#1 := f_#t~mem10#1;call write~int#0(1 + f_#t~post11#1, f_~count~0#1.base, f_~count~0#1.offset, 4);havoc f_#t~mem10#1;havoc f_#t~post11#1;" [2025-03-04 15:39:36,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:36,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 1 times [2025-03-04 15:39:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:36,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752303860] [2025-03-04 15:39:36,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:36,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:36,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:36,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:36,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:36,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:36,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:36,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:36,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:36,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:36,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:36,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1322559, now seen corresponding path program 1 times [2025-03-04 15:39:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:36,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989612026] [2025-03-04 15:39:36,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:36,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:36,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:36,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:36,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:36,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:36,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:36,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:36,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:36,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:36,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:36,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:36,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1359821950, now seen corresponding path program 1 times [2025-03-04 15:39:36,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:39:36,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858353705] [2025-03-04 15:39:36,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:39:36,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:39:36,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:36,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:36,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:36,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:36,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:39:36,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:39:36,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:39:36,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:36,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:39:36,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:39:37,022 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:39:37,023 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:39:37,023 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:39:37,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:39:37,023 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:39:37,024 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:37,024 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:39:37,024 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:39:37,024 INFO L132 ssoRankerPreferences]: Filename of dumped script: aviad_true-alloca.i_Iteration1_Lasso [2025-03-04 15:39:37,024 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:39:37,025 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:39:37,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:39:37,749 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:39:37,753 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:39:37,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:37,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:37,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:39:37,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:39:37,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:37,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:37,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:37,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:37,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:37,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:37,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:37,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:37,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:37,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:37,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:37,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:37,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:39:37,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:39:37,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:37,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:37,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:39:37,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:37,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:37,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:37,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:39:37,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:39:37,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:37,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:37,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:37,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:37,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:39:37,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:39:37,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:37,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:37,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:37,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:37,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:37,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:37,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:37,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:39:37,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:37,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:37,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:37,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:39:37,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:39:37,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:39:37,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:39:37,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:39:37,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:39:37,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:39:37,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:39:37,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:39:37,872 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:39:37,884 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 15:39:37,886 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-04 15:39:37,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:39:37,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:39:37,890 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:39:37,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:39:37,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:39:37,903 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:39:37,903 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:39:37,904 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_f_~a_ref~0#1.base) ULTIMATE.start_f_~a_ref~0#1.offset)_1) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_f_~a_ref~0#1.base) ULTIMATE.start_f_~a_ref~0#1.offset)_1 Supporting invariants [] [2025-03-04 15:39:37,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:39:37,965 INFO L156 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2025-03-04 15:39:37,968 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 15:39:37,969 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 15:39:37,969 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~a_ref~0!base,]]] [2025-03-04 15:39:37,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:39:37,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:39:37,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:39:37,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:37,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:38,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:39:38,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:38,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:39:38,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:39:38,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:39:38,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:39:38,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:39:38,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:39:38,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-04 15:39:38,088 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-04 15:39:38,108 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-04 15:39:38,109 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-04 15:39:38,157 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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). Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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) Result 23 states and 27 transitions. Complement of second has 10 states. [2025-03-04 15:39:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:39:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-04 15:39:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2025-03-04 15:39:38,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-04 15:39:38,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:38,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-04 15:39:38,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:38,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 2 letters. Loop has 8 letters. [2025-03-04 15:39:38,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:39:38,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2025-03-04 15:39:38,171 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:39:38,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2025-03-04 15:39:38,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:39:38,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:39:38,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:39:38,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:39:38,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:38,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:38,174 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:39:38,174 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:39:38,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:39:38,174 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:39:38,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:39:38,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:39:38 BoogieIcfgContainer [2025-03-04 15:39:38,181 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:39:38,181 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:39:38,182 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:39:38,182 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:39:38,182 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:39:36" (3/4) ... [2025-03-04 15:39:38,183 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:39:38,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:39:38,185 INFO L158 Benchmark]: Toolchain (without parser) took 2578.84ms. Allocated memory is still 201.3MB. Free memory was 153.8MB in the beginning and 126.6MB in the end (delta: 27.2MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2025-03-04 15:39:38,185 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:38,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.82ms. Allocated memory is still 201.3MB. Free memory was 153.8MB in the beginning and 137.7MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:39:38,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.66ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 136.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:38,185 INFO L158 Benchmark]: Boogie Preprocessor took 25.30ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 135.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:38,186 INFO L158 Benchmark]: IcfgBuilder took 209.49ms. Allocated memory is still 201.3MB. Free memory was 135.0MB in the beginning and 121.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:39:38,186 INFO L158 Benchmark]: BuchiAutomizer took 2074.40ms. Allocated memory is still 201.3MB. Free memory was 121.3MB in the beginning and 127.9MB in the end (delta: -6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:38,186 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 201.3MB. Free memory was 126.7MB in the beginning and 126.6MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:39:38,187 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.21ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.82ms. Allocated memory is still 201.3MB. Free memory was 153.8MB in the beginning and 137.7MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.66ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 136.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.30ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 135.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 209.49ms. Allocated memory is still 201.3MB. Free memory was 135.0MB in the beginning and 121.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2074.40ms. Allocated memory is still 201.3MB. Free memory was 121.3MB in the beginning and 127.9MB in the end (delta: -6.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 201.3MB. Free memory was 126.7MB in the beginning and 126.6MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~a_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 5 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital252 mio100 ax107 hnf100 lsp93 ukn69 mio100 lsp21 div268 bol100 ite100 ukn100 eq143 hnf93 smp40 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:39:38,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:39:38,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Result: TRUE