./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/java_AG313-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 2bfa9ea18c3859fb14daaafa2138a5573eef07b7f87afeb019dc7effa80c928b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:20:12,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:20:12,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:20:12,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:20:12,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:20:12,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:20:12,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:20:12,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:20:12,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:20:12,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:20:12,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:20:12,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:20:12,848 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:20:12,851 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:20:12,851 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:20:12,852 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:20:12,852 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:20:12,856 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:20:12,856 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:20:12,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:20:12,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:20:12,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:20:12,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:20:12,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:20:12,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:20:12,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:20:12,858 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:20:12,859 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:20:12,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:20:12,859 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:20:12,859 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:20:12,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:20:12,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:20:12,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:20:12,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:20:12,861 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:20:12,861 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 2bfa9ea18c3859fb14daaafa2138a5573eef07b7f87afeb019dc7effa80c928b [2024-11-19 14:20:13,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:20:13,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:20:13,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:20:13,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:20:13,170 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:20:13,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i [2024-11-19 14:20:14,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:20:14,871 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:20:14,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i [2024-11-19 14:20:14,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b57a884/07903ab43117408384b9a3b7c49650b3/FLAG1e605b38a [2024-11-19 14:20:15,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b57a884/07903ab43117408384b9a3b7c49650b3 [2024-11-19 14:20:15,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:20:15,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:20:15,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:20:15,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:20:15,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:20:15,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a4198c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15, skipping insertion in model container [2024-11-19 14:20:15,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:20:15,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:20:15,578 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:20:15,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:20:15,646 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:20:15,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15 WrapperNode [2024-11-19 14:20:15,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:20:15,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:20:15,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:20:15,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:20:15,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,687 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-19 14:20:15,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:20:15,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:20:15,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:20:15,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:20:15,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,718 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [3, 4, 5]. 42 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [1, 2, 2]. [2024-11-19 14:20:15,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:20:15,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:20:15,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:20:15,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:20:15,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (1/1) ... [2024-11-19 14:20:15,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:15,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:15,778 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) [2024-11-19 14:20:15,784 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 [2024-11-19 14:20:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:20:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:20:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 14:20:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:20:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:20:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 14:20:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:20:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:20:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:20:15,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:20:15,923 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:20:15,924 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:20:16,034 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-19 14:20:16,034 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:20:16,043 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:20:16,043 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:20:16,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:20:16 BoogieIcfgContainer [2024-11-19 14:20:16,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:20:16,044 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:20:16,044 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:20:16,048 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:20:16,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:20:16,049 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:20:15" (1/3) ... [2024-11-19 14:20:16,050 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a44bdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:20:16, skipping insertion in model container [2024-11-19 14:20:16,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:20:16,050 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:20:15" (2/3) ... [2024-11-19 14:20:16,050 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a44bdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:20:16, skipping insertion in model container [2024-11-19 14:20:16,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:20:16,051 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:20:16" (3/3) ... [2024-11-19 14:20:16,053 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_AG313-alloca.i [2024-11-19 14:20:16,095 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:20:16,095 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:20:16,095 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:20:16,095 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:20:16,096 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:20:16,096 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:20:16,096 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:20:16,096 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:20:16,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) [2024-11-19 14:20:16,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:16,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:16,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:16,119 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:20:16,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:16,119 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:20:16,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) [2024-11-19 14:20:16,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:16,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:16,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:16,121 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:20:16,121 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:16,128 INFO L745 eck$LassoCheckResult]: Stem: 7#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume { :begin_inline_quot } true;quot_#in~x#1, quot_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#1;havoc quot_#res#1;havoc quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset, quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset, quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset, quot_#t~mem5#1, quot_#t~mem6#1, quot_#t~mem7#1, quot_#t~short8#1, quot_#t~mem9#1, quot_#t~mem10#1, quot_#t~mem11#1, quot_#t~mem12#1, quot_~x#1, quot_~y#1, quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, quot_~i~0#1.base, quot_~i~0#1.offset;quot_~x#1 := quot_#in~x#1;quot_~y#1 := quot_#in~y#1;call quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset := quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset;call quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset := quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset;call quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);quot_~i~0#1.base, quot_~i~0#1.offset := quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset;call write~int#2(quot_~x#1, quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call write~int#0(quot_~y#1, quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int#1(0, quot_~i~0#1.base, quot_~i~0#1.offset, 4);call quot_#t~mem5#1 := read~int#2(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4); 4#L555true assume !(0 == quot_#t~mem5#1);havoc quot_#t~mem5#1; 2#L556-5true [2024-11-19 14:20:16,128 INFO L747 eck$LassoCheckResult]: Loop: 2#L556-5true call quot_#t~mem6#1 := read~int#2(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem6#1 > 0; 9#L556-1true assume !quot_#t~short8#1; 6#L556-3true assume !!quot_#t~short8#1;havoc quot_#t~mem6#1;havoc quot_#t~mem7#1;havoc quot_#t~short8#1;call quot_#t~mem9#1 := read~int#1(quot_~i~0#1.base, quot_~i~0#1.offset, 4);call write~int#1(1 + quot_#t~mem9#1, quot_~i~0#1.base, quot_~i~0#1.offset, 4);havoc quot_#t~mem9#1;call quot_#t~mem10#1 := read~int#2(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call quot_#t~mem11#1 := read~int#0(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int#2(quot_#t~mem10#1 - 1 - (quot_#t~mem11#1 - 1), quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);havoc quot_#t~mem10#1;havoc quot_#t~mem11#1; 2#L556-5true [2024-11-19 14:20:16,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-19 14:20:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094255409] [2024-11-19 14:20:16,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:16,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:16,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:16,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:16,385 INFO L85 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2024-11-19 14:20:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:16,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266770078] [2024-11-19 14:20:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:16,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:16,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266770078] [2024-11-19 14:20:16,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266770078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:20:16,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:20:16,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:20:16,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525598435] [2024-11-19 14:20:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:20:16,473 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:20:16,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:16,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:20:16,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:20:16,503 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-19 14:20:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:16,524 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2024-11-19 14:20:16,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2024-11-19 14:20:16,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:16,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2024-11-19 14:20:16,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-19 14:20:16,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:20:16,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2024-11-19 14:20:16,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:20:16,535 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 6 transitions. [2024-11-19 14:20:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2024-11-19 14:20:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-11-19 14:20:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.0) 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) [2024-11-19 14:20:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2024-11-19 14:20:16,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 6 transitions. [2024-11-19 14:20:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:20:16,561 INFO L425 stractBuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2024-11-19 14:20:16,561 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:20:16,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2024-11-19 14:20:16,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-19 14:20:16,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:16,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:16,562 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:20:16,562 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:20:16,562 INFO L745 eck$LassoCheckResult]: Stem: 36#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume { :begin_inline_quot } true;quot_#in~x#1, quot_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#1;havoc quot_#res#1;havoc quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset, quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset, quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset, quot_#t~mem5#1, quot_#t~mem6#1, quot_#t~mem7#1, quot_#t~short8#1, quot_#t~mem9#1, quot_#t~mem10#1, quot_#t~mem11#1, quot_#t~mem12#1, quot_~x#1, quot_~y#1, quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, quot_~i~0#1.base, quot_~i~0#1.offset;quot_~x#1 := quot_#in~x#1;quot_~y#1 := quot_#in~y#1;call quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset := quot_#t~malloc2#1.base, quot_#t~malloc2#1.offset;call quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset := quot_#t~malloc3#1.base, quot_#t~malloc3#1.offset;call quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);quot_~i~0#1.base, quot_~i~0#1.offset := quot_#t~malloc4#1.base, quot_#t~malloc4#1.offset;call write~int#2(quot_~x#1, quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call write~int#0(quot_~y#1, quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int#1(0, quot_~i~0#1.base, quot_~i~0#1.offset, 4);call quot_#t~mem5#1 := read~int#2(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4); 34#L555 assume !(0 == quot_#t~mem5#1);havoc quot_#t~mem5#1; 32#L556-5 [2024-11-19 14:20:16,563 INFO L747 eck$LassoCheckResult]: Loop: 32#L556-5 call quot_#t~mem6#1 := read~int#2(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem6#1 > 0; 33#L556-1 assume quot_#t~short8#1;call quot_#t~mem7#1 := read~int#0(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);quot_#t~short8#1 := quot_#t~mem7#1 > 0; 35#L556-3 assume !!quot_#t~short8#1;havoc quot_#t~mem6#1;havoc quot_#t~mem7#1;havoc quot_#t~short8#1;call quot_#t~mem9#1 := read~int#1(quot_~i~0#1.base, quot_~i~0#1.offset, 4);call write~int#1(1 + quot_#t~mem9#1, quot_~i~0#1.base, quot_~i~0#1.offset, 4);havoc quot_#t~mem9#1;call quot_#t~mem10#1 := read~int#2(quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);call quot_#t~mem11#1 := read~int#0(quot_~y_ref~0#1.base, quot_~y_ref~0#1.offset, 4);call write~int#2(quot_#t~mem10#1 - 1 - (quot_#t~mem11#1 - 1), quot_~x_ref~0#1.base, quot_~x_ref~0#1.offset, 4);havoc quot_#t~mem10#1;havoc quot_#t~mem11#1; 32#L556-5 [2024-11-19 14:20:16,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2024-11-19 14:20:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:16,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173156718] [2024-11-19 14:20:16,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:16,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:16,609 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:20:16,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:16,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:16,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:16,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2024-11-19 14:20:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:16,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484556608] [2024-11-19 14:20:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:16,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:16,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:16,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:16,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2024-11-19 14:20:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276298148] [2024-11-19 14:20:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:20:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:16,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:16,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:17,682 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:20:17,684 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:20:17,684 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:20:17,684 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:20:17,684 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:20:17,685 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:17,685 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:20:17,685 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:20:17,686 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_AG313-alloca.i_Iteration2_Lasso [2024-11-19 14:20:17,686 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:20:17,686 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:20:17,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:17,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,527 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:20:18,532 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:20:18,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,536 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) [2024-11-19 14:20:18,539 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 [2024-11-19 14:20:18,540 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 [2024-11-19 14:20:18,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:18,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:18,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:18,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:18,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:18,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:18,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:18,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:18,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:20:18,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,571 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) [2024-11-19 14:20:18,572 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 [2024-11-19 14:20:18,573 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 [2024-11-19 14:20:18,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:18,585 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-19 14:20:18,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:18,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:18,590 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-19 14:20:18,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:18,596 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:20:18,610 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-19 14:20:18,610 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-19 14:20:18,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,614 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) [2024-11-19 14:20:18,616 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 [2024-11-19 14:20:18,617 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:20:18,631 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:20:18,631 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:20:18,635 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_quot_~x_ref~0#1.base) ULTIMATE.start_quot_~x_ref~0#1.offset)_1) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_quot_~x_ref~0#1.base) ULTIMATE.start_quot_~x_ref~0#1.offset)_1 Supporting invariants [] [2024-11-19 14:20:18,651 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 [2024-11-19 14:20:18,745 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2024-11-19 14:20:18,750 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 14:20:18,751 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 14:20:18,751 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-19 14:20:18,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:18,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:20:18,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:18,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:20:18,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:18,937 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 14:20:18,938 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2024-11-19 14:20:18,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 9 states and 10 transitions. Complement of second has 6 states. [2024-11-19 14:20:18,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2024-11-19 14:20:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2024-11-19 14:20:18,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2024-11-19 14:20:18,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:18,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2024-11-19 14:20:18,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:18,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2024-11-19 14:20:18,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:18,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2024-11-19 14:20:18,991 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:20:18,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2024-11-19 14:20:18,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:20:18,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:20:18,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:20:18,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:20:18,991 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:20:18,992 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:20:18,992 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:20:18,992 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:20:18,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:20:18,992 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:20:18,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:20:18,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:20:18 BoogieIcfgContainer [2024-11-19 14:20:18,999 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:20:19,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:20:19,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:20:19,000 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:20:19,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:20:16" (3/4) ... [2024-11-19 14:20:19,003 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:20:19,004 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:20:19,004 INFO L158 Benchmark]: Toolchain (without parser) took 3816.80ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 92.0MB in the beginning and 79.9MB in the end (delta: 12.1MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2024-11-19 14:20:19,005 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 96.5MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:20:19,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.35ms. Allocated memory is still 148.9MB. Free memory was 92.0MB in the beginning and 110.6MB in the end (delta: -18.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:20:19,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.02ms. Allocated memory is still 148.9MB. Free memory was 110.6MB in the beginning and 109.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:20:19,007 INFO L158 Benchmark]: Boogie Preprocessor took 47.15ms. Allocated memory is still 148.9MB. Free memory was 108.6MB in the beginning and 107.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:20:19,008 INFO L158 Benchmark]: RCFGBuilder took 306.31ms. Allocated memory is still 148.9MB. Free memory was 106.5MB in the beginning and 93.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:20:19,008 INFO L158 Benchmark]: BuchiAutomizer took 2955.15ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 93.9MB in the beginning and 81.0MB in the end (delta: 12.9MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-11-19 14:20:19,009 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 186.6MB. Free memory was 81.0MB in the beginning and 79.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:20:19,011 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.54ms. Allocated memory is still 96.5MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.35ms. Allocated memory is still 148.9MB. Free memory was 92.0MB in the beginning and 110.6MB in the end (delta: -18.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.02ms. Allocated memory is still 148.9MB. Free memory was 110.6MB in the beginning and 109.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.15ms. Allocated memory is still 148.9MB. Free memory was 108.6MB in the beginning and 107.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 306.31ms. Allocated memory is still 148.9MB. Free memory was 106.5MB in the beginning and 93.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2955.15ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 93.9MB in the beginning and 81.0MB in the end (delta: 12.9MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 186.6MB. Free memory was 81.0MB in the beginning and 79.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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[~x_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 15 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax106 hnf100 lsp93 ukn62 mio100 lsp23 div100 bol100 ite100 ukn100 eq163 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 62ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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! [2024-11-19 14:20:19,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 14:20:19,244 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