./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-12 00:41:57,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:41:58,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:41:58,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:41:58,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:41:58,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:41:58,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:41:58,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:41:58,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:41:58,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:41:58,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:41:58,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:41:58,107 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:41:58,108 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:41:58,108 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:41:58,108 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:41:58,108 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:41:58,109 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:41:58,109 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:41:58,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:41:58,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:41:58,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:41:58,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:41:58,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:41:58,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:41:58,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:41:58,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:41:58,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:41:58,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:41:58,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:41:58,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:41:58,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:41:58,116 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:41:58,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:41:58,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:41:58,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:41:58,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:41:58,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:41:58,122 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:41:58,122 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-clean/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-clean/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-10-12 00:41:58,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:41:58,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:41:58,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:41:58,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:41:58,424 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:41:58,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2024-10-12 00:42:00,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:42:00,374 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:42:00,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2024-10-12 00:42:00,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b8d24e729/76faa0ccd87641599c5f30b788eca592/FLAGb4cf7e311 [2024-10-12 00:42:00,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b8d24e729/76faa0ccd87641599c5f30b788eca592 [2024-10-12 00:42:00,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:42:00,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:42:00,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:42:00,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:42:00,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:42:00,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:42:00" (1/1) ... [2024-10-12 00:42:00,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b1f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:00, skipping insertion in model container [2024-10-12 00:42:00,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:42:00" (1/1) ... [2024-10-12 00:42:00,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:42:00,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:42:00,952 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:42:01,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:42:01,055 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:42:01,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01 WrapperNode [2024-10-12 00:42:01,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:42:01,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:42:01,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:42:01,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:42:01,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,124 INFO L138 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 28, calls inlined = 5, statements flattened = 69 [2024-10-12 00:42:01,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:42:01,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:42:01,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:42:01,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:42:01,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,165 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-10-12 00:42:01,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:42:01,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:42:01,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:42:01,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:42:01,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (1/1) ... [2024-10-12 00:42:01,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:01,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:01,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:01,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:42:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 00:42:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:42:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 00:42:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 00:42:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 00:42:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 00:42:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:42:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 00:42:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 00:42:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:42:01,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:42:01,484 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:42:01,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:42:01,627 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-12 00:42:01,630 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:42:01,641 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:42:01,642 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:42:01,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:42:01 BoogieIcfgContainer [2024-10-12 00:42:01,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:42:01,644 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:42:01,644 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:42:01,648 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:42:01,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:42:01,650 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:42:00" (1/3) ... [2024-10-12 00:42:01,651 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b97055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:42:01, skipping insertion in model container [2024-10-12 00:42:01,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:42:01,651 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:42:01" (2/3) ... [2024-10-12 00:42:01,652 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b97055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:42:01, skipping insertion in model container [2024-10-12 00:42:01,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:42:01,653 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:42:01" (3/3) ... [2024-10-12 00:42:01,654 INFO L332 chiAutomizerObserver]: Analyzing ICFG memleaks_test18.i [2024-10-12 00:42:01,707 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:42:01,708 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:42:01,708 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:42:01,709 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:42:01,709 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:42:01,709 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:42:01,709 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:42:01,710 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:42:01,714 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-10-12 00:42:01,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-12 00:42:01,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:42:01,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:42:01,734 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:42:01,734 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:42:01,735 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:42:01,735 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-10-12 00:42:01,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-12 00:42:01,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:42:01,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:42:01,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:42:01,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:42:01,743 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-10-12 00:42:01,743 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-10-12 00:42:01,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:01,750 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2024-10-12 00:42:01,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:01,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820729125] [2024-10-12 00:42:01,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:01,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:42:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:42:02,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:42:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820729125] [2024-10-12 00:42:02,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820729125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:42:02,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:42:02,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:42:02,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073220548] [2024-10-12 00:42:02,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:42:02,140 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:42:02,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:02,141 INFO L85 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 1 times [2024-10-12 00:42:02,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:02,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769630039] [2024-10-12 00:42:02,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:02,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:02,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:02,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:02,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:42:02,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:42:02,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:42:02,605 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-10-12 00:42:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:42:02,642 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-10-12 00:42:02,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2024-10-12 00:42:02,644 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:42:02,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 14 states and 17 transitions. [2024-10-12 00:42:02,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:42:02,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:42:02,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2024-10-12 00:42:02,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:42:02,651 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-10-12 00:42:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2024-10-12 00:42:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-10-12 00:42:02,673 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-10-12 00:42:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-10-12 00:42:02,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-12 00:42:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:42:02,682 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-12 00:42:02,683 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:42:02,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-10-12 00:42:02,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-12 00:42:02,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:42:02,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:42:02,687 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:42:02,687 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:42:02,688 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-10-12 00:42:02,688 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-10-12 00:42:02,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2024-10-12 00:42:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:02,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250641366] [2024-10-12 00:42:02,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:02,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:02,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:02,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:02,735 INFO L85 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 2 times [2024-10-12 00:42:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:02,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353189367] [2024-10-12 00:42:02,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:02,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:02,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:02,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:02,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1232444971, now seen corresponding path program 1 times [2024-10-12 00:42:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208097410] [2024-10-12 00:42:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:02,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:02,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:02,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:03,237 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:42:03,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:42:03,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:42:03,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:42:03,238 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:42:03,239 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:03,239 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:42:03,239 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:42:03,239 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration2_Lasso [2024-10-12 00:42:03,239 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:42:03,239 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:42:03,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:03,817 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:42:03,821 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:42:03,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:03,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:03,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:03,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:42:03,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:03,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:03,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:03,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:03,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:03,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:03,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:03,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:03,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:03,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:42:03,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:03,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:03,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:03,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:42:03,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:03,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:03,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:03,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:03,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:03,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:03,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:03,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:03,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:42:03,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:03,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:03,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:03,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:42:03,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:03,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:03,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:03,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:03,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:03,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:03,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:03,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:03,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:42:03,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:03,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:03,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:03,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:42:03,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:03,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:03,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:03,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:03,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:03,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:03,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:03,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:03,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:03,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:42:03,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:03,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:03,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:42:04,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:04,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:42:04,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:42:04,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,078 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:42:04,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:42:04,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,116 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:42:04,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:42:04,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,159 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:42:04,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:04,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:04,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:42:04,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,211 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:42:04,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:04,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:04,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:04,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,253 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:42:04,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:42:04,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,288 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:42:04,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:04,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:04,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:42:04,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,328 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:42:04,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:04,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:04,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:42:04,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,364 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:42:04,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:04,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,398 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:42:04,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:04,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,436 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:42:04,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:04,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,471 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:42:04,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:04,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,511 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:42:04,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:42:04,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,545 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:42:04,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:42:04,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,579 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:42:04,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:04,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,613 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:42:04,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:04,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:04,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:42:04,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,652 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:42:04,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:42:04,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,716 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:42:04,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:42:04,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,748 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:42:04,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-12 00:42:04,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,781 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:42:04,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:04,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:04,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-12 00:42:04,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,817 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:42:04,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:04,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:04,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:04,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,862 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:42:04,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:04,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:04,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:42:04,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,936 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:42:04,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:04,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:04,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 00:42:04,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,966 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:42:04,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:04,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:04,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:04,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:04,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:04,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:04,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:04,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:04,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:04,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 00:42:04,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:04,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:04,994 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:04,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:42:04,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:05,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:05,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:05,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:05,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:05,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:05,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:05,017 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:42:05,027 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-12 00:42:05,027 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:42:05,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:05,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:05,030 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:05,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:42:05,032 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:42:05,043 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:42:05,043 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:42:05,044 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-10-12 00:42:05,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-12 00:42:05,107 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-12 00:42:05,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:05,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:42:05,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:42:05,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:42:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:42:05,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:42:05,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:42:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:42:05,205 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-10-12 00:42:05,206 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-10-12 00:42:05,241 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-10-12 00:42:05,242 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-10-12 00:42:05,242 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-10-12 00:42:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2024-10-12 00:42:05,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 5 letters. Loop has 5 letters. [2024-10-12 00:42:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:42:05,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 5 letters. [2024-10-12 00:42:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:42:05,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 5 letters. Loop has 10 letters. [2024-10-12 00:42:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:42:05,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2024-10-12 00:42:05,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:42:05,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 24 transitions. [2024-10-12 00:42:05,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-12 00:42:05,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:42:05,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2024-10-12 00:42:05,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:42:05,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-12 00:42:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2024-10-12 00:42:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-10-12 00:42:05,248 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-10-12 00:42:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-10-12 00:42:05,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-10-12 00:42:05,249 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-10-12 00:42:05,249 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:42:05,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2024-10-12 00:42:05,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:42:05,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:42:05,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:42:05,250 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:42:05,250 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:42:05,250 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-10-12 00:42:05,252 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-10-12 00:42:05,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966489, now seen corresponding path program 1 times [2024-10-12 00:42:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012571319] [2024-10-12 00:42:05,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:42:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:42:05,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:42:05,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012571319] [2024-10-12 00:42:05,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012571319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:42:05,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:42:05,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:42:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409730399] [2024-10-12 00:42:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:42:05,294 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:42:05,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2024-10-12 00:42:05,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866566234] [2024-10-12 00:42:05,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:42:05,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:42:05,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:42:05,333 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-10-12 00:42:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:42:05,347 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-10-12 00:42:05,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2024-10-12 00:42:05,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:42:05,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2024-10-12 00:42:05,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:42:05,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-12 00:42:05,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2024-10-12 00:42:05,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:42:05,348 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-12 00:42:05,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2024-10-12 00:42:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2024-10-12 00:42:05,350 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-10-12 00:42:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-10-12 00:42:05,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-12 00:42:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:42:05,351 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-12 00:42:05,351 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:42:05,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2024-10-12 00:42:05,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:42:05,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:42:05,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:42:05,352 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:42:05,352 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:42:05,352 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-10-12 00:42:05,352 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-10-12 00:42:05,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1232385447, now seen corresponding path program 1 times [2024-10-12 00:42:05,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141290935] [2024-10-12 00:42:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:05,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 2 times [2024-10-12 00:42:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416579787] [2024-10-12 00:42:05,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:05,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1088560603, now seen corresponding path program 1 times [2024-10-12 00:42:05,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636742975] [2024-10-12 00:42:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:42:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:42:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:42:05,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636742975] [2024-10-12 00:42:05,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636742975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:42:05,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:42:05,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:42:05,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272829329] [2024-10-12 00:42:05,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:42:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:42:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:42:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:42:05,451 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-10-12 00:42:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:42:05,468 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2024-10-12 00:42:05,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2024-10-12 00:42:05,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:42:05,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2024-10-12 00:42:05,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:42:05,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:42:05,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2024-10-12 00:42:05,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:42:05,469 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-12 00:42:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2024-10-12 00:42:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2024-10-12 00:42:05,470 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-10-12 00:42:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 00:42:05,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:42:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:42:05,471 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:42:05,471 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:42:05,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-10-12 00:42:05,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:42:05,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:42:05,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:42:05,472 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:42:05,472 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:42:05,472 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-10-12 00:42:05,472 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-10-12 00:42:05,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1088615463, now seen corresponding path program 1 times [2024-10-12 00:42:05,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469864849] [2024-10-12 00:42:05,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:42:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:42:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:42:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469864849] [2024-10-12 00:42:05,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469864849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:42:05,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:42:05,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:42:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132508840] [2024-10-12 00:42:05,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:42:05,521 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:42:05,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 3 times [2024-10-12 00:42:05,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839304331] [2024-10-12 00:42:05,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:05,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:42:05,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:42:05,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:42:05,561 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-10-12 00:42:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:42:05,575 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-10-12 00:42:05,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2024-10-12 00:42:05,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:42:05,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2024-10-12 00:42:05,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:42:05,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:42:05,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-10-12 00:42:05,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:42:05,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-12 00:42:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-10-12 00:42:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-12 00:42:05,577 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-10-12 00:42:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-10-12 00:42:05,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-12 00:42:05,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:42:05,578 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-12 00:42:05,578 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:42:05,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2024-10-12 00:42:05,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:42:05,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:42:05,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:42:05,579 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:42:05,579 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:42:05,579 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-10-12 00:42:05,579 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-10-12 00:42:05,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1031357161, now seen corresponding path program 1 times [2024-10-12 00:42:05,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283010030] [2024-10-12 00:42:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:42:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:42:05,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:42:05,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283010030] [2024-10-12 00:42:05,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283010030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:42:05,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371862967] [2024-10-12 00:42:05,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:42:05,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:05,631 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:42:05,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-12 00:42:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:42:05,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:42:05,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:42:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:42:05,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:42:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:42:05,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371862967] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:42:05,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:42:05,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-12 00:42:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887242507] [2024-10-12 00:42:05,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:42:05,748 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:42:05,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 4 times [2024-10-12 00:42:05,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167623706] [2024-10-12 00:42:05,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:05,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:42:05,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 00:42:05,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-12 00:42:05,783 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-10-12 00:42:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:42:05,826 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-10-12 00:42:05,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2024-10-12 00:42:05,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:42:05,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 51 transitions. [2024-10-12 00:42:05,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-12 00:42:05,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-12 00:42:05,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 51 transitions. [2024-10-12 00:42:05,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:42:05,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-10-12 00:42:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 51 transitions. [2024-10-12 00:42:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2024-10-12 00:42:05,831 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-10-12 00:42:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-10-12 00:42:05,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-12 00:42:05,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:42:05,833 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-12 00:42:05,833 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:42:05,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2024-10-12 00:42:05,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:42:05,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:42:05,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:42:05,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:42:05,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:42:05,834 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-10-12 00:42:05,834 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-10-12 00:42:05,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1033365559, now seen corresponding path program 1 times [2024-10-12 00:42:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517245832] [2024-10-12 00:42:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:05,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 5 times [2024-10-12 00:42:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889595914] [2024-10-12 00:42:05,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:05,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash -926855349, now seen corresponding path program 1 times [2024-10-12 00:42:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:42:05,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618348152] [2024-10-12 00:42:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:42:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:42:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:42:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:42:05,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:42:06,649 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:42:06,649 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:42:06,649 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:42:06,649 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:42:06,649 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:42:06,650 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:06,650 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:42:06,650 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:42:06,650 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration7_Lasso [2024-10-12 00:42:06,650 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:42:06,650 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:42:06,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:06,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:42:07,259 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:42:07,259 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:42:07,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,264 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:42:07,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:07,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:07,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:07,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:07,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:42:07,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,294 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:42:07,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:07,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:07,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:07,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:07,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,330 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:42:07,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:07,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:07,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:07,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:07,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,362 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:42:07,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:07,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:07,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:07,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:07,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:07,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,409 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:42:07,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:07,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:07,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:07,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:07,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,440 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:42:07,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:07,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:07,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:07,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:07,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,473 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:42:07,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:07,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:07,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:07,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:07,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:07,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,505 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:42:07,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:42:07,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:42:07,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:42:07,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:07,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:07,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,536 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:42:07,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:07,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:07,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:07,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:07,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,563 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:42:07,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:07,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:07,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:42:07,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:07,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,589 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:42:07,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:42:07,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:42:07,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:42:07,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:42:07,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:42:07,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:42:07,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:42:07,611 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:42:07,623 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-12 00:42:07,623 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:42:07,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:42:07,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:42:07,624 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:42:07,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:42:07,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:42:07,638 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:42:07,638 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:42:07,638 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-10-12 00:42:07,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:07,659 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-12 00:42:07,660 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:42:07,661 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:42:07,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:42:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:42:07,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:42:07,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:42:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:42:07,719 WARN L253 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:42:07,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:42:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:42:07,735 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-10-12 00:42:07,735 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-10-12 00:42:07,749 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-10-12 00:42:07,749 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-10-12 00:42:07,750 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-10-12 00:42:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-10-12 00:42:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2024-10-12 00:42:07,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:42:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2024-10-12 00:42:07,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:42:07,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2024-10-12 00:42:07,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:42:07,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-10-12 00:42:07,765 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:42:07,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2024-10-12 00:42:07,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:42:07,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:42:07,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:42:07,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:42:07,765 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:42:07,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:42:07,765 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:42:07,765 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:42:07,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:42:07,765 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:42:07,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:42:07,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:42:07 BoogieIcfgContainer [2024-10-12 00:42:07,772 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:42:07,773 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:42:07,773 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:42:07,773 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:42:07,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:42:01" (3/4) ... [2024-10-12 00:42:07,774 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:42:07,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:42:07,775 INFO L158 Benchmark]: Toolchain (without parser) took 7364.35ms. Allocated memory was 201.3MB in the beginning and 306.2MB in the end (delta: 104.9MB). Free memory was 128.9MB in the beginning and 267.0MB in the end (delta: -138.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:42:07,775 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 127.9MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:42:07,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.85ms. Allocated memory is still 201.3MB. Free memory was 128.9MB in the beginning and 104.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 00:42:07,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.08ms. Allocated memory is still 201.3MB. Free memory was 104.9MB in the beginning and 102.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:42:07,776 INFO L158 Benchmark]: Boogie Preprocessor took 58.67ms. Allocated memory is still 201.3MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:42:07,776 INFO L158 Benchmark]: RCFGBuilder took 454.46ms. Allocated memory is still 201.3MB. Free memory was 100.4MB in the beginning and 86.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 00:42:07,776 INFO L158 Benchmark]: BuchiAutomizer took 6128.57ms. Allocated memory was 201.3MB in the beginning and 306.2MB in the end (delta: 104.9MB). Free memory was 85.7MB in the beginning and 267.3MB in the end (delta: -181.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:42:07,777 INFO L158 Benchmark]: Witness Printer took 2.41ms. Allocated memory is still 306.2MB. Free memory was 267.3MB in the beginning and 267.0MB in the end (delta: 353.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:42:07,777 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 127.9MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.85ms. Allocated memory is still 201.3MB. Free memory was 128.9MB in the beginning and 104.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.08ms. Allocated memory is still 201.3MB. Free memory was 104.9MB in the beginning and 102.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.67ms. Allocated memory is still 201.3MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.46ms. Allocated memory is still 201.3MB. Free memory was 100.4MB in the beginning and 86.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 6128.57ms. Allocated memory was 201.3MB in the beginning and 306.2MB in the end (delta: 104.9MB). Free memory was 85.7MB in the beginning and 267.3MB in the end (delta: -181.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.41ms. Allocated memory is still 306.2MB. Free memory was 267.3MB in the beginning and 267.0MB in the end (delta: 353.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 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: 31ms 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 [2024-10-12 00:42:07,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 RESULT: Ultimate proved your program to be correct! [2024-10-12 00:42:07,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-10-12 00:42:08,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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