./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 682a48acff360d61f631a6f73c43d35eb5554cb5c1e29a6f88508c15be8e86ce --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:28:30,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:28:30,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:28:30,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:28:30,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:28:30,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:28:30,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:28:30,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:28:30,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:28:30,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:28:30,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:28:30,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:28:30,975 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:28:30,976 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:28:30,977 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:28:30,977 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:28:30,977 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:28:30,977 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:28:30,978 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:28:30,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:28:30,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:28:30,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:28:30,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:28:30,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:28:30,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:28:30,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:28:30,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:28:30,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:28:30,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:28:30,986 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:28:30,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:28:30,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:28:30,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:28:30,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:28:30,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:28:30,988 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:28:30,989 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 682a48acff360d61f631a6f73c43d35eb5554cb5c1e29a6f88508c15be8e86ce [2024-11-09 15:28:31,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:28:31,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:28:31,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:28:31,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:28:31,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:28:31,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2024-11-09 15:28:32,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:28:33,020 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:28:33,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2024-11-09 15:28:33,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0003134b5/965b22eb34ad4ab889f6f56bcc000b56/FLAG8fe32e34b [2024-11-09 15:28:33,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0003134b5/965b22eb34ad4ab889f6f56bcc000b56 [2024-11-09 15:28:33,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:28:33,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:28:33,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:33,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:28:33,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:28:33,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b12a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33, skipping insertion in model container [2024-11-09 15:28:33,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:28:33,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:33,634 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:28:33,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:33,666 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:28:33,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33 WrapperNode [2024-11-09 15:28:33,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:33,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:33,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:28:33,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:28:33,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,694 INFO L138 Inliner]: procedures = 11, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-11-09 15:28:33,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:33,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:28:33,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:28:33,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:28:33,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,720 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [5, 8]. 62 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 7 writes are split as follows [3, 4]. [2024-11-09 15:28:33,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:28:33,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:28:33,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:28:33,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:28:33,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (1/1) ... [2024-11-09 15:28:33,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:33,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:28:33,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:28:33,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:28:33,808 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2024-11-09 15:28:33,808 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2024-11-09 15:28:33,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 15:28:33,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:28:33,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:28:33,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:28:33,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:28:33,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:28:33,874 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:28:33,875 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:28:34,001 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 15:28:34,001 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:28:34,016 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:28:34,016 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:28:34,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:34 BoogieIcfgContainer [2024-11-09 15:28:34,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:28:34,018 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:28:34,019 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:28:34,022 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:28:34,022 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:34,023 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:28:33" (1/3) ... [2024-11-09 15:28:34,023 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73a0129c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:34, skipping insertion in model container [2024-11-09 15:28:34,023 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:34,023 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:33" (2/3) ... [2024-11-09 15:28:34,024 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73a0129c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:34, skipping insertion in model container [2024-11-09 15:28:34,024 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:34,024 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:34" (3/3) ... [2024-11-09 15:28:34,025 INFO L332 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex9.i [2024-11-09 15:28:34,069 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:28:34,069 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:28:34,069 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:28:34,070 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:28:34,070 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:28:34,070 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:28:34,070 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:28:34,070 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:28:34,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:28:34,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-09 15:28:34,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:34,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:34,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:28:34,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:34,098 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:28:34,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:28:34,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-09 15:28:34,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:34,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:34,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:28:34,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:34,108 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 9#L29-3true [2024-11-09 15:28:34,109 INFO L747 eck$LassoCheckResult]: Loop: 9#L29-3true call main_#t~mem6#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 6#L29-1true assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int#0(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 7#L33true call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 13#$Ultimate##0true ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 10#L9true assume ~i < 0;call write~int#0(1 + ~i, ~op.base, ~op.offset, 4); 15#recFINALtrue assume true; 14#recEXITtrue >#33#return; 4#L33-1true havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int#1(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 9#L29-3true [2024-11-09 15:28:34,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2024-11-09 15:28:34,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:34,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30382404] [2024-11-09 15:28:34,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:34,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:34,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:34,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:34,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2024-11-09 15:28:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:34,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632097132] [2024-11-09 15:28:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:34,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:34,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:28:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:34,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:34,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632097132] [2024-11-09 15:28:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632097132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:34,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:34,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 15:28:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731045520] [2024-11-09 15:28:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:34,779 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:28:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:34,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:28:34,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:28:34,816 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:28:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:34,927 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-09 15:28:34,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2024-11-09 15:28:34,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-09 15:28:34,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2024-11-09 15:28:34,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:28:34,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:28:34,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-11-09 15:28:34,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:34,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-09 15:28:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-11-09 15:28:34,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-09 15:28:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:28:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-09 15:28:34,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-09 15:28:34,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:28:34,964 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-09 15:28:34,964 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:28:34,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2024-11-09 15:28:34,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-09 15:28:34,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:34,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:34,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:28:34,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:34,968 INFO L745 eck$LassoCheckResult]: Stem: 62#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 53#L29-3 [2024-11-09 15:28:34,968 INFO L747 eck$LassoCheckResult]: Loop: 53#L29-3 call main_#t~mem6#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 54#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int#0(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 56#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 64#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 55#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 57#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 64#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 55#L9 assume ~i < 0;call write~int#0(1 + ~i, ~op.base, ~op.offset, 4); 58#recFINAL assume true; 65#recEXIT >#31#return; 59#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 60#recFINAL assume true; 66#recEXIT >#33#return; 61#L33-1 havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int#1(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 53#L29-3 [2024-11-09 15:28:34,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:34,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2024-11-09 15:28:34,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:34,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181110233] [2024-11-09 15:28:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:34,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:34,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:34,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:34,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2024-11-09 15:28:34,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:34,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967908668] [2024-11-09 15:28:34,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:34,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:28:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:35,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:28:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:28:35,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:35,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967908668] [2024-11-09 15:28:35,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967908668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:35,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010184909] [2024-11-09 15:28:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:35,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:35,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:35,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:35,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 15:28:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:35,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:28:35,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:35,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 15:28:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:28:35,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:28:35,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010184909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:35,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:35,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 13 [2024-11-09 15:28:35,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887727768] [2024-11-09 15:28:35,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:35,719 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:28:35,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:35,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:28:35,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 15:28:35,722 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 15:28:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:35,843 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-11-09 15:28:35,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2024-11-09 15:28:35,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-09 15:28:35,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2024-11-09 15:28:35,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-09 15:28:35,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-09 15:28:35,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2024-11-09 15:28:35,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:35,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-09 15:28:35,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2024-11-09 15:28:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-09 15:28:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:28:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-09 15:28:35,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-09 15:28:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 15:28:35,849 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-09 15:28:35,849 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:28:35,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2024-11-09 15:28:35,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-09 15:28:35,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:35,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:35,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:28:35,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:35,851 INFO L745 eck$LassoCheckResult]: Stem: 205#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 206#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 196#L29-3 [2024-11-09 15:28:35,851 INFO L747 eck$LassoCheckResult]: Loop: 196#L29-3 call main_#t~mem6#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 197#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int#0(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 200#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 207#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 198#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 199#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 207#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 198#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 199#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 207#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 198#L9 assume ~i < 0;call write~int#0(1 + ~i, ~op.base, ~op.offset, 4); 201#recFINAL assume true; 208#recEXIT >#31#return; 202#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 203#recFINAL assume true; 212#recEXIT >#31#return; 210#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 211#recFINAL assume true; 209#recEXIT >#33#return; 204#L33-1 havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int#1(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 196#L29-3 [2024-11-09 15:28:35,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2024-11-09 15:28:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:35,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665067067] [2024-11-09 15:28:35,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:35,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:35,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2024-11-09 15:28:35,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:35,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566553124] [2024-11-09 15:28:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:35,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:35,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1421169023, now seen corresponding path program 1 times [2024-11-09 15:28:35,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:35,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491665397] [2024-11-09 15:28:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:35,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:37,504 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:37,505 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:37,506 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:37,506 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:37,506 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:37,506 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:37,506 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:37,506 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:37,507 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration3_Lasso [2024-11-09 15:28:37,507 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:37,507 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:37,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:37,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,077 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:38,081 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:38,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:28:38,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:38,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:38,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:38,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:38,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:28:38,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:38,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:38,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:38,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-09 15:28:38,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,167 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:28:38,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:38,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:38,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:38,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:28:38,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:28:38,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:38,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:38,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:38,241 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:28:38,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:28:38,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:38,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:38,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:28:38,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,319 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:28:38,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:38,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:38,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-09 15:28:38,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,364 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:28:38,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:38,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:38,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:38,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,402 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:28:38,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:38,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:38,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:28:38,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,442 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:28:38,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,456 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-09 15:28:38,457 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-09 15:28:38,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,489 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2024-11-09 15:28:38,489 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-11-09 15:28:38,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:28:38,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:28:38,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:38,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:38,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:28:38,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,598 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:28:38,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:38,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:38,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:38,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:38,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:38,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,635 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:28:38,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:38,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:38,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:38,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:38,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:38,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:38,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:38,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:38,674 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:28:38,674 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:28:38,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,679 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:28:38,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:38,706 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:38,706 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:38,707 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~qq~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~qq~0#1.base) 0)_1 Supporting invariants [] [2024-11-09 15:28:38,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:28:38,735 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-11-09 15:28:38,740 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 15:28:38,740 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 15:28:38,740 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~qq~0!base,]]] [2024-11-09 15:28:38,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:38,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:28:38,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:38,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 15:28:38,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:38,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 15:28:38,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2024-11-09 15:28:39,248 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-09 15:28:39,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2024-11-09 15:28:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 15:28:39,349 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-09 15:28:39,350 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:28:39,416 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Result 22 states and 25 transitions. Complement of second has 5 states. [2024-11-09 15:28:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:28:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2024-11-09 15:28:39,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 20 letters. [2024-11-09 15:28:39,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:39,420 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:28:39,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:39,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:28:39,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:39,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 15:28:39,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:39,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-09 15:28:39,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 15:28:39,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 15:28:39,941 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-09 15:28:39,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2024-11-09 15:28:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 15:28:40,026 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-09 15:28:40,026 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 15:28:40,241 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Result 54 states and 61 transitions. Complement of second has 32 states. [2024-11-09 15:28:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 15:28:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2024-11-09 15:28:40,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 19 transitions. Stem has 2 letters. Loop has 20 letters. [2024-11-09 15:28:40,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:40,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 19 transitions. Stem has 22 letters. Loop has 20 letters. [2024-11-09 15:28:40,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:40,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 19 transitions. Stem has 2 letters. Loop has 40 letters. [2024-11-09 15:28:40,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:40,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2024-11-09 15:28:40,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:40,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 32 states and 37 transitions. [2024-11-09 15:28:40,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:28:40,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:28:40,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2024-11-09 15:28:40,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:40,253 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 15:28:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2024-11-09 15:28:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2024-11-09 15:28:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:28:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-09 15:28:40,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-09 15:28:40,260 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-09 15:28:40,260 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:28:40,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2024-11-09 15:28:40,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:40,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:40,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:40,264 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:28:40,264 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:40,264 INFO L745 eck$LassoCheckResult]: Stem: 532#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 533#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 518#L29-3 call main_#t~mem6#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 520#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int#0(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 524#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 535#$Ultimate##0 [2024-11-09 15:28:40,264 INFO L747 eck$LassoCheckResult]: Loop: 535#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 522#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 523#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 535#$Ultimate##0 [2024-11-09 15:28:40,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:40,264 INFO L85 PathProgramCache]: Analyzing trace with hash 36330296, now seen corresponding path program 1 times [2024-11-09 15:28:40,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:40,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530696997] [2024-11-09 15:28:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:40,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:40,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:40,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:40,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:40,289 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 1 times [2024-11-09 15:28:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:40,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591449580] [2024-11-09 15:28:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:40,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:40,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:40,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:40,297 INFO L85 PathProgramCache]: Analyzing trace with hash -15910302, now seen corresponding path program 1 times [2024-11-09 15:28:40,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:40,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655258611] [2024-11-09 15:28:40,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:40,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:40,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:40,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:41,055 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:41,055 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:41,056 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:41,056 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:41,056 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:41,056 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,056 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:41,056 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:41,056 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration4_Lasso [2024-11-09 15:28:41,056 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:41,057 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:41,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,475 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:41,475 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:41,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,477 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:28:41,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,504 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:28:41,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-11-09 15:28:41,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:28:41,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,528 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:28:41,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,556 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:28:41,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,586 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:28:41,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,620 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:28:41,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:28:41,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,655 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:28:41,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,680 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:28:41,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,705 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:28:41,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,730 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:28:41,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-09 15:28:41,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,755 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:28:41,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,781 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:28:41,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,809 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:28:41,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-09 15:28:41,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,833 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:28:41,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,858 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:28:41,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,882 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:28:41,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,906 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:28:41,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:41,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:41,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-09 15:28:41,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,937 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 15:28:41,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:41,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:41,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-09 15:28:41,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,977 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:41,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:28:41,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:41,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:41,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:42,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:42,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,008 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:42,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:28:42,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:42,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:42,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:42,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:42,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:42,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:42,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:42,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-09 15:28:42,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,043 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:42,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-09 15:28:42,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:42,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:42,056 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-09 15:28:42,056 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:28:42,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,062 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2024-11-09 15:28:42,062 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-09 15:28:42,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:42,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:42,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,085 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:42,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-09 15:28:42,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:42,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:42,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:42,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:42,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:42,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:42,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:42,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:42,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,112 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:42,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-09 15:28:42,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:42,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:42,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:42,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:42,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:42,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:42,130 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:42,139 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-09 15:28:42,139 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-09 15:28:42,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,140 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:42,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-09 15:28:42,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:42,152 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:42,152 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:42,152 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_#in~i) = 2*rec_#in~i + 1 Supporting invariants [] [2024-11-09 15:28:42,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:42,165 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-09 15:28:42,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:42,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:28:42,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:42,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:28:42,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:42,233 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 15:28:42,233 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:42,269 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 7. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 62 transitions. Complement of second has 14 states. [2024-11-09 15:28:42,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2024-11-09 15:28:42,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-09 15:28:42,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:42,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2024-11-09 15:28:42,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:42,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2024-11-09 15:28:42,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:42,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2024-11-09 15:28:42,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:42,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 37 states and 44 transitions. [2024-11-09 15:28:42,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-09 15:28:42,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-09 15:28:42,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2024-11-09 15:28:42,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:42,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-09 15:28:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2024-11-09 15:28:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 15:28:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-09 15:28:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-09 15:28:42,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-09 15:28:42,281 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-09 15:28:42,281 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:28:42,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2024-11-09 15:28:42,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:42,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:42,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:42,282 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:28:42,282 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:42,283 INFO L745 eck$LassoCheckResult]: Stem: 677#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 678#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 660#L29-3 call main_#t~mem6#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 661#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int#0(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 669#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 680#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 668#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 670#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 693#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 692#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 673#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 693#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 689#L9 assume ~i < 0;call write~int#0(1 + ~i, ~op.base, ~op.offset, 4); 682#recFINAL assume true; 681#recEXIT >#31#return; 671#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 675#recFINAL assume true; 688#recEXIT >#31#return; 687#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 686#recFINAL assume true; 685#recEXIT >#33#return; 676#L33-1 havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int#1(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 662#L29-3 call main_#t~mem6#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 664#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int#0(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 666#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 679#$Ultimate##0 [2024-11-09 15:28:42,283 INFO L747 eck$LassoCheckResult]: Loop: 679#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 665#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 667#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 679#$Ultimate##0 [2024-11-09 15:28:42,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1741254842, now seen corresponding path program 2 times [2024-11-09 15:28:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:42,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573271189] [2024-11-09 15:28:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:42,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-09 15:28:42,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:28:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:42,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:28:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:43,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:28:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 15:28:43,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:43,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573271189] [2024-11-09 15:28:43,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573271189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:43,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358557746] [2024-11-09 15:28:43,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:28:43,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:43,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:43,348 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:43,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-09 15:28:43,435 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:28:43,435 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:28:43,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 15:28:43,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:43,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2024-11-09 15:28:43,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 15:28:43,636 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~qq~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~qq~0#1.offset_BEFORE_CALL_3| Int)) (<= (select (select |c_#memory_int#1| |v_ULTIMATE.start_main_~qq~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~qq~0#1.offset_BEFORE_CALL_3|) 0)) (exists ((v_rec_~op.base_38 Int) (v_rec_~op.offset_34 Int)) (let ((.cse0 (select (select |c_#memory_int#0| v_rec_~op.base_38) v_rec_~op.offset_34))) (and (<= .cse0 0) (= (store |c_old(#memory_int#0)| v_rec_~op.base_38 (store (select |c_old(#memory_int#0)| v_rec_~op.base_38) v_rec_~op.offset_34 .cse0)) |c_#memory_int#0|) (<= |c_rec_#in~i| .cse0))))) is different from true [2024-11-09 15:28:43,676 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~qq~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~qq~0#1.offset_BEFORE_CALL_3| Int)) (<= (select (select |c_#memory_int#1| |v_ULTIMATE.start_main_~qq~0#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_main_~qq~0#1.offset_BEFORE_CALL_3|) 0)) (exists ((v_rec_~op.base_38 Int) (v_rec_~op.offset_34 Int)) (let ((.cse0 (select (select |c_#memory_int#0| v_rec_~op.base_38) v_rec_~op.offset_34))) (and (<= .cse0 0) (= (store |c_old(#memory_int#0)| v_rec_~op.base_38 (store (select |c_old(#memory_int#0)| v_rec_~op.base_38) v_rec_~op.offset_34 .cse0)) |c_#memory_int#0|) (<= |c_rec_#in~i| (+ .cse0 1)))))) is different from true [2024-11-09 15:28:43,721 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-09 15:28:43,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2024-11-09 15:28:43,813 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-09 15:28:43,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 47 [2024-11-09 15:28:43,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:28:43,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2024-11-09 15:28:43,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 15:28:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 7 not checked. [2024-11-09 15:28:43,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:44,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358557746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:44,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 15:28:44,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 24 [2024-11-09 15:28:44,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353400152] [2024-11-09 15:28:44,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:44,132 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:44,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 2 times [2024-11-09 15:28:44,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:44,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322873554] [2024-11-09 15:28:44,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:44,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:44,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:44,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:44,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:44,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 15:28:44,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=490, Unknown=2, NotChecked=90, Total=650 [2024-11-09 15:28:44,315 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 11 Second operand has 24 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 15:28:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:44,826 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-11-09 15:28:44,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 63 transitions. [2024-11-09 15:28:44,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:44,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 43 states and 54 transitions. [2024-11-09 15:28:44,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-09 15:28:44,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-09 15:28:44,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2024-11-09 15:28:44,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:44,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 54 transitions. [2024-11-09 15:28:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2024-11-09 15:28:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-09 15:28:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 30 states have internal predecessors, (30), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-09 15:28:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-09 15:28:44,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-09 15:28:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 15:28:44,834 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-09 15:28:44,834 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:28:44,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2024-11-09 15:28:44,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:44,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:44,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:44,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:28:44,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:44,836 INFO L745 eck$LassoCheckResult]: Stem: 933#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 934#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet5#1; 915#L29-3 call main_#t~mem6#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 916#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int#0(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 936#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 937#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 946#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 924#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 951#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 952#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 925#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 951#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 952#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 925#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 951#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 923#L9 assume ~i < 0;call write~int#0(1 + ~i, ~op.base, ~op.offset, 4); 926#recFINAL assume true; 953#recEXIT >#31#return; 928#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 931#recFINAL assume true; 938#recEXIT >#31#return; 939#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 949#recFINAL assume true; 945#recEXIT >#31#return; 944#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 943#recFINAL assume true; 942#recEXIT >#33#return; 927#L33-1 havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem12#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int#1(main_#t~mem11#1 + main_#t~mem12#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~mem12#1; 917#L29-3 call main_#t~mem6#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 919#L29-1 assume !!(main_#t~mem6#1 > 1);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#1(main_#t~post8#1 - 1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;call main_#t~mem9#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int#0(main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(0, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 922#L33 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem10#1);< 935#$Ultimate##0 [2024-11-09 15:28:44,836 INFO L747 eck$LassoCheckResult]: Loop: 935#$Ultimate##0 ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 920#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 921#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 935#$Ultimate##0 [2024-11-09 15:28:44,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash -129049464, now seen corresponding path program 3 times [2024-11-09 15:28:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:44,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157738695] [2024-11-09 15:28:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:44,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:44,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:44,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 3 times [2024-11-09 15:28:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:44,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048842587] [2024-11-09 15:28:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:44,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:44,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:44,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:44,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash -516851950, now seen corresponding path program 4 times [2024-11-09 15:28:44,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:44,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989464285] [2024-11-09 15:28:44,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:44,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:44,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:44,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:48,002 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:48,002 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:48,002 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:48,002 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:48,002 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:48,002 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,002 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:48,003 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:48,003 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration6_Lasso [2024-11-09 15:28:48,003 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:48,003 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:48,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:49,126 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:49,126 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:49,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,128 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-09 15:28:49,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,152 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-09 15:28:49,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,176 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-09 15:28:49,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-09 15:28:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,200 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-09 15:28:49,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,225 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-09 15:28:49,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:49,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:49,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:49,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-09 15:28:49,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,249 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-09 15:28:49,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:49,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:49,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,279 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-09 15:28:49,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:49,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:49,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-09 15:28:49,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,306 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-09 15:28:49,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:49,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:49,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:49,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:49,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,335 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-09 15:28:49,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:49,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:49,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:49,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:49,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:49,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:49,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:49,353 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:49,357 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-09 15:28:49,357 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-09 15:28:49,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:49,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,359 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-09 15:28:49,361 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:49,372 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:49,372 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:49,372 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_#in~i) = 2*rec_#in~i + 1 Supporting invariants [] [2024-11-09 15:28:49,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-09 15:28:49,387 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-09 15:28:49,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:49,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:28:49,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:49,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:28:49,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:49,695 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 15:28:49,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:28:49,740 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 48 transitions. cyclomatic complexity: 12. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 47 states and 55 transitions. Complement of second has 14 states. [2024-11-09 15:28:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:28:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2024-11-09 15:28:49,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 31 letters. Loop has 3 letters. [2024-11-09 15:28:49,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:49,741 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:28:49,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:49,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:28:49,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:49,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:28:49,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:50,021 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 15:28:50,021 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:28:50,071 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 48 transitions. cyclomatic complexity: 12. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 47 states and 55 transitions. Complement of second has 14 states. [2024-11-09 15:28:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:28:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2024-11-09 15:28:50,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 31 letters. Loop has 3 letters. [2024-11-09 15:28:50,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:50,072 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:28:50,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:50,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:28:50,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:50,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-09 15:28:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:50,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:28:50,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:50,402 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 15:28:50,403 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:28:50,460 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 48 transitions. cyclomatic complexity: 12. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 60 states and 68 transitions. Complement of second has 15 states. [2024-11-09 15:28:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:28:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2024-11-09 15:28:50,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 31 letters. Loop has 3 letters. [2024-11-09 15:28:50,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:50,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 34 letters. Loop has 3 letters. [2024-11-09 15:28:50,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:50,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 31 letters. Loop has 6 letters. [2024-11-09 15:28:50,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:50,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 68 transitions. [2024-11-09 15:28:50,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:28:50,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. [2024-11-09 15:28:50,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:28:50,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:28:50,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:28:50,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:50,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:50,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:50,466 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:50,466 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:28:50,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:28:50,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:28:50,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:28:50,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:28:50 BoogieIcfgContainer [2024-11-09 15:28:50,472 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:28:50,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:28:50,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:28:50,473 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:28:50,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:34" (3/4) ... [2024-11-09 15:28:50,474 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:28:50,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:28:50,476 INFO L158 Benchmark]: Toolchain (without parser) took 17068.32ms. Allocated memory was 163.6MB in the beginning and 314.6MB in the end (delta: 151.0MB). Free memory was 114.7MB in the beginning and 252.0MB in the end (delta: -137.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-09 15:28:50,476 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 163.6MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:50,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.40ms. Allocated memory is still 163.6MB. Free memory was 114.7MB in the beginning and 103.1MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:28:50,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.71ms. Allocated memory is still 163.6MB. Free memory was 103.1MB in the beginning and 101.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:50,476 INFO L158 Benchmark]: Boogie Preprocessor took 41.38ms. Allocated memory is still 163.6MB. Free memory was 101.6MB in the beginning and 99.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:28:50,477 INFO L158 Benchmark]: RCFGBuilder took 280.80ms. Allocated memory is still 163.6MB. Free memory was 99.6MB in the beginning and 87.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:28:50,477 INFO L158 Benchmark]: BuchiAutomizer took 16453.55ms. Allocated memory was 163.6MB in the beginning and 314.6MB in the end (delta: 151.0MB). Free memory was 87.5MB in the beginning and 253.1MB in the end (delta: -165.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:50,477 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 314.6MB. Free memory was 253.1MB in the beginning and 252.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:50,478 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.74ms. Allocated memory is still 163.6MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.40ms. Allocated memory is still 163.6MB. Free memory was 114.7MB in the beginning and 103.1MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.71ms. Allocated memory is still 163.6MB. Free memory was 103.1MB in the beginning and 101.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.38ms. Allocated memory is still 163.6MB. Free memory was 101.6MB in the beginning and 99.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 280.80ms. Allocated memory is still 163.6MB. Free memory was 99.6MB in the beginning and 87.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 16453.55ms. Allocated memory was 163.6MB in the beginning and 314.6MB in the end (delta: 151.0MB). Free memory was 87.5MB in the beginning and 253.1MB in the end (delta: -165.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 314.6MB. Free memory was 253.1MB in the beginning and 252.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~qq~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 11 locations. One deterministic module has affine ranking function (((long) 2 * \old(i)) + 1) and consists of 5 locations. One nondeterministic module has affine ranking function (((long) 2 * \old(i)) + 1) and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.4s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 12.8s. Construction of modules took 0.4s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 14/14 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 44 IncrementalHoareTripleChecker+Unchecked, 175 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 444 IncrementalHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 78 mSDtfsCounter, 444 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital238 mio100 ax100 hnf100 lsp99 ukn48 mio100 lsp39 div100 bol100 ite100 ukn100 eq139 hnf100 smp100 dnf736 smp70 tf100 neg100 sie130 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 99ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 15:28:50,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:50,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 15:28:50,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE