./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-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 b72fdbcf4106a2c9e0e7bb38e5b48a5a42fbfd030e4e4dc43ee6290ba06c6869 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:14:51,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:14:51,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:14:51,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:14:51,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:14:51,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:14:51,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:14:51,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:14:51,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:14:51,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:14:51,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:14:51,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:14:51,743 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:14:51,743 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:14:51,744 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:14:51,744 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:14:51,747 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:14:51,747 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:14:51,747 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:14:51,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:14:51,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:14:51,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:14:51,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:14:51,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:14:51,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:14:51,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:14:51,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:14:51,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:14:51,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:14:51,755 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:14:51,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:14:51,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:14:51,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:14:51,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:14:51,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:14:51,756 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:14:51,756 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 -> b72fdbcf4106a2c9e0e7bb38e5b48a5a42fbfd030e4e4dc43ee6290ba06c6869 [2024-10-15 00:14:52,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:14:52,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:14:52,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:14:52,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:14:52,106 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:14:52,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca.i [2024-10-15 00:14:53,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:14:53,860 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:14:53,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.03-no-inv_assume-alloca.i [2024-10-15 00:14:53,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75c0c105/c1210a15b1dc4dae929f9d414f5c1c7d/FLAGc37231ecd [2024-10-15 00:14:53,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75c0c105/c1210a15b1dc4dae929f9d414f5c1c7d [2024-10-15 00:14:53,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:14:53,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:14:53,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:14:53,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:14:53,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:14:53,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:14:53" (1/1) ... [2024-10-15 00:14:53,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ece538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:53, skipping insertion in model container [2024-10-15 00:14:53,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:14:53" (1/1) ... [2024-10-15 00:14:53,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:14:54,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:14:54,229 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:14:54,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:14:54,320 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:14:54,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54 WrapperNode [2024-10-15 00:14:54,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:14:54,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:14:54,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:14:54,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:14:54,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,362 INFO L138 Inliner]: procedures = 111, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2024-10-15 00:14:54,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:14:54,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:14:54,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:14:54,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:14:54,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,391 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [5, 7]. 58 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2]. [2024-10-15 00:14:54,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:14:54,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:14:54,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:14:54,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:14:54,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (1/1) ... [2024-10-15 00:14:54,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:54,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:54,440 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-10-15 00:14:54,442 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-10-15 00:14:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:14:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 00:14:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:14:54,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 00:14:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:14:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:14:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:14:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:14:54,595 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:14:54,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:14:54,792 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-15 00:14:54,792 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:14:54,806 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:14:54,806 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 00:14:54,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:14:54 BoogieIcfgContainer [2024-10-15 00:14:54,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:14:54,808 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:14:54,808 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:14:54,812 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:14:54,814 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:14:54,814 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:14:53" (1/3) ... [2024-10-15 00:14:54,815 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77aea8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:14:54, skipping insertion in model container [2024-10-15 00:14:54,815 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:14:54,816 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:14:54" (2/3) ... [2024-10-15 00:14:54,816 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77aea8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:14:54, skipping insertion in model container [2024-10-15 00:14:54,816 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:14:54,816 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:14:54" (3/3) ... [2024-10-15 00:14:54,818 INFO L332 chiAutomizerObserver]: Analyzing ICFG b.03-no-inv_assume-alloca.i [2024-10-15 00:14:54,879 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:14:54,880 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:14:54,880 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:14:54,880 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:14:54,880 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:14:54,881 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:14:54,881 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:14:54,881 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:14:54,886 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-10-15 00:14:54,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:14:54,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:54,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:54,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:14:54,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:14:54,917 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:14:54,917 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-10-15 00:14:54,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:14:54,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:54,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:54,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:14:54,920 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:14:54,927 INFO L745 eck$LassoCheckResult]: Stem: 7#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem9#1, test_fun_#t~mem8#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 4#L553true assume !(test_fun_#t~mem4#1 <= 0);havoc test_fun_#t~mem4#1; 2#L556-5true [2024-10-15 00:14:54,927 INFO L747 eck$LassoCheckResult]: Loop: 2#L556-5true call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 8#L556-1true assume !test_fun_#t~short10#1; 6#L556-3true assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short10#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem11#1 + test_fun_#t~mem12#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1; 2#L556-5true [2024-10-15 00:14:54,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:54,937 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-10-15 00:14:54,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:54,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785076147] [2024-10-15 00:14:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:54,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:55,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:55,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:55,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2024-10-15 00:14:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:55,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217096073] [2024-10-15 00:14:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:14:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217096073] [2024-10-15 00:14:55,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217096073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:14:55,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:14:55,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:14:55,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134562735] [2024-10-15 00:14:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:14:55,256 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:14:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:14:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:14:55,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:14:55,295 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-10-15 00:14:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:14:55,325 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2024-10-15 00:14:55,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2024-10-15 00:14:55,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:14:55,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2024-10-15 00:14:55,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-15 00:14:55,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-15 00:14:55,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2024-10-15 00:14:55,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:14:55,335 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 6 transitions. [2024-10-15 00:14:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2024-10-15 00:14:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-10-15 00:14:55,359 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-10-15 00:14:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2024-10-15 00:14:55,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 6 transitions. [2024-10-15 00:14:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:14:55,367 INFO L425 stractBuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2024-10-15 00:14:55,367 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:14:55,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2024-10-15 00:14:55,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:14:55,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:14:55,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:14:55,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:14:55,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:14:55,370 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~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem9#1, test_fun_#t~mem8#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 34#L553 assume !(test_fun_#t~mem4#1 <= 0);havoc test_fun_#t~mem4#1; 32#L556-5 [2024-10-15 00:14:55,370 INFO L747 eck$LassoCheckResult]: Loop: 32#L556-5 call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1; 33#L556-1 assume test_fun_#t~short10#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem9#1 <= 2147483647 - test_fun_#t~mem8#1; 35#L556-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short10#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem11#1 + test_fun_#t~mem12#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1; 32#L556-5 [2024-10-15 00:14:55,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2024-10-15 00:14:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:55,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214200329] [2024-10-15 00:14:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:55,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:55,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:55,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:55,440 INFO L85 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2024-10-15 00:14:55,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:55,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590896080] [2024-10-15 00:14:55,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:55,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:55,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:55,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2024-10-15 00:14:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:14:55,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955059316] [2024-10-15 00:14:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:14:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:14:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:55,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:14:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:14:55,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:14:56,197 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:14:56,199 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:14:56,200 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:14:56,200 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:14:56,200 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:14:56,200 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:56,200 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:14:56,201 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:14:56,201 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.03-no-inv_assume-alloca.i_Iteration2_Lasso [2024-10-15 00:14:56,201 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:14:56,201 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:14:56,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:14:56,917 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:14:56,921 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:14:56,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:56,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:56,924 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-10-15 00:14:56,925 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-10-15 00:14:56,926 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-10-15 00:14:56,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:56,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:56,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:56,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:56,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:56,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:56,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:56,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:56,960 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-10-15 00:14:56,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:56,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:56,962 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-10-15 00:14:56,963 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-10-15 00:14:56,963 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-10-15 00:14:56,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:56,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:14:56,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:56,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:56,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:56,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:14:56,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:14:56,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:56,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:14:56,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:56,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:56,990 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-10-15 00:14:56,990 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-10-15 00:14:56,991 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-10-15 00:14:57,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:57,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:57,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:57,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:57,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:57,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:57,017 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:57,033 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-10-15 00:14:57,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:57,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:57,036 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) [2024-10-15 00:14:57,037 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 [2024-10-15 00:14:57,039 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-10-15 00:14:57,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:57,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:57,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:57,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:57,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:57,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:57,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:57,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:57,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:57,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:57,086 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) [2024-10-15 00:14:57,088 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 [2024-10-15 00:14:57,089 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-10-15 00:14:57,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:57,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:57,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:57,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:57,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:57,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:57,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:57,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 00:14:57,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:57,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:57,139 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-15 00:14:57,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:14:57,143 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-10-15 00:14:57,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:57,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:57,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:57,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:57,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:57,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:57,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:57,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:57,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:57,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:57,184 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10-15 00:14:57,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:14:57,187 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-10-15 00:14:57,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:57,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:57,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:57,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:57,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:57,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:57,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:57,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:57,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:57,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:57,228 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10-15 00:14:57,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 00:14:57,252 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-10-15 00:14:57,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:57,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:57,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:57,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:57,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:57,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:57,274 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:14:57,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 00:14:57,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:57,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:57,292 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-15 00:14:57,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:14:57,294 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-10-15 00:14:57,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:14:57,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:14:57,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:14:57,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:14:57,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:14:57,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:14:57,323 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:14:57,364 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-15 00:14:57,364 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-15 00:14:57,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:14:57,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:14:57,370 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10-15 00:14:57,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:14:57,373 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:14:57,388 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:14:57,389 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:14:57,389 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1, v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1) = -1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 - 1 >= 0] [2024-10-15 00:14:57,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-15 00:14:57,451 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2024-10-15 00:14:57,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-15 00:14:57,463 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-15 00:14:57,463 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-10-15 00:14:57,464 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 00:14:57,464 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 00:14:57,465 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-10-15 00:14:57,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:14:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:57,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:14:57,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:14:57,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 00:14:57,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:14:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:14:57,709 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-15 00:14:57,711 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 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) [2024-10-15 00:14:57,798 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. 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 9 states and 10 transitions. Complement of second has 7 states. [2024-10-15 00:14:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:14:57,801 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) [2024-10-15 00:14:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2024-10-15 00:14:57,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2024-10-15 00:14:57,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:57,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2024-10-15 00:14:57,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:57,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2024-10-15 00:14:57,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:14:57,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2024-10-15 00:14:57,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:14:57,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2024-10-15 00:14:57,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:14:57,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:14:57,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:14:57,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:14:57,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:14:57,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:14:57,808 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:14:57,808 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:14:57,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:14:57,809 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:14:57,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:14:57,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:14:57 BoogieIcfgContainer [2024-10-15 00:14:57,818 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:14:57,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:14:57,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:14:57,819 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:14:57,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:14:54" (3/4) ... [2024-10-15 00:14:57,821 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:14:57,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:14:57,823 INFO L158 Benchmark]: Toolchain (without parser) took 3934.36ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 121.8MB in the beginning and 110.8MB in the end (delta: 11.0MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2024-10-15 00:14:57,824 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 155.2MB. Free memory was 125.1MB in the beginning and 125.0MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:14:57,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.13ms. Allocated memory is still 155.2MB. Free memory was 121.8MB in the beginning and 104.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-15 00:14:57,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.98ms. Allocated memory is still 155.2MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:14:57,825 INFO L158 Benchmark]: Boogie Preprocessor took 40.60ms. Allocated memory is still 155.2MB. Free memory was 102.4MB in the beginning and 100.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:14:57,825 INFO L158 Benchmark]: RCFGBuilder took 402.05ms. Allocated memory is still 155.2MB. Free memory was 100.9MB in the beginning and 118.8MB in the end (delta: -17.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:14:57,826 INFO L158 Benchmark]: BuchiAutomizer took 3009.61ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 118.8MB in the beginning and 110.8MB in the end (delta: 8.0MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2024-10-15 00:14:57,828 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 188.7MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:14:57,830 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.64ms. Allocated memory is still 155.2MB. Free memory was 125.1MB in the beginning and 125.0MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.13ms. Allocated memory is still 155.2MB. Free memory was 121.8MB in the beginning and 104.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.98ms. Allocated memory is still 155.2MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.60ms. Allocated memory is still 155.2MB. Free memory was 102.4MB in the beginning and 100.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 402.05ms. Allocated memory is still 155.2MB. Free memory was 100.9MB in the beginning and 118.8MB in the end (delta: -17.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3009.61ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 118.8MB in the beginning and 110.8MB in the end (delta: 8.0MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 188.7MB. Free memory is still 110.8MB. 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#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_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 5 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.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 14 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital177 mio100 ax110 hnf100 lsp90 ukn73 mio100 lsp26 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 5 VariablesLoop: 4 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! [2024-10-15 00:14:57,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:14:58,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE