./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/ldv-memsafety/memleaks_test18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:42:02,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:42:02,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:42:02,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:42:02,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:42:02,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:42:02,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:42:02,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:42:02,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:42:02,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:42:02,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:42:02,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:42:02,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:42:02,925 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:42:02,925 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:42:02,926 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:42:02,926 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:42:02,926 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:42:02,926 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:42:02,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:42:02,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:42:02,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:42:02,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:42:02,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:42:02,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:42:02,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:42:02,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:42:02,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:42:02,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:42:02,932 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:42:02,932 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:42:02,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:42:02,933 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:42:02,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:42:02,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:42:02,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:42:02,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:42:02,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:42:02,934 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:42:02,935 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 [2024-11-19 14:42:03,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:42:03,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:42:03,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:42:03,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:42:03,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:42:03,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2024-11-19 14:42:04,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:42:04,856 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:42:04,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2024-11-19 14:42:04,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e9ba6fcc/eb47edc0aad34578b7af315561fd478c/FLAG13bc9a54b [2024-11-19 14:42:04,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e9ba6fcc/eb47edc0aad34578b7af315561fd478c [2024-11-19 14:42:04,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:42:04,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:42:04,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:42:04,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:42:04,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:42:04,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:42:04" (1/1) ... [2024-11-19 14:42:04,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253c410b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:04, skipping insertion in model container [2024-11-19 14:42:04,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:42:04" (1/1) ... [2024-11-19 14:42:04,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:42:05,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:42:05,408 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:42:05,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:42:05,595 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:42:05,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05 WrapperNode [2024-11-19 14:42:05,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:42:05,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:42:05,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:42:05,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:42:05,604 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:42:05" (1/1) ... [2024-11-19 14:42:05,632 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:42:05" (1/1) ... [2024-11-19 14:42:05,657 INFO L138 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 28, calls inlined = 5, statements flattened = 69 [2024-11-19 14:42:05,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:42:05,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:42:05,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:42:05,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:42:05,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (1/1) ... [2024-11-19 14:42:05,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (1/1) ... [2024-11-19 14:42:05,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (1/1) ... [2024-11-19 14:42:05,690 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-19 14:42:05,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (1/1) ... [2024-11-19 14:42:05,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (1/1) ... [2024-11-19 14:42:05,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (1/1) ... [2024-11-19 14:42:05,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (1/1) ... [2024-11-19 14:42:05,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (1/1) ... [2024-11-19 14:42:05,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (1/1) ... [2024-11-19 14:42:05,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:42:05,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:42:05,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:42:05,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:42:05,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (1/1) ... [2024-11-19 14:42:05,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:05,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:05,744 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:42:05,746 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:42:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 14:42:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:42:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 14:42:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 14:42:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 14:42:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 14:42:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:42:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 14:42:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 14:42:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:42:05,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:42:05,888 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:42:05,890 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:42:06,023 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-19 14:42:06,024 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:42:06,034 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:42:06,034 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:42:06,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:42:06 BoogieIcfgContainer [2024-11-19 14:42:06,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:42:06,036 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:42:06,036 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:42:06,041 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:42:06,042 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:42:06,043 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:42:04" (1/3) ... [2024-11-19 14:42:06,044 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b331425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:42:06, skipping insertion in model container [2024-11-19 14:42:06,044 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:42:06,044 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:42:05" (2/3) ... [2024-11-19 14:42:06,046 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b331425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:42:06, skipping insertion in model container [2024-11-19 14:42:06,046 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:42:06,046 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:42:06" (3/3) ... [2024-11-19 14:42:06,047 INFO L332 chiAutomizerObserver]: Analyzing ICFG memleaks_test18.i [2024-11-19 14:42:06,096 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:42:06,096 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:42:06,096 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:42:06,096 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:42:06,096 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:42:06,097 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:42:06,097 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:42:06,097 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:42:06,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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:42:06,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-19 14:42:06,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:42:06,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:42:06,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:42:06,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:42:06,127 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:42:06,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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:42:06,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-19 14:42:06,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:42:06,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:42:06,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:42:06,129 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:42:06,133 INFO L745 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 14#L526true assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 7#ldv_malloc_returnLabel#1true entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; 4#L763true assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 11#L767-3true [2024-11-19 14:42:06,134 INFO L747 eck$LassoCheckResult]: Loop: 11#L767-3true assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 16#L526-1true assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 10#ldv_malloc_returnLabel#2true entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; 15#L769true assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$#1(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 13#L767-2true entry_point_#t~post44#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post44#1;havoc entry_point_#t~post44#1; 11#L767-3true [2024-11-19 14:42:06,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:06,138 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2024-11-19 14:42:06,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:06,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851530598] [2024-11-19 14:42:06,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:06,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:42:06,392 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:42:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:42:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851530598] [2024-11-19 14:42:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851530598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:42:06,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:42:06,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:42:06,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302865158] [2024-11-19 14:42:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:42:06,400 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:42:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 1 times [2024-11-19 14:42:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:06,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105681639] [2024-11-19 14:42:06,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:06,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:06,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:06,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:42:06,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:42:06,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:42:06,863 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:42:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:42:06,900 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-19 14:42:06,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2024-11-19 14:42:06,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-19 14:42:06,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 14 states and 17 transitions. [2024-11-19 14:42:06,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-19 14:42:06,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-19 14:42:06,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2024-11-19 14:42:06,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:42:06,910 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-11-19 14:42:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2024-11-19 14:42:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-19 14:42:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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:42:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-11-19 14:42:06,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-19 14:42:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:42:06,940 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-19 14:42:06,941 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:42:06,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-11-19 14:42:06,943 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-19 14:42:06,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:42:06,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:42:06,944 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:42:06,944 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:42:06,944 INFO L745 eck$LassoCheckResult]: Stem: 61#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 55#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 56#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 54#ldv_malloc_returnLabel#1 entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; 51#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 52#L767-3 [2024-11-19 14:42:06,945 INFO L747 eck$LassoCheckResult]: Loop: 52#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 59#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 57#ldv_malloc_returnLabel#2 entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; 58#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$#1(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 60#L767-2 entry_point_#t~post44#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post44#1;havoc entry_point_#t~post44#1; 52#L767-3 [2024-11-19 14:42:06,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:06,947 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2024-11-19 14:42:06,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:06,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944163715] [2024-11-19 14:42:06,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:06,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:06,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:06,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 2 times [2024-11-19 14:42:06,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:06,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958389161] [2024-11-19 14:42:06,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:42:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:07,029 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:42:07,033 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:42:07,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:07,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:07,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1232444971, now seen corresponding path program 1 times [2024-11-19 14:42:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:07,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048501096] [2024-11-19 14:42:07,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:07,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:07,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:07,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:07,661 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:42:07,662 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:42:07,662 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:42:07,662 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:42:07,662 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:42:07,662 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:07,662 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:42:07,662 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:42:07,663 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration2_Lasso [2024-11-19 14:42:07,663 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:42:07,663 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:42:07,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:07,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:08,232 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:42:08,237 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:42:08,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,240 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:42:08,243 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:42:08,245 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:42:08,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,290 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:42:08,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,293 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:42:08,294 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:42:08,295 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:42:08,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:08,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:08,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,333 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-11-19 14:42:08,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,335 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:42:08,336 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:42:08,337 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:42:08,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:08,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:08,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,376 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:42:08,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,379 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-11-19 14:42:08,380 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-11-19 14:42:08,382 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:42:08,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:42:08,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,419 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-11-19 14:42:08,421 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-11-19 14:42:08,423 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:42:08,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,452 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-11-19 14:42:08,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,455 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-11-19 14:42:08,456 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-11-19 14:42:08,457 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:42:08,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,487 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-11-19 14:42:08,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,490 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-11-19 14:42:08,491 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-11-19 14:42:08,492 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:42:08,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:42:08,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,527 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-11-19 14:42:08,533 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:42:08,537 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-11-19 14:42:08,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,554 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,568 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-11-19 14:42:08,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,571 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-11-19 14:42:08,574 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-11-19 14:42:08,574 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:42:08,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:08,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:08,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,615 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-11-19 14:42:08,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,618 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-11-19 14:42:08,619 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-11-19 14:42:08,621 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:42:08,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:08,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:08,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 14:42:08,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,660 INFO L229 MonitoredProcess]: Starting monitored process 12 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:42:08,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:42:08,662 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:42:08,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:42:08,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,694 INFO L229 MonitoredProcess]: Starting monitored process 13 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:42:08,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:42:08,697 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:42:08,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:08,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:08,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:08,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,724 INFO L229 MonitoredProcess]: Starting monitored process 14 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:42:08,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:42:08,726 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:42:08,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:08,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:08,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:08,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,760 INFO L229 MonitoredProcess]: Starting monitored process 15 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:42:08,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:42:08,763 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:42:08,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:42:08,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,797 INFO L229 MonitoredProcess]: Starting monitored process 16 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:42:08,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:42:08,800 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:42:08,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-19 14:42:08,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,848 INFO L229 MonitoredProcess]: Starting monitored process 17 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:42:08,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:42:08,850 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:42:08,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:42:08,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,880 INFO L229 MonitoredProcess]: Starting monitored process 18 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:42:08,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:42:08,883 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:42:08,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:42:08,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,920 INFO L229 MonitoredProcess]: Starting monitored process 19 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:42:08,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:42:08,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-11-19 14:42:08,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-19 14:42:08,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,960 INFO L229 MonitoredProcess]: Starting monitored process 20 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:42:08,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:42:08,962 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:42:08,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:08,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:08,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:08,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:08,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:08,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:08,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:08,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:08,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-19 14:42:08,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:08,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:08,995 INFO L229 MonitoredProcess]: Starting monitored process 21 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:42:08,998 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:42:08,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:42:09,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:09,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:09,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:09,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:09,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-19 14:42:09,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,031 INFO L229 MonitoredProcess]: Starting monitored process 22 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:42:09,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:42:09,033 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:42:09,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:09,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:09,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:09,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-19 14:42:09,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,072 INFO L229 MonitoredProcess]: Starting monitored process 23 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:42:09,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:42:09,074 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:42:09,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:09,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:09,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:09,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:09,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:09,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,105 INFO L229 MonitoredProcess]: Starting monitored process 24 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:42:09,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:42:09,106 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:42:09,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:09,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:09,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:09,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:09,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-19 14:42:09,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,134 INFO L229 MonitoredProcess]: Starting monitored process 25 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:42:09,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:42:09,136 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:42:09,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:09,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:09,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:09,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:09,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:09,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,161 INFO L229 MonitoredProcess]: Starting monitored process 26 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:42:09,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:42:09,163 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:42:09,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:09,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:09,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:09,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-19 14:42:09,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,194 INFO L229 MonitoredProcess]: Starting monitored process 27 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:42:09,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:42:09,197 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:42:09,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:09,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:09,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:09,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-19 14:42:09,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,237 INFO L229 MonitoredProcess]: Starting monitored process 28 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:42:09,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:42:09,240 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:42:09,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:09,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:09,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:09,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:09,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,278 INFO L229 MonitoredProcess]: Starting monitored process 29 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:42:09,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:42:09,281 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:42:09,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:09,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:09,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:09,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:09,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,317 INFO L229 MonitoredProcess]: Starting monitored process 30 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:42:09,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 14:42:09,319 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:42:09,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:09,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:09,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:09,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:09,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:09,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,351 INFO L229 MonitoredProcess]: Starting monitored process 31 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:42:09,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:42:09,352 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:42:09,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:09,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:09,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:09,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:09,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:09,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:09,376 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:42:09,390 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-19 14:42:09,390 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-19 14:42:09,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:09,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:09,394 INFO L229 MonitoredProcess]: Starting monitored process 32 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:42:09,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:42:09,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:42:09,413 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:42:09,414 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:42:09,414 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~0#1, ULTIMATE.start_entry_point_~len~0#1) = -1*ULTIMATE.start_entry_point_~i~0#1 + 1*ULTIMATE.start_entry_point_~len~0#1 Supporting invariants [] [2024-11-19 14:42:09,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-19 14:42:09,439 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-19 14:42:09,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:42:09,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:42:09,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:42:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:42:09,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:42:09,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:42:09,558 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:42:09,562 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:42:09,563 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:42:09,606 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 20 states and 26 transitions. Complement of second has 5 states. [2024-11-19 14:42:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:42:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:42:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2024-11-19 14:42:09,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 5 letters. Loop has 5 letters. [2024-11-19 14:42:09,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:42:09,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 5 letters. [2024-11-19 14:42:09,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:42:09,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 5 letters. Loop has 10 letters. [2024-11-19 14:42:09,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:42:09,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2024-11-19 14:42:09,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:42:09,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 24 transitions. [2024-11-19 14:42:09,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:42:09,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-19 14:42:09,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2024-11-19 14:42:09,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:42:09,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-19 14:42:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2024-11-19 14:42:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-19 14:42:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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:42:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-11-19 14:42:09,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-19 14:42:09,621 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-19 14:42:09,621 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:42:09,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2024-11-19 14:42:09,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:42:09,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:42:09,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:42:09,622 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:42:09,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:42:09,623 INFO L745 eck$LassoCheckResult]: Stem: 160#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 151#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 149#ldv_malloc_returnLabel#1 entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; 146#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 147#L767-3 assume !(entry_point_~i~0#1 < entry_point_~len~0#1); 148#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 144#L773-3 [2024-11-19 14:42:09,623 INFO L747 eck$LassoCheckResult]: Loop: 144#L773-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset := read~$Pointer$#1(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset);havoc entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset; 145#L773-2 entry_point_#t~post46#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post46#1 - 1;havoc entry_point_#t~post46#1; 144#L773-3 [2024-11-19 14:42:09,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966489, now seen corresponding path program 1 times [2024-11-19 14:42:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186328359] [2024-11-19 14:42:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:42:09,706 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:42:09,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:42:09,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186328359] [2024-11-19 14:42:09,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186328359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:42:09,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:42:09,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:42:09,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442504622] [2024-11-19 14:42:09,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:42:09,708 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:42:09,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2024-11-19 14:42:09,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:09,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731550999] [2024-11-19 14:42:09,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:09,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:09,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:09,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:42:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:42:09,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:42:09,768 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:42:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:42:09,787 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-11-19 14:42:09,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2024-11-19 14:42:09,788 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-19 14:42:09,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2024-11-19 14:42:09,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-19 14:42:09,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-19 14:42:09,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2024-11-19 14:42:09,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:42:09,790 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-19 14:42:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2024-11-19 14:42:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2024-11-19 14:42:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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:42:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-19 14:42:09,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-19 14:42:09,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:42:09,795 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-19 14:42:09,796 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:42:09,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2024-11-19 14:42:09,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:42:09,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:42:09,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:42:09,798 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:42:09,798 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:42:09,798 INFO L745 eck$LassoCheckResult]: Stem: 212#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 202#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 203#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 201#ldv_malloc_returnLabel#1 entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; 198#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 199#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 211#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 204#ldv_malloc_returnLabel#2 entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; 205#L769 assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; 200#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 196#L773-3 [2024-11-19 14:42:09,798 INFO L747 eck$LassoCheckResult]: Loop: 196#L773-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset := read~$Pointer$#1(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset);havoc entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset; 197#L773-2 entry_point_#t~post46#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post46#1 - 1;havoc entry_point_#t~post46#1; 196#L773-3 [2024-11-19 14:42:09,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1232385447, now seen corresponding path program 1 times [2024-11-19 14:42:09,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:09,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932715721] [2024-11-19 14:42:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:09,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:09,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:09,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:09,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 2 times [2024-11-19 14:42:09,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:09,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007276976] [2024-11-19 14:42:09,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:42:09,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:09,835 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:42:09,835 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:42:09,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:09,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:09,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1088560603, now seen corresponding path program 1 times [2024-11-19 14:42:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:09,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147219063] [2024-11-19 14:42:09,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:09,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:42:09,899 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:42:09,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:42:09,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147219063] [2024-11-19 14:42:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147219063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:42:09,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:42:09,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:42:09,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864113443] [2024-11-19 14:42:09,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:42:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:42:09,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:42:09,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:42:09,940 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:42:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:42:09,959 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2024-11-19 14:42:09,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2024-11-19 14:42:09,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:42:09,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2024-11-19 14:42:09,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-19 14:42:09,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:42:09,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2024-11-19 14:42:09,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:42:09,961 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-19 14:42:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2024-11-19 14:42:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2024-11-19 14:42:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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:42:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-19 14:42:09,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-19 14:42:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:42:09,964 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-19 14:42:09,964 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:42:09,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-11-19 14:42:09,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:42:09,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:42:09,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:42:09,966 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:42:09,966 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:42:09,966 INFO L745 eck$LassoCheckResult]: Stem: 264#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 255#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 253#ldv_malloc_returnLabel#1 entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; 250#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 251#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 260#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 258#ldv_malloc_returnLabel#2 entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; 259#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$#1(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 263#L767-2 entry_point_#t~post44#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post44#1;havoc entry_point_#t~post44#1; 261#L767-3 assume !(entry_point_~i~0#1 < entry_point_~len~0#1); 252#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 248#L773-3 [2024-11-19 14:42:09,966 INFO L747 eck$LassoCheckResult]: Loop: 248#L773-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset := read~$Pointer$#1(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset);havoc entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset; 249#L773-2 entry_point_#t~post46#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post46#1 - 1;havoc entry_point_#t~post46#1; 248#L773-3 [2024-11-19 14:42:09,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1088615463, now seen corresponding path program 1 times [2024-11-19 14:42:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509047741] [2024-11-19 14:42:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:42:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:42:10,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:42:10,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509047741] [2024-11-19 14:42:10,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509047741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:42:10,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:42:10,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:42:10,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582029045] [2024-11-19 14:42:10,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:42:10,031 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:42:10,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:10,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 3 times [2024-11-19 14:42:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:10,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596834883] [2024-11-19 14:42:10,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:42:10,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:10,036 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:42:10,036 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:42:10,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:10,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:10,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:42:10,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:42:10,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:42:10,077 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:42:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:42:10,098 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-19 14:42:10,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2024-11-19 14:42:10,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:42:10,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2024-11-19 14:42:10,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-19 14:42:10,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-19 14:42:10,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-19 14:42:10,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:42:10,101 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-19 14:42:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-19 14:42:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-11-19 14:42:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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:42:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-19 14:42:10,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-19 14:42:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:42:10,105 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-19 14:42:10,105 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:42:10,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2024-11-19 14:42:10,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:42:10,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:42:10,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:42:10,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:42:10,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:42:10,109 INFO L745 eck$LassoCheckResult]: Stem: 309#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 300#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 298#ldv_malloc_returnLabel#1 entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; 295#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 296#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 305#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 303#ldv_malloc_returnLabel#2 entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; 304#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$#1(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 308#L767-2 entry_point_#t~post44#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post44#1;havoc entry_point_#t~post44#1; 306#L767-3 assume !(entry_point_~i~0#1 < entry_point_~len~0#1); 297#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 293#L773-3 [2024-11-19 14:42:10,109 INFO L747 eck$LassoCheckResult]: Loop: 293#L773-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset := read~$Pointer$#1(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset);havoc entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset; 294#L773-2 entry_point_#t~post46#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post46#1 - 1;havoc entry_point_#t~post46#1; 293#L773-3 [2024-11-19 14:42:10,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1031357161, now seen corresponding path program 1 times [2024-11-19 14:42:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:10,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237283367] [2024-11-19 14:42:10,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:10,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:42:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:42:10,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:42:10,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237283367] [2024-11-19 14:42:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237283367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:42:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863482694] [2024-11-19 14:42:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:10,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:42:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:10,194 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:42:10,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-19 14:42:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:42:10,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:42:10,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:42:10,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-19 14:42:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:42:10,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:42:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:42:10,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863482694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:42:10,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:42:10,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 14:42:10,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408010209] [2024-11-19 14:42:10,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:42:10,385 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:42:10,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 4 times [2024-11-19 14:42:10,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:10,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242613819] [2024-11-19 14:42:10,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:42:10,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:10,391 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:42:10,391 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:42:10,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:10,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:10,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:42:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 14:42:10,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-19 14:42:10,433 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:42:10,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:42:10,487 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-19 14:42:10,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2024-11-19 14:42:10,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-19 14:42:10,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 51 transitions. [2024-11-19 14:42:10,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-19 14:42:10,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-19 14:42:10,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 51 transitions. [2024-11-19 14:42:10,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:42:10,496 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-19 14:42:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 51 transitions. [2024-11-19 14:42:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2024-11-19 14:42:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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:42:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-19 14:42:10,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-19 14:42:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 14:42:10,501 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-19 14:42:10,502 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:42:10,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2024-11-19 14:42:10,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:42:10,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:42:10,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:42:10,504 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:42:10,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:42:10,506 INFO L745 eck$LassoCheckResult]: Stem: 454#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 443#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 441#ldv_malloc_returnLabel#1 entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; 438#L763 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 439#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 448#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 467#ldv_malloc_returnLabel#2 entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; 466#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$#1(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 465#L767-2 entry_point_#t~post44#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post44#1;havoc entry_point_#t~post44#1; 449#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 451#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 444#ldv_malloc_returnLabel#2 entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; 445#L769 assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; 440#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 436#L773-3 [2024-11-19 14:42:10,506 INFO L747 eck$LassoCheckResult]: Loop: 436#L773-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset := read~$Pointer$#1(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset);havoc entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset; 437#L773-2 entry_point_#t~post46#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post46#1 - 1;havoc entry_point_#t~post46#1; 436#L773-3 [2024-11-19 14:42:10,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1033365559, now seen corresponding path program 1 times [2024-11-19 14:42:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:10,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976486096] [2024-11-19 14:42:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:10,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:10,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:10,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:10,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 5 times [2024-11-19 14:42:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:10,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772216107] [2024-11-19 14:42:10,561 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:42:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:10,566 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:42:10,567 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:42:10,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:10,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:10,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash -926855349, now seen corresponding path program 1 times [2024-11-19 14:42:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:42:10,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636672696] [2024-11-19 14:42:10,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:42:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:42:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:10,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:42:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:42:10,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:42:11,261 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:42:11,262 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:42:11,262 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:42:11,262 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:42:11,262 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:42:11,262 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:11,262 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:42:11,262 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:42:11,262 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration7_Lasso [2024-11-19 14:42:11,262 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:42:11,263 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:42:11,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:42:11,870 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:42:11,870 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:42:11,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:11,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:11,872 INFO L229 MonitoredProcess]: Starting monitored process 34 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:42:11,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:42:11,874 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:42:11,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:11,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:11,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:11,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:11,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:11,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:11,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:11,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:11,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-19 14:42:11,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:11,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:11,904 INFO L229 MonitoredProcess]: Starting monitored process 35 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:42:11,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:42:11,906 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:42:11,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:11,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:11,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:11,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:11,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:11,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:11,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:11,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-19 14:42:11,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:11,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:11,943 INFO L229 MonitoredProcess]: Starting monitored process 36 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:42:11,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-19 14:42:11,947 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:42:11,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:11,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:11,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:11,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:11,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:11,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:11,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:11,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:11,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:11,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:11,982 INFO L229 MonitoredProcess]: Starting monitored process 37 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:42:11,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-19 14:42:11,985 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:42:11,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:11,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:11,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:11,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:11,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:12,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:12,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:12,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:12,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-19 14:42:12,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:12,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:12,019 INFO L229 MonitoredProcess]: Starting monitored process 38 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:42:12,021 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:42:12,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-19 14:42:12,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:12,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:12,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:12,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:12,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:12,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:12,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:12,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:12,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:12,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:12,050 INFO L229 MonitoredProcess]: Starting monitored process 39 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:42:12,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-19 14:42:12,051 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:42:12,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:12,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:12,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:12,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:12,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:12,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:12,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:12,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-19 14:42:12,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:12,081 INFO L229 MonitoredProcess]: Starting monitored process 40 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:42:12,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-19 14:42:12,083 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:42:12,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:12,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:12,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:12,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:12,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:12,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:12,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:12,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:12,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:12,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:12,109 INFO L229 MonitoredProcess]: Starting monitored process 41 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:42:12,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-19 14:42:12,110 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:42:12,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:12,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:42:12,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:12,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:12,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:12,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:42:12,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:42:12,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:12,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:12,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:12,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:12,133 INFO L229 MonitoredProcess]: Starting monitored process 42 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:42:12,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-19 14:42:12,135 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:42:12,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:12,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:12,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:12,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:12,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:12,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:12,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:12,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:12,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:12,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:12,161 INFO L229 MonitoredProcess]: Starting monitored process 43 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:42:12,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-19 14:42:12,163 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:42:12,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:12,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:12,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:12,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:12,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:12,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:12,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:42:12,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-19 14:42:12,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:12,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:12,196 INFO L229 MonitoredProcess]: Starting monitored process 44 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:42:12,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-19 14:42:12,198 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:42:12,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:42:12,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:42:12,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:42:12,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:42:12,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:42:12,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:42:12,221 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:42:12,238 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-19 14:42:12,238 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-19 14:42:12,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:42:12,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:42:12,242 INFO L229 MonitoredProcess]: Starting monitored process 45 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:42:12,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-19 14:42:12,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:42:12,257 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:42:12,257 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:42:12,258 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0#1, v_rep(select #length ULTIMATE.start_entry_point_~array~0#1.base)_2) = 8*ULTIMATE.start_entry_point_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0#1.base)_2 Supporting invariants [] [2024-11-19 14:42:12,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-19 14:42:12,284 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 14:42:12,285 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:42:12,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:42:12,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:42:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:42:12,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:42:12,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:42:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:42:12,340 WARN L253 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:42:12,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:42:12,357 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:42:12,358 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:42:12,358 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:42:12,372 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 34 states and 41 transitions. Complement of second has 4 states. [2024-11-19 14:42:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:42:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:42:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-11-19 14:42:12,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-19 14:42:12,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:42:12,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2024-11-19 14:42:12,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:42:12,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2024-11-19 14:42:12,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:42:12,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-11-19 14:42:12,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:42:12,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2024-11-19 14:42:12,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:42:12,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:42:12,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:42:12,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:42:12,375 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:42:12,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:42:12,375 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:42:12,375 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:42:12,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:42:12,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:42:12,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:42:12,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:42:12 BoogieIcfgContainer [2024-11-19 14:42:12,382 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:42:12,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:42:12,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:42:12,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:42:12,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:42:06" (3/4) ... [2024-11-19 14:42:12,385 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:42:12,386 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:42:12,387 INFO L158 Benchmark]: Toolchain (without parser) took 7486.07ms. Allocated memory was 190.8MB in the beginning and 264.2MB in the end (delta: 73.4MB). Free memory was 120.8MB in the beginning and 171.7MB in the end (delta: -51.0MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-19 14:42:12,387 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:42:12,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 692.63ms. Allocated memory is still 190.8MB. Free memory was 120.8MB in the beginning and 153.9MB in the end (delta: -33.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-19 14:42:12,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.54ms. Allocated memory is still 190.8MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:42:12,388 INFO L158 Benchmark]: Boogie Preprocessor took 49.07ms. Allocated memory is still 190.8MB. Free memory was 151.8MB in the beginning and 148.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:42:12,388 INFO L158 Benchmark]: RCFGBuilder took 326.09ms. Allocated memory is still 190.8MB. Free memory was 148.7MB in the beginning and 135.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 14:42:12,388 INFO L158 Benchmark]: BuchiAutomizer took 6346.43ms. Allocated memory was 190.8MB in the beginning and 264.2MB in the end (delta: 73.4MB). Free memory was 135.0MB in the beginning and 172.8MB in the end (delta: -37.8MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2024-11-19 14:42:12,388 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 264.2MB. Free memory was 172.8MB in the beginning and 171.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:42:12,389 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.19ms. Allocated memory is still 113.2MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 692.63ms. Allocated memory is still 190.8MB. Free memory was 120.8MB in the beginning and 153.9MB in the end (delta: -33.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.54ms. Allocated memory is still 190.8MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.07ms. Allocated memory is still 190.8MB. Free memory was 151.8MB in the beginning and 148.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.09ms. Allocated memory is still 190.8MB. Free memory was 148.7MB in the beginning and 135.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 6346.43ms. Allocated memory was 190.8MB in the beginning and 264.2MB in the end (delta: 73.4MB). Free memory was 135.0MB in the beginning and 172.8MB in the end (delta: -37.8MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 264.2MB. Free memory was 172.8MB in the beginning and 171.7MB in the end (delta: 1.0MB). 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -1 * i) + len) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 30 StatesRemovedByMinimization, 6 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 218 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 96 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital232 mio100 ax114 hnf100 lsp73 ukn44 mio100 lsp43 div100 bol100 ite100 ukn100 eq154 hnf92 smp100 dnf160 smp86 tf101 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 14:42:12,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-19 14:42:12,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-19 14:42:12,814 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