./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.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 99c02e26cc69c81635e61f874ccaf79837a3339fa533477441a437bf8690e003 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:19:47,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:19:47,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:19:47,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:19:47,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:19:47,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:19:47,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:19:47,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:19:47,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:19:47,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:19:47,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:19:47,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:19:47,118 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:19:47,122 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:19:47,122 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:19:47,122 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:19:47,123 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:19:47,123 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:19:47,123 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:19:47,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:19:47,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:19:47,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:19:47,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:19:47,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:19:47,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:19:47,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:19:47,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:19:47,126 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:19:47,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:19:47,127 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:19:47,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:19:47,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:19:47,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:19:47,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:19:47,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:19:47,128 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:19:47,128 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 -> 99c02e26cc69c81635e61f874ccaf79837a3339fa533477441a437bf8690e003 [2024-11-19 14:19:47,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:19:47,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:19:47,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:19:47,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:19:47,382 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:19:47,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2024-11-19 14:19:48,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:19:48,834 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:19:48,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2024-11-19 14:19:48,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f369e0e74/73f5739033204abab1fc714b82706bc0/FLAG829344068 [2024-11-19 14:19:49,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f369e0e74/73f5739033204abab1fc714b82706bc0 [2024-11-19 14:19:49,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:19:49,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:19:49,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:19:49,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:19:49,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:19:49,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e08c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49, skipping insertion in model container [2024-11-19 14:19:49,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:19:49,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:19:49,431 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:19:49,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:19:49,499 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:19:49,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49 WrapperNode [2024-11-19 14:19:49,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:19:49,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:19:49,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:19:49,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:19:49,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,530 INFO L138 Inliner]: procedures = 110, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2024-11-19 14:19:49,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:19:49,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:19:49,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:19:49,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:19:49,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,559 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-19 14:19:49,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:19:49,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:19:49,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:19:49,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:19:49,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (1/1) ... [2024-11-19 14:19:49,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:49,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:49,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:49,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:19:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:19:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:19:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:19:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:19:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:19:49,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:19:49,721 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:19:49,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:19:49,805 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-19 14:19:49,805 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:19:49,814 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:19:49,814 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 14:19:49,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:19:49 BoogieIcfgContainer [2024-11-19 14:19:49,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:19:49,815 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:19:49,815 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:19:49,818 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:19:49,819 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:19:49,819 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:19:49" (1/3) ... [2024-11-19 14:19:49,820 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b48f8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:19:49, skipping insertion in model container [2024-11-19 14:19:49,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:19:49,820 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:49" (2/3) ... [2024-11-19 14:19:49,821 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b48f8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:19:49, skipping insertion in model container [2024-11-19 14:19:49,821 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:19:49,821 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:19:49" (3/3) ... [2024-11-19 14:19:49,822 INFO L332 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-2.i [2024-11-19 14:19:49,862 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:19:49,863 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:19:49,863 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:19:49,863 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:19:49,863 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:19:49,863 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:19:49,863 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:19:49,863 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:19:49,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:49,879 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-19 14:19:49,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:49,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:49,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:19:49,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:19:49,887 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:19:49,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:49,889 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-19 14:19:49,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:49,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:49,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:19:49,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:19:49,898 INFO L745 eck$LassoCheckResult]: Stem: 14#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 16#L551true assume !(main_~length~0#1 < 1); 10#L551-2true call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 8#L553true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15#L554-3true [2024-11-19 14:19:49,903 INFO L747 eck$LassoCheckResult]: Loop: 15#L554-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3#L556true assume main_~val~0#1 < 0;main_~val~0#1 := 0; 4#L556-2true call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L554-2true main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15#L554-3true [2024-11-19 14:19:49,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:49,910 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2024-11-19 14:19:49,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:49,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777130520] [2024-11-19 14:19:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:50,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:50,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:50,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2024-11-19 14:19:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722046690] [2024-11-19 14:19:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:50,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:50,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:50,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:50,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2024-11-19 14:19:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:50,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392221146] [2024-11-19 14:19:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:50,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:50,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:50,390 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:50,390 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:50,391 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:50,391 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:50,391 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:50,391 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,391 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:50,391 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:50,391 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration1_Lasso [2024-11-19 14:19:50,392 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:50,392 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:50,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,775 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:50,778 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:50,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:19:50,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-19 14:19:50,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:19:50,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:19:50,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:50,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:19:50,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 14:19:50,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:19:50,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-19 14:19:50,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:19:50,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,917 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:19:50,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:50,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:50,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:19:50,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:19:50,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:50,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:50,991 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:51,054 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-19 14:19:51,054 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-19 14:19:51,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:51,077 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:51,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:19:51,080 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:51,090 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:51,090 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:51,091 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:19:51,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:51,128 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2024-11-19 14:19:51,137 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:19:51,137 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:19:51,140 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-11-19 14:19:51,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:51,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:19:51,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:51,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:19:51,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:51,328 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-19 14:19:51,330 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:51,390 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 48 transitions. Complement of second has 9 states. [2024-11-19 14:19:51,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2024-11-19 14:19:51,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-19 14:19:51,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:51,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-19 14:19:51,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:51,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 5 letters. Loop has 8 letters. [2024-11-19 14:19:51,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:51,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 48 transitions. [2024-11-19 14:19:51,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:19:51,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 15 states and 21 transitions. [2024-11-19 14:19:51,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:19:51,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-19 14:19:51,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2024-11-19 14:19:51,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:19:51,408 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-19 14:19:51,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2024-11-19 14:19:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-19 14:19:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2024-11-19 14:19:51,457 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-19 14:19:51,460 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-11-19 14:19:51,460 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:19:51,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2024-11-19 14:19:51,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:19:51,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:51,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:51,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:51,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:19:51,461 INFO L745 eck$LassoCheckResult]: Stem: 139#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 131#L551 assume !(main_~length~0#1 < 1); 135#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 133#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 134#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 132#L554-4 main_~j~0#1 := 0; 129#L561-3 [2024-11-19 14:19:51,462 INFO L747 eck$LassoCheckResult]: Loop: 129#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 137#L562-3 assume !true; 128#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 129#L561-3 [2024-11-19 14:19:51,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2024-11-19 14:19:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409105168] [2024-11-19 14:19:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409105168] [2024-11-19 14:19:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409105168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:51,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:51,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:19:51,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771971422] [2024-11-19 14:19:51,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:51,613 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:19:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash 72876, now seen corresponding path program 1 times [2024-11-19 14:19:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671545547] [2024-11-19 14:19:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:51,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:51,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671545547] [2024-11-19 14:19:51,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671545547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:51,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:51,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:19:51,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508944661] [2024-11-19 14:19:51,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:51,620 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:19:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:19:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:19:51,623 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:51,629 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-11-19 14:19:51,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2024-11-19 14:19:51,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:19:51,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2024-11-19 14:19:51,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:19:51,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-19 14:19:51,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-11-19 14:19:51,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:19:51,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-19 14:19:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-11-19 14:19:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-19 14:19:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-11-19 14:19:51,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-19 14:19:51,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:19:51,636 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-19 14:19:51,637 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:19:51,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-11-19 14:19:51,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:19:51,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:51,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:51,637 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:51,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:19:51,638 INFO L745 eck$LassoCheckResult]: Stem: 176#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 167#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 168#L551 assume !(main_~length~0#1 < 1); 172#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 170#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 171#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 169#L554-4 main_~j~0#1 := 0; 166#L561-3 [2024-11-19 14:19:51,638 INFO L747 eck$LassoCheckResult]: Loop: 166#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 174#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 173#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 165#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 166#L561-3 [2024-11-19 14:19:51,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 2 times [2024-11-19 14:19:51,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115772805] [2024-11-19 14:19:51,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:51,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,650 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:51,650 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:51,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:51,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115772805] [2024-11-19 14:19:51,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115772805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:51,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:51,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:19:51,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551772874] [2024-11-19 14:19:51,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:51,689 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:19:51,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2024-11-19 14:19:51,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239748411] [2024-11-19 14:19:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:51,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:51,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:51,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:19:51,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:19:51,758 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:51,780 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-19 14:19:51,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2024-11-19 14:19:51,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:19:51,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2024-11-19 14:19:51,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:19:51,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-19 14:19:51,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2024-11-19 14:19:51,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:19:51,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-19 14:19:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2024-11-19 14:19:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2024-11-19 14:19:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-11-19 14:19:51,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-19 14:19:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:19:51,783 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-19 14:19:51,783 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:19:51,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-11-19 14:19:51,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:19:51,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:51,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:51,784 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:51,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:19:51,785 INFO L745 eck$LassoCheckResult]: Stem: 216#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 209#L551 assume !(main_~length~0#1 < 1); 214#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 210#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 211#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 202#L556 assume !(main_~val~0#1 < 0); 203#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 204#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 215#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 207#L554-4 main_~j~0#1 := 0; 206#L561-3 [2024-11-19 14:19:51,785 INFO L747 eck$LassoCheckResult]: Loop: 206#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 213#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 212#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 205#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 206#L561-3 [2024-11-19 14:19:51,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2024-11-19 14:19:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892609210] [2024-11-19 14:19:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:51,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2024-11-19 14:19:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884783404] [2024-11-19 14:19:51,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,821 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:51,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:51,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:51,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2024-11-19 14:19:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914519052] [2024-11-19 14:19:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:52,009 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:52,010 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:52,010 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:52,010 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:52,010 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:52,010 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:52,010 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:52,010 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:52,010 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration4_Lasso [2024-11-19 14:19:52,010 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:52,010 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:52,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:52,273 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:52,274 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:52,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:52,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:52,276 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:52,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:19:52,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-19 14:19:52,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:52,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:52,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:52,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:52,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:52,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:52,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:52,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:52,301 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-19 14:19:52,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:52,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:52,302 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:52,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:19:52,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:52,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:52,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:52,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:52,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:52,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:52,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:52,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:52,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:52,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 14:19:52,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:52,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:52,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:52,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:19:52,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:52,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:52,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:52,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:52,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:52,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:52,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:52,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:52,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:52,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 14:19:52,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:52,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:52,353 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:52,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:19:52,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:52,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:52,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:52,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:52,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:52,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:52,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:52,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:52,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:52,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:19:52,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:52,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:52,380 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:52,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:19:52,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:52,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:52,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:52,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:52,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:52,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:52,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:52,405 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:52,422 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-19 14:19:52,423 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-19 14:19:52,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:52,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:52,424 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:52,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:19:52,429 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:52,440 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:52,440 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:52,440 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_2, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~j~0#1) = 2*v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_2 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-19 14:19:52,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:52,459 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2024-11-19 14:19:52,461 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:19:52,461 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:19:52,461 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-11-19 14:19:52,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:52,513 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-19 14:19:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:52,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:19:52,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:52,597 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:19:52,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:52,665 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-19 14:19:52,665 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:52,701 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 27 transitions. Complement of second has 7 states. [2024-11-19 14:19:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2024-11-19 14:19:52,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-19 14:19:52,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:52,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2024-11-19 14:19:52,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:52,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2024-11-19 14:19:52,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:52,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2024-11-19 14:19:52,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:52,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2024-11-19 14:19:52,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:19:52,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-19 14:19:52,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-11-19 14:19:52,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:52,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-19 14:19:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-11-19 14:19:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-19 14:19:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-11-19 14:19:52,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-19 14:19:52,706 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-19 14:19:52,706 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:19:52,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2024-11-19 14:19:52,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:52,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:52,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:52,707 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:52,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:52,708 INFO L745 eck$LassoCheckResult]: Stem: 341#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 329#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 330#L551 assume !(main_~length~0#1 < 1); 335#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 333#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 334#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 324#L556 assume !(main_~val~0#1 < 0); 325#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 326#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 340#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 331#L554-4 main_~j~0#1 := 0; 332#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 337#L562-3 [2024-11-19 14:19:52,708 INFO L747 eck$LassoCheckResult]: Loop: 337#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 336#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 337#L562-3 [2024-11-19 14:19:52,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2024-11-19 14:19:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:52,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745615744] [2024-11-19 14:19:52,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:52,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:52,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:52,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:52,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:52,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2024-11-19 14:19:52,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:52,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298605122] [2024-11-19 14:19:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:52,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:52,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:52,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:52,735 INFO L85 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2024-11-19 14:19:52,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:52,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790327036] [2024-11-19 14:19:52,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:52,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:52,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:52,907 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:52,907 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:52,907 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:52,907 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:52,907 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:52,907 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:52,908 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:52,908 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:52,908 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration5_Lasso [2024-11-19 14:19:52,908 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:52,908 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:52,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:53,210 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:53,210 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:53,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:53,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:53,214 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:53,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:19:53,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:53,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:53,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:53,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:53,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:53,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:53,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:53,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:53,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:19:53,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:53,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:53,249 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:53,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:19:53,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:53,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:53,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:53,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:53,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:53,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:53,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:53,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:53,287 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-19 14:19:53,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:53,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:53,290 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:53,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:19:53,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:53,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:53,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:53,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:53,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:53,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:53,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:53,308 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:53,322 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-19 14:19:53,323 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:19:53,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:53,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:53,324 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:53,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:19:53,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:53,336 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:53,337 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:53,337 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 0)_2 Supporting invariants [] [2024-11-19 14:19:53,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:19:53,353 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-11-19 14:19:53,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:19:53,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:19:53,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:19:53,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:53,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:19:53,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:53,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:19:53,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:53,477 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-19 14:19:53,478 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:53,520 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 35 transitions. Complement of second has 9 states. [2024-11-19 14:19:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-11-19 14:19:53,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2024-11-19 14:19:53,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:53,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2024-11-19 14:19:53,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:53,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-19 14:19:53,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:53,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-11-19 14:19:53,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:53,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2024-11-19 14:19:53,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:19:53,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:19:53,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2024-11-19 14:19:53,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:53,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-19 14:19:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2024-11-19 14:19:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-19 14:19:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-19 14:19:53,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-19 14:19:53,526 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-19 14:19:53,526 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:19:53,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-11-19 14:19:53,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:53,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:53,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:53,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:53,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:53,527 INFO L745 eck$LassoCheckResult]: Stem: 478#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 466#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 467#L551 assume !(main_~length~0#1 < 1); 472#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 470#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 471#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 461#L556 assume !(main_~val~0#1 < 0); 462#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 463#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 477#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 468#L554-4 main_~j~0#1 := 0; 469#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 476#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 481#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 464#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 465#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 474#L562-3 [2024-11-19 14:19:53,527 INFO L747 eck$LassoCheckResult]: Loop: 474#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 473#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 474#L562-3 [2024-11-19 14:19:53,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:53,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2024-11-19 14:19:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532288781] [2024-11-19 14:19:53,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:53,535 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:19:53,536 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:53,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:19:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:53,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:53,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532288781] [2024-11-19 14:19:53,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532288781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:19:53,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366867055] [2024-11-19 14:19:53,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:19:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:53,622 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:19:53,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 14:19:53,659 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:19:53,659 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:53,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:19:53,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:53,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:19:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366867055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:19:53,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:19:53,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-19 14:19:53,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141438581] [2024-11-19 14:19:53,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:19:53,741 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:19:53,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:53,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2024-11-19 14:19:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:53,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599320530] [2024-11-19 14:19:53,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:53,745 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:53,746 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:53,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:53,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:53,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:53,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 14:19:53,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-19 14:19:53,775 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:53,852 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-11-19 14:19:53,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2024-11-19 14:19:53,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:53,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 28 states and 35 transitions. [2024-11-19 14:19:53,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:19:53,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:19:53,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2024-11-19 14:19:53,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:53,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-19 14:19:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2024-11-19 14:19:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-11-19 14:19:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-19 14:19:53,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-19 14:19:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:19:53,857 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-19 14:19:53,857 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:19:53,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2024-11-19 14:19:53,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:53,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:53,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:53,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:53,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:53,858 INFO L745 eck$LassoCheckResult]: Stem: 655#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 642#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 643#L551 assume !(main_~length~0#1 < 1); 648#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 646#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 647#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 656#L556 assume !(main_~val~0#1 < 0); 661#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 653#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 654#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 637#L556 assume !(main_~val~0#1 < 0); 638#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 639#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 660#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 644#L554-4 main_~j~0#1 := 0; 645#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 652#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 659#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 640#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 641#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 650#L562-3 [2024-11-19 14:19:53,858 INFO L747 eck$LassoCheckResult]: Loop: 650#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 649#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 650#L562-3 [2024-11-19 14:19:53,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:53,859 INFO L85 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2024-11-19 14:19:53,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:53,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542756961] [2024-11-19 14:19:53,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:19:53,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:53,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 14:19:53,876 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:53,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:53,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:53,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2024-11-19 14:19:53,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:53,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050671635] [2024-11-19 14:19:53,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:19:53,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:53,892 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:19:53,892 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:53,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:53,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:53,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:53,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2024-11-19 14:19:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:53,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547221883] [2024-11-19 14:19:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:53,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:53,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:54,125 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:54,125 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:54,126 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:54,126 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:54,126 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:54,126 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:54,126 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:54,126 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:54,126 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration7_Lasso [2024-11-19 14:19:54,126 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:54,126 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:54,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:54,401 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:54,401 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:54,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:54,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:54,403 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:54,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:19:54,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:54,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:54,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:54,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:54,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:54,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:54,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:54,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:54,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:54,430 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-19 14:19:54,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:54,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:54,432 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:54,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:19:54,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:54,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:54,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:54,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:54,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:54,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:54,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:54,452 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:54,460 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-19 14:19:54,460 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:19:54,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:54,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:54,462 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:54,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:19:54,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:54,475 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:54,475 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:54,475 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1 Supporting invariants [] [2024-11-19 14:19:54,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:54,499 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 14:19:54,500 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:19:54,501 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:19:54,501 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:19:54,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:54,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:54,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:54,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:19:54,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:54,627 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-19 14:19:54,627 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:54,681 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 5 states. [2024-11-19 14:19:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:19:54,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-19 14:19:54,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:54,683 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:54,693 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-19 14:19:54,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:54,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:54,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:54,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:19:54,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:54,814 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-19 14:19:54,814 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:54,833 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 5 states. [2024-11-19 14:19:54,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:19:54,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-19 14:19:54,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:54,834 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:54,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:54,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:54,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:54,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:19:54,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:54,965 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-19 14:19:54,966 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:55,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 50 transitions. Complement of second has 11 states. [2024-11-19 14:19:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:19:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2024-11-19 14:19:55,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-19 14:19:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 22 letters. Loop has 2 letters. [2024-11-19 14:19:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 4 letters. [2024-11-19 14:19:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:55,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. [2024-11-19 14:19:55,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:55,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 43 transitions. [2024-11-19 14:19:55,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:19:55,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:19:55,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 43 transitions. [2024-11-19 14:19:55,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:55,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-19 14:19:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 43 transitions. [2024-11-19 14:19:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2024-11-19 14:19:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-19 14:19:55,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-19 14:19:55,030 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-19 14:19:55,030 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:19:55,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2024-11-19 14:19:55,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:55,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:55,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:55,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:55,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:55,031 INFO L745 eck$LassoCheckResult]: Stem: 1056#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1044#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1045#L551 assume !(main_~length~0#1 < 1); 1054#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1048#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1049#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1039#L556 assume !(main_~val~0#1 < 0); 1040#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1041#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1055#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1057#L556 assume !(main_~val~0#1 < 0); 1064#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1063#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1062#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 1046#L554-4 main_~j~0#1 := 0; 1047#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1058#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1066#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1065#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1059#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1053#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1068#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1042#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1043#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1051#L562-3 [2024-11-19 14:19:55,031 INFO L747 eck$LassoCheckResult]: Loop: 1051#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1050#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1051#L562-3 [2024-11-19 14:19:55,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1808436561, now seen corresponding path program 4 times [2024-11-19 14:19:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:55,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528048224] [2024-11-19 14:19:55,032 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:19:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:55,038 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:19:55,038 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528048224] [2024-11-19 14:19:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528048224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:19:55,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868148043] [2024-11-19 14:19:55,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:19:55,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:19:55,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:55,107 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:19:55,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-19 14:19:55,144 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:19:55,144 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:55,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:19:55,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:55,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:19:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868148043] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:19:55,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:19:55,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-19 14:19:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502547382] [2024-11-19 14:19:55,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:19:55,253 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:19:55,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 4 times [2024-11-19 14:19:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:55,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119187395] [2024-11-19 14:19:55,253 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:19:55,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:55,257 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:19:55,257 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:55,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:55,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:55,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 14:19:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-19 14:19:55,287 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:55,350 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-11-19 14:19:55,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2024-11-19 14:19:55,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:55,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 46 transitions. [2024-11-19 14:19:55,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:19:55,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:19:55,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2024-11-19 14:19:55,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:55,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-19 14:19:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2024-11-19 14:19:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-19 14:19:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-19 14:19:55,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-19 14:19:55,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 14:19:55,354 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-19 14:19:55,354 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:19:55,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2024-11-19 14:19:55,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:55,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:55,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:55,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:55,355 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:55,355 INFO L745 eck$LassoCheckResult]: Stem: 1290#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1279#L551 assume !(main_~length~0#1 < 1); 1284#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1282#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1283#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1291#L556 assume !(main_~val~0#1 < 0); 1306#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1305#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1292#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1273#L556 assume !(main_~val~0#1 < 0); 1274#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1275#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1289#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1298#L556 assume !(main_~val~0#1 < 0); 1304#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1299#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1297#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 1280#L554-4 main_~j~0#1 := 0; 1281#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1293#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1301#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1300#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1294#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1288#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1303#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1276#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1277#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1286#L562-3 [2024-11-19 14:19:55,355 INFO L747 eck$LassoCheckResult]: Loop: 1286#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1285#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1286#L562-3 [2024-11-19 14:19:55,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:55,355 INFO L85 PathProgramCache]: Analyzing trace with hash -759828824, now seen corresponding path program 5 times [2024-11-19 14:19:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:55,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363785500] [2024-11-19 14:19:55,356 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:19:55,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:55,366 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-19 14:19:55,366 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:55,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:55,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:55,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:55,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 5 times [2024-11-19 14:19:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426025108] [2024-11-19 14:19:55,379 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:19:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:55,381 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:55,382 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:55,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:55,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:55,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash -51058003, now seen corresponding path program 2 times [2024-11-19 14:19:55,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:55,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592710372] [2024-11-19 14:19:55,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:55,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:55,395 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:19:55,395 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:55,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:55,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:55,785 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:55,785 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:55,785 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:55,785 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:55,785 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:55,785 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:55,785 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:55,786 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:55,786 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration9_Lasso [2024-11-19 14:19:55,786 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:55,786 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:55,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:56,138 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:56,139 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:56,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,143 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:19:56,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,166 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-19 14:19:56,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,168 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:19:56,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,192 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-19 14:19:56,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,194 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:19:56,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,216 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-19 14:19:56,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,218 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:19:56,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,240 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-19 14:19:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,242 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:19:56,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,265 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-19 14:19:56,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,267 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:19:56,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,293 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 14:19:56,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:56,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:56,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,340 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:19:56,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:56,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:56,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,364 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-19 14:19:56,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,366 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:19:56,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,390 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-19 14:19:56,391 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-19 14:19:56,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,415 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:19:56,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,438 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-19 14:19:56,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,440 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:19:56,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,465 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-19 14:19:56,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,490 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-19 14:19:56,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:56,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:56,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,518 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-19 14:19:56,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,520 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-19 14:19:56,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:56,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:56,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-19 14:19:56,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,551 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-19 14:19:56,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:56,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:56,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,577 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-19 14:19:56,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:56,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:56,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-19 14:19:56,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,605 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-19 14:19:56,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:56,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:56,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:56,633 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-19 14:19:56,633 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:19:56,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,634 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:56,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-19 14:19:56,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:56,649 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:56,649 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:56,649 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1 Supporting invariants [] [2024-11-19 14:19:56,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,679 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-11-19 14:19:56,681 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:19:56,681 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:19:56,681 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:19:56,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:56,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:19:56,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:56,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:19:56,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:56,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:56,833 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-19 14:19:56,834 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:56,852 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 4 states. [2024-11-19 14:19:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:19:56,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 28 letters. Loop has 2 letters. [2024-11-19 14:19:56,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:56,854 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:56,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:56,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:19:56,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:56,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:19:56,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:56,973 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-19 14:19:56,973 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:56,991 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 4 states. [2024-11-19 14:19:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:19:56,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 28 letters. Loop has 2 letters. [2024-11-19 14:19:56,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:56,994 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:57,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:57,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:19:57,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:57,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:19:57,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:57,120 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-19 14:19:57,120 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:57,194 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 63 transitions. Complement of second has 12 states. [2024-11-19 14:19:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:19:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2024-11-19 14:19:57,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 28 letters. Loop has 2 letters. [2024-11-19 14:19:57,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:57,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 30 letters. Loop has 2 letters. [2024-11-19 14:19:57,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:57,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-19 14:19:57,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:57,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 63 transitions. [2024-11-19 14:19:57,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:57,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 45 states and 56 transitions. [2024-11-19 14:19:57,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:19:57,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:19:57,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2024-11-19 14:19:57,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:57,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-11-19 14:19:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2024-11-19 14:19:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-11-19 14:19:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-11-19 14:19:57,202 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-19 14:19:57,202 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-19 14:19:57,202 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:19:57,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2024-11-19 14:19:57,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:57,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:57,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:57,207 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:57,207 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:57,207 INFO L745 eck$LassoCheckResult]: Stem: 1799#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1789#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1790#L551 assume !(main_~length~0#1 < 1); 1797#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1791#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1792#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1782#L556 assume !(main_~val~0#1 < 0); 1783#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1784#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1798#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1800#L556 assume !(main_~val~0#1 < 0); 1810#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1809#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1808#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1805#L556 assume !(main_~val~0#1 < 0); 1807#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1806#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1804#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 1787#L554-4 main_~j~0#1 := 0; 1788#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1796#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1813#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1785#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1786#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1801#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1819#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1818#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1817#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1816#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1814#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1812#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1811#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 1794#L562-3 [2024-11-19 14:19:57,207 INFO L747 eck$LassoCheckResult]: Loop: 1794#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1793#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1794#L562-3 [2024-11-19 14:19:57,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1822100739, now seen corresponding path program 6 times [2024-11-19 14:19:57,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:57,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957445493] [2024-11-19 14:19:57,208 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:19:57,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:57,226 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-11-19 14:19:57,227 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:57,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957445493] [2024-11-19 14:19:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957445493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:19:57,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870803414] [2024-11-19 14:19:57,320 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:19:57,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:19:57,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:57,322 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:19:57,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-19 14:19:57,376 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-11-19 14:19:57,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:57,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:57,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:57,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:19:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870803414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:19:57,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:19:57,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-19 14:19:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233846630] [2024-11-19 14:19:57,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:19:57,540 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:19:57,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 6 times [2024-11-19 14:19:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:57,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018874769] [2024-11-19 14:19:57,541 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:19:57,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:57,544 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:19:57,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:57,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:57,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:57,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:57,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 14:19:57,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-19 14:19:57,582 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. cyclomatic complexity: 15 Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:57,666 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-19 14:19:57,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2024-11-19 14:19:57,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:57,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 46 states and 57 transitions. [2024-11-19 14:19:57,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:19:57,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:19:57,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 57 transitions. [2024-11-19 14:19:57,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:57,668 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-11-19 14:19:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 57 transitions. [2024-11-19 14:19:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-11-19 14:19:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-11-19 14:19:57,670 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-11-19 14:19:57,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 14:19:57,671 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-11-19 14:19:57,671 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:19:57,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 53 transitions. [2024-11-19 14:19:57,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:57,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:57,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:57,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:57,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:57,672 INFO L745 eck$LassoCheckResult]: Stem: 2109#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2097#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2098#L551 assume !(main_~length~0#1 < 1); 2105#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 2099#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2100#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2108#L556 assume !(main_~val~0#1 < 0); 2130#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2106#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2107#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2090#L556 assume !(main_~val~0#1 < 0); 2091#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2092#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2127#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2126#L556 assume !(main_~val~0#1 < 0); 2125#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2124#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2123#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2114#L556 assume !(main_~val~0#1 < 0); 2119#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2116#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2113#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 2095#L554-4 main_~j~0#1 := 0; 2096#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2110#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2120#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2121#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2128#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2129#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2131#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2093#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2094#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2104#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2118#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2117#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2115#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2102#L562-3 [2024-11-19 14:19:57,673 INFO L747 eck$LassoCheckResult]: Loop: 2102#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2101#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 2102#L562-3 [2024-11-19 14:19:57,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1774872054, now seen corresponding path program 7 times [2024-11-19 14:19:57,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:57,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159113413] [2024-11-19 14:19:57,673 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:19:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:57,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:57,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:57,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 7 times [2024-11-19 14:19:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:57,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017231050] [2024-11-19 14:19:57,698 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:19:57,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:57,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:57,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:57,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:57,702 INFO L85 PathProgramCache]: Analyzing trace with hash 550028923, now seen corresponding path program 3 times [2024-11-19 14:19:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:57,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684752696] [2024-11-19 14:19:57,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:19:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:57,722 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 14:19:57,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:57,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:57,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:58,354 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:58,354 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:58,354 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:58,354 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:58,354 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:58,354 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,355 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:58,355 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:58,355 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration11_Lasso [2024-11-19 14:19:58,355 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:58,355 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:58,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:58,724 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:58,725 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:58,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:58,732 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:58,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-19 14:19:58,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:58,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:58,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:58,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:58,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:58,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:58,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:58,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:58,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:58,760 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-19 14:19:58,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:58,762 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:58,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-19 14:19:58,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:58,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:58,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:58,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:58,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:58,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:58,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:58,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:58,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:58,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:58,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:58,787 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-19 14:19:58,789 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-19 14:19:58,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:58,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:58,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:58,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:58,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:58,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:58,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:58,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:58,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:58,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-19 14:19:58,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:58,814 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-19 14:19:58,815 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-19 14:19:58,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:58,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:58,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:58,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:58,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:58,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:58,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:58,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:58,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:58,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:58,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:58,841 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-19 14:19:58,842 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-19 14:19:58,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:58,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:58,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:58,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:58,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:58,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:58,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:58,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:58,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-19 14:19:58,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:58,885 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-19 14:19:58,890 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-19 14:19:58,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:58,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:58,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:58,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:58,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:58,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:58,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:58,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:58,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:58,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:58,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:58,915 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-19 14:19:58,916 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-19 14:19:58,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:58,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:58,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:58,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:58,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:58,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:58,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:58,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:58,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:58,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:58,942 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:58,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-19 14:19:58,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:58,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:58,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:58,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:58,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:58,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:58,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:58,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:58,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:58,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-19 14:19:58,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:58,971 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:58,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-19 14:19:58,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:58,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:58,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:58,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:58,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:58,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:58,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:58,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:58,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:58,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:58,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:58,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:58,997 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:58,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-19 14:19:58,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:59,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:59,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:59,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:59,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:59,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:59,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:59,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:59,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:59,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:59,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:59,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:59,021 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:59,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-19 14:19:59,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:59,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:59,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:59,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:59,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:59,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:59,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:59,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:59,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:59,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-19 14:19:59,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:59,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:59,046 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:59,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-19 14:19:59,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:59,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:59,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:59,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:59,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:59,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:59,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:59,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:59,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:59,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-19 14:19:59,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:59,071 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:59,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-19 14:19:59,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:59,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:59,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:59,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:59,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:59,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:59,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:59,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:59,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:59,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:59,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:59,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:59,097 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:59,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-19 14:19:59,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:59,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:59,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:59,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:59,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:59,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:59,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:59,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:59,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:59,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:59,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:59,125 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:59,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-19 14:19:59,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:59,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:59,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:59,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:59,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:59,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:59,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:59,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:59,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:59,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:59,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:59,153 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:59,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-19 14:19:59,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:59,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:59,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:59,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:59,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:59,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:59,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:59,168 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:59,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:59,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:59,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:59,179 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:59,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-19 14:19:59,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:59,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:59,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:59,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:59,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:59,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:59,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:59,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:59,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:59,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:59,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:59,231 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:59,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-19 14:19:59,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:59,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:59,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:59,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:59,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:59,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:59,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:59,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:59,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:59,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:59,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:59,261 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:59,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-19 14:19:59,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:59,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:59,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:59,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:59,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:59,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:59,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:59,279 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:59,289 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:19:59,289 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:19:59,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:59,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:59,290 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:59,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-19 14:19:59,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:59,303 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:59,303 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:59,303 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1 Supporting invariants [] [2024-11-19 14:19:59,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:59,325 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-11-19 14:19:59,326 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:19:59,327 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:19:59,327 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:19:59,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:59,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:59,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:59,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:19:59,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:59,495 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-19 14:19:59,495 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:59,521 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 55 transitions. Complement of second has 4 states. [2024-11-19 14:19:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:19:59,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 36 letters. Loop has 2 letters. [2024-11-19 14:19:59,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:59,527 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:59,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:59,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:59,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:59,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:59,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:19:59,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:59,704 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-19 14:19:59,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:59,721 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 55 transitions. Complement of second has 4 states. [2024-11-19 14:19:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:19:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:19:59,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 36 letters. Loop has 2 letters. [2024-11-19 14:19:59,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:59,722 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:59,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:59,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:59,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:59,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:19:59,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:59,841 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-19 14:19:59,841 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:59,923 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 76 transitions. Complement of second has 14 states. [2024-11-19 14:19:59,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:19:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2024-11-19 14:19:59,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 36 letters. Loop has 2 letters. [2024-11-19 14:19:59,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:59,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 38 letters. Loop has 2 letters. [2024-11-19 14:19:59,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:59,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 36 letters. Loop has 4 letters. [2024-11-19 14:19:59,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:59,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2024-11-19 14:19:59,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:59,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 55 states and 69 transitions. [2024-11-19 14:19:59,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:19:59,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:19:59,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 69 transitions. [2024-11-19 14:19:59,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:59,926 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-11-19 14:19:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 69 transitions. [2024-11-19 14:19:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2024-11-19 14:19:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 47 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:19:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-19 14:19:59,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-19 14:19:59,928 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-19 14:19:59,928 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 14:19:59,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 59 transitions. [2024-11-19 14:19:59,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:59,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:59,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:59,929 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:19:59,929 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:59,929 INFO L745 eck$LassoCheckResult]: Stem: 2736#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2723#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2724#L551 assume !(main_~length~0#1 < 1); 2733#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 2727#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2728#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2737#L556 assume !(main_~val~0#1 < 0); 2749#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2734#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2735#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2718#L556 assume !(main_~val~0#1 < 0); 2719#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2720#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2748#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2747#L556 assume !(main_~val~0#1 < 0); 2746#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2745#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2744#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2741#L556 assume !(main_~val~0#1 < 0); 2743#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2742#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2740#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 2725#L554-4 main_~j~0#1 := 0; 2726#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2732#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2739#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2721#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2722#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2738#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2764#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2763#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2762#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2760#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2759#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2758#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2757#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2756#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2753#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2752#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2750#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 2730#L562-3 [2024-11-19 14:19:59,929 INFO L747 eck$LassoCheckResult]: Loop: 2730#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2729#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 2730#L562-3 [2024-11-19 14:19:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash 296817483, now seen corresponding path program 8 times [2024-11-19 14:19:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:59,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339135698] [2024-11-19 14:19:59,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:59,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:59,937 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:19:59,937 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339135698] [2024-11-19 14:20:00,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339135698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:00,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919328349] [2024-11-19 14:20:00,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:00,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:00,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:00,053 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:00,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2024-11-19 14:20:00,145 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:20:00,145 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:00,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:20:00,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:00,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919328349] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:00,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:00,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-11-19 14:20:00,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204507303] [2024-11-19 14:20:00,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:00,339 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:00,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 8 times [2024-11-19 14:20:00,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:00,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191731646] [2024-11-19 14:20:00,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:00,345 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:20:00,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:00,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:00,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:00,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 14:20:00,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-19 14:20:00,375 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. cyclomatic complexity: 18 Second operand has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:00,475 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2024-11-19 14:20:00,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 94 transitions. [2024-11-19 14:20:00,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:00,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 55 states and 68 transitions. [2024-11-19 14:20:00,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:20:00,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:20:00,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 68 transitions. [2024-11-19 14:20:00,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:00,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-11-19 14:20:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 68 transitions. [2024-11-19 14:20:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-11-19 14:20:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 51 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-11-19 14:20:00,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-11-19 14:20:00,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 14:20:00,479 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-11-19 14:20:00,479 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-19 14:20:00,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 64 transitions. [2024-11-19 14:20:00,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:00,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:00,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:00,480 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:00,480 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:00,480 INFO L745 eck$LassoCheckResult]: Stem: 3117#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3106#L551 assume !(main_~length~0#1 < 1); 3115#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 3109#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3110#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3100#L556 assume !(main_~val~0#1 < 0); 3101#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3102#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3116#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3118#L556 assume !(main_~val~0#1 < 0); 3151#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3150#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3149#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3148#L556 assume !(main_~val~0#1 < 0); 3147#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3146#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3145#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3144#L556 assume !(main_~val~0#1 < 0); 3143#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3142#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3141#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3122#L556 assume !(main_~val~0#1 < 0); 3128#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3125#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3121#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 3107#L554-4 main_~j~0#1 := 0; 3108#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3114#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3120#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3103#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3104#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3119#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3139#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3138#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3137#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3135#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3134#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3133#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3132#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3131#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3127#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3126#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3123#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3112#L562-3 [2024-11-19 14:20:00,480 INFO L747 eck$LassoCheckResult]: Loop: 3112#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3111#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 3112#L562-3 [2024-11-19 14:20:00,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1662287172, now seen corresponding path program 9 times [2024-11-19 14:20:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:00,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509897147] [2024-11-19 14:20:00,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:20:00,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:00,501 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 14:20:00,501 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:00,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:00,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:00,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 9 times [2024-11-19 14:20:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:00,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930438857] [2024-11-19 14:20:00,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:20:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:00,515 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:20:00,515 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:00,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:00,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:00,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:00,518 INFO L85 PathProgramCache]: Analyzing trace with hash -269860279, now seen corresponding path program 4 times [2024-11-19 14:20:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:00,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58398096] [2024-11-19 14:20:00,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:00,531 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:00,531 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:00,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:00,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:01,276 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:20:01,276 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:20:01,277 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:20:01,277 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:20:01,277 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:20:01,277 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,277 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:20:01,277 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:20:01,277 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration13_Lasso [2024-11-19 14:20:01,277 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:20:01,277 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:20:01,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:01,680 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:20:01,681 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:20:01,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,682 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-19 14:20:01,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:01,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:01,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:01,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:01,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,708 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-19 14:20:01,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:01,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:01,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:01,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:01,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,734 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-19 14:20:01,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:01,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:01,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:01,747 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:01,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,759 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-19 14:20:01,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:01,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:01,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-11-19 14:20:01,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,785 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-19 14:20:01,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:01,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:01,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:01,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,813 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-19 14:20:01,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:01,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:01,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:01,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:01,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,838 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-19 14:20:01,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:01,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:01,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:01,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:01,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,862 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-19 14:20:01,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:01,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:01,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:01,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:01,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,887 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-19 14:20:01,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:01,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:01,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:01,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:01,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,911 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-19 14:20:01,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:01,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:01,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-11-19 14:20:01,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,938 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-19 14:20:01,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:01,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:01,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-11-19 14:20:01,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,966 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:01,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-19 14:20:01,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:01,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:01,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:01,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:01,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:01,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:01,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:01,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:01,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:01,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:01,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:01,996 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:02,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-19 14:20:02,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:02,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:02,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:02,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:02,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:02,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:02,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:02,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:02,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:02,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:02,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:02,043 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:02,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-11-19 14:20:02,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:02,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:02,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:02,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:02,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:02,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:02,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:02,061 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:20:02,072 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:20:02,072 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:20:02,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:02,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:02,074 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:02,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-11-19 14:20:02,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:20:02,085 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:20:02,085 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:20:02,085 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-11-19 14:20:02,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:02,108 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-11-19 14:20:02,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:20:02,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:20:02,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:20:02,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:02,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:20:02,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:02,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:02,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:02,250 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-19 14:20:02,250 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:02,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 66 transitions. Complement of second has 4 states. [2024-11-19 14:20:02,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:20:02,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 44 letters. Loop has 2 letters. [2024-11-19 14:20:02,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:02,269 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:02,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:02,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:20:02,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:02,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:02,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:02,414 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-19 14:20:02,414 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:02,430 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 66 transitions. Complement of second has 4 states. [2024-11-19 14:20:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:20:02,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 44 letters. Loop has 2 letters. [2024-11-19 14:20:02,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:02,431 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:02,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:02,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:20:02,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:02,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:02,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:02,570 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-19 14:20:02,571 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:02,662 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 89 transitions. Complement of second has 16 states. [2024-11-19 14:20:02,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:20:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2024-11-19 14:20:02,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 44 letters. Loop has 2 letters. [2024-11-19 14:20:02,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:02,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 46 letters. Loop has 2 letters. [2024-11-19 14:20:02,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:02,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 44 letters. Loop has 4 letters. [2024-11-19 14:20:02,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:02,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 89 transitions. [2024-11-19 14:20:02,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:02,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 65 states and 82 transitions. [2024-11-19 14:20:02,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:20:02,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:20:02,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 82 transitions. [2024-11-19 14:20:02,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:02,665 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 82 transitions. [2024-11-19 14:20:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 82 transitions. [2024-11-19 14:20:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2024-11-19 14:20:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-11-19 14:20:02,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-11-19 14:20:02,671 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-11-19 14:20:02,671 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-19 14:20:02,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 70 transitions. [2024-11-19 14:20:02,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:02,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:02,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:02,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:02,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:02,672 INFO L745 eck$LassoCheckResult]: Stem: 3865#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3853#L551 assume !(main_~length~0#1 < 1); 3862#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 3856#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3857#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3866#L556 assume !(main_~val~0#1 < 0); 3883#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3863#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3864#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3847#L556 assume !(main_~val~0#1 < 0); 3848#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3849#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3882#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3881#L556 assume !(main_~val~0#1 < 0); 3880#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3879#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3878#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3877#L556 assume !(main_~val~0#1 < 0); 3876#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3875#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3874#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3871#L556 assume !(main_~val~0#1 < 0); 3873#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3872#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3870#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 3854#L554-4 main_~j~0#1 := 0; 3855#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3867#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3902#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3901#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3868#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3861#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3869#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3850#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3851#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3899#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3898#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3897#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3896#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3894#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3893#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3892#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3891#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3890#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3887#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3886#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3884#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 3859#L562-3 [2024-11-19 14:20:02,672 INFO L747 eck$LassoCheckResult]: Loop: 3859#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3858#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 3859#L562-3 [2024-11-19 14:20:02,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1637690471, now seen corresponding path program 10 times [2024-11-19 14:20:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:02,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566957065] [2024-11-19 14:20:02,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:02,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:02,686 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:02,690 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:02,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:02,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566957065] [2024-11-19 14:20:02,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566957065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557988612] [2024-11-19 14:20:02,983 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:02,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:02,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:02,986 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:02,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2024-11-19 14:20:03,088 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:03,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:03,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:20:03,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:03,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:03,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:03,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557988612] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:03,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:03,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2024-11-19 14:20:03,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001062285] [2024-11-19 14:20:03,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:03,463 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:03,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 10 times [2024-11-19 14:20:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037019763] [2024-11-19 14:20:03,464 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:03,472 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:03,473 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:03,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:03,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:03,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 14:20:03,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-19 14:20:03,543 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. cyclomatic complexity: 21 Second operand has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:03,657 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-11-19 14:20:03,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 111 transitions. [2024-11-19 14:20:03,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:03,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 64 states and 79 transitions. [2024-11-19 14:20:03,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:20:03,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:20:03,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 79 transitions. [2024-11-19 14:20:03,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:03,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-11-19 14:20:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 79 transitions. [2024-11-19 14:20:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-11-19 14:20:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2024-11-19 14:20:03,662 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-19 14:20:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 14:20:03,668 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-11-19 14:20:03,668 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-19 14:20:03,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 75 transitions. [2024-11-19 14:20:03,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:03,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:03,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:03,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:03,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:03,669 INFO L745 eck$LassoCheckResult]: Stem: 4321#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 4311#L551 assume !(main_~length~0#1 < 1); 4318#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 4312#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4313#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4303#L556 assume !(main_~val~0#1 < 0); 4304#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4305#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4319#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4320#L556 assume !(main_~val~0#1 < 0); 4363#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4362#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4361#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4360#L556 assume !(main_~val~0#1 < 0); 4359#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4358#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4357#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4356#L556 assume !(main_~val~0#1 < 0); 4355#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4354#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4353#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4352#L556 assume !(main_~val~0#1 < 0); 4351#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4350#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4349#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4326#L556 assume !(main_~val~0#1 < 0); 4332#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4329#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4325#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 4308#L554-4 main_~j~0#1 := 0; 4309#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4322#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4323#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4306#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4307#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4317#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4348#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4347#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4346#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4344#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4343#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4342#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4341#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4339#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4338#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4337#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4336#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4335#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4331#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4330#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4327#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 4315#L562-3 [2024-11-19 14:20:03,669 INFO L747 eck$LassoCheckResult]: Loop: 4315#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4314#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 4315#L562-3 [2024-11-19 14:20:03,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash 618476690, now seen corresponding path program 11 times [2024-11-19 14:20:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:03,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417427333] [2024-11-19 14:20:03,670 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:20:03,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:03,691 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-19 14:20:03,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:03,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:03,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:03,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:03,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 11 times [2024-11-19 14:20:03,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:03,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978786804] [2024-11-19 14:20:03,707 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:20:03,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:03,710 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:20:03,710 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:03,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:03,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:03,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1650613783, now seen corresponding path program 5 times [2024-11-19 14:20:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151917232] [2024-11-19 14:20:03,713 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:20:03,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:03,735 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-19 14:20:03,735 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:03,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:03,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:05,048 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:20:05,049 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:20:05,049 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:20:05,049 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:20:05,049 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:20:05,049 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,049 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:20:05,049 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:20:05,049 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration15_Lasso [2024-11-19 14:20:05,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:20:05,049 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:20:05,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:05,745 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:20:05,745 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:20:05,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:05,747 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:05,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-11-19 14:20:05,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:05,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:05,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:05,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:05,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:05,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:05,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:05,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:05,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:05,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:05,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:05,771 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:05,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-11-19 14:20:05,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:05,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:05,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:05,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:05,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:05,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:05,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:05,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:05,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:05,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:05,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:05,798 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:05,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-11-19 14:20:05,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:05,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:05,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:05,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:05,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:05,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:05,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:05,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:05,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:05,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-11-19 14:20:05,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:05,830 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:05,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-11-19 14:20:05,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:05,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:05,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:05,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:05,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:05,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:05,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:05,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:05,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:05,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-19 14:20:05,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:05,860 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:05,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-11-19 14:20:05,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:05,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:05,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:05,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:05,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:05,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:05,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:05,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:05,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-11-19 14:20:05,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:05,892 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:05,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-11-19 14:20:05,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:05,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:05,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:05,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:05,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:05,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:05,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:05,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:05,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:05,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-11-19 14:20:05,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:05,917 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:05,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-11-19 14:20:05,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:05,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:05,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:05,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:05,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:05,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:05,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:05,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:05,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:05,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-11-19 14:20:05,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:05,941 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:05,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-11-19 14:20:05,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:05,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:05,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:05,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:05,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:05,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:05,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:05,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:05,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:05,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-11-19 14:20:05,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:05,964 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:05,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-11-19 14:20:05,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:05,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:05,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:05,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:05,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:05,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:05,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:05,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:05,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:05,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-11-19 14:20:05,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:05,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:05,988 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:05,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-11-19 14:20:05,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:05,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:06,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:06,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:06,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,015 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-11-19 14:20:06,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:06,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:06,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:06,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:06,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-11-19 14:20:06,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,038 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-19 14:20:06,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:06,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:06,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:06,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:06,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:06,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,063 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-11-19 14:20:06,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:06,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:06,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:06,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:06,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-19 14:20:06,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,089 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-11-19 14:20:06,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:06,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:06,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:06,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-11-19 14:20:06,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,119 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-11-19 14:20:06,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:06,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:06,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:06,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:06,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,162 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-19 14:20:06,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:06,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:06,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:06,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:06,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,192 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-19 14:20:06,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:06,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:06,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:06,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:06,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,220 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-11-19 14:20:06,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:06,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:06,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:06,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-11-19 14:20:06,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,250 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-11-19 14:20:06,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:06,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:06,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:06,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:06,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,277 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-11-19 14:20:06,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-19 14:20:06,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:06,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:06,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-11-19 14:20:06,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,306 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-11-19 14:20:06,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-19 14:20:06,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:06,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:06,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:06,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-11-19 14:20:06,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,336 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-11-19 14:20:06,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:06,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:06,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:06,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:06,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:06,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:06,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:06,354 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:20:06,362 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:20:06,363 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:20:06,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:06,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:06,364 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:06,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-11-19 14:20:06,365 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:20:06,376 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:20:06,377 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:20:06,377 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 20)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 20)_1 Supporting invariants [] [2024-11-19 14:20:06,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-11-19 14:20:06,426 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2024-11-19 14:20:06,428 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:20:06,428 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:20:06,428 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:20:06,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:06,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:20:06,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:06,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:06,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:06,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:06,833 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-19 14:20:06,833 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:06,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 77 transitions. Complement of second has 5 states. [2024-11-19 14:20:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:20:06,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 52 letters. Loop has 2 letters. [2024-11-19 14:20:06,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:06,859 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:06,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:06,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:20:06,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:07,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:07,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:07,121 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-19 14:20:07,121 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:07,153 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 77 transitions. Complement of second has 5 states. [2024-11-19 14:20:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:20:07,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 52 letters. Loop has 2 letters. [2024-11-19 14:20:07,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:07,154 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:07,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:07,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:20:07,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:07,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:07,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:07,537 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-19 14:20:07,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:07,656 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 102 transitions. Complement of second has 19 states. [2024-11-19 14:20:07,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:20:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2024-11-19 14:20:07,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 52 letters. Loop has 2 letters. [2024-11-19 14:20:07,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:07,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 54 letters. Loop has 2 letters. [2024-11-19 14:20:07,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:07,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 52 letters. Loop has 4 letters. [2024-11-19 14:20:07,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:07,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 102 transitions. [2024-11-19 14:20:07,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:07,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 75 states and 95 transitions. [2024-11-19 14:20:07,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:20:07,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:20:07,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 95 transitions. [2024-11-19 14:20:07,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:07,662 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 95 transitions. [2024-11-19 14:20:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 95 transitions. [2024-11-19 14:20:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2024-11-19 14:20:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 65 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-11-19 14:20:07,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-19 14:20:07,667 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-19 14:20:07,667 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-19 14:20:07,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 81 transitions. [2024-11-19 14:20:07,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:07,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:07,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:07,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:07,668 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:07,668 INFO L745 eck$LassoCheckResult]: Stem: 5258#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 5247#L551 assume !(main_~length~0#1 < 1); 5252#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 5250#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5251#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5241#L556 assume !(main_~val~0#1 < 0); 5242#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5243#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5257#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5259#L556 assume !(main_~val~0#1 < 0); 5281#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5280#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5279#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5278#L556 assume !(main_~val~0#1 < 0); 5277#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5276#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5275#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5274#L556 assume !(main_~val~0#1 < 0); 5273#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5272#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5271#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5270#L556 assume !(main_~val~0#1 < 0); 5269#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5268#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5267#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5264#L556 assume !(main_~val~0#1 < 0); 5266#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5265#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5263#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 5248#L554-4 main_~j~0#1 := 0; 5249#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5260#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5305#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5304#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5261#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5256#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5262#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5244#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5245#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5302#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5301#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5300#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5299#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5297#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5296#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5295#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5294#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5292#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5291#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5290#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5289#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5288#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5285#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5284#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5282#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5254#L562-3 [2024-11-19 14:20:07,668 INFO L747 eck$LassoCheckResult]: Loop: 5254#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5253#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 5254#L562-3 [2024-11-19 14:20:07,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1396913127, now seen corresponding path program 12 times [2024-11-19 14:20:07,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738203048] [2024-11-19 14:20:07,669 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:20:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:07,700 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-19 14:20:07,700 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:07,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738203048] [2024-11-19 14:20:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738203048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454571384] [2024-11-19 14:20:07,898 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:20:07,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:07,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:07,899 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:07,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2024-11-19 14:20:07,971 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-19 14:20:07,971 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:07,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:20:07,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:08,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:08,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454571384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:08,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:08,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2024-11-19 14:20:08,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839316292] [2024-11-19 14:20:08,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:08,281 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:08,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 12 times [2024-11-19 14:20:08,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:08,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531991767] [2024-11-19 14:20:08,282 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:20:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:08,285 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:20:08,285 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:08,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:08,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:08,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:08,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 14:20:08,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2024-11-19 14:20:08,313 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. cyclomatic complexity: 24 Second operand has 26 states, 25 states have (on average 3.68) internal successors, (92), 26 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:08,419 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2024-11-19 14:20:08,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 128 transitions. [2024-11-19 14:20:08,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:08,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 73 states and 90 transitions. [2024-11-19 14:20:08,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:20:08,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:20:08,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 90 transitions. [2024-11-19 14:20:08,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:08,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 90 transitions. [2024-11-19 14:20:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 90 transitions. [2024-11-19 14:20:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-11-19 14:20:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2024-11-19 14:20:08,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-11-19 14:20:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 14:20:08,423 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-11-19 14:20:08,423 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-19 14:20:08,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 86 transitions. [2024-11-19 14:20:08,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:08,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:08,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:08,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:08,424 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:08,424 INFO L745 eck$LassoCheckResult]: Stem: 5788#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5776#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 5777#L551 assume !(main_~length~0#1 < 1); 5786#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 5780#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5781#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5771#L556 assume !(main_~val~0#1 < 0); 5772#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5773#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5787#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5789#L556 assume !(main_~val~0#1 < 0); 5840#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5839#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5838#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5837#L556 assume !(main_~val~0#1 < 0); 5836#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5835#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5834#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5833#L556 assume !(main_~val~0#1 < 0); 5832#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5831#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5830#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5829#L556 assume !(main_~val~0#1 < 0); 5828#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5827#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5826#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5825#L556 assume !(main_~val~0#1 < 0); 5824#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5823#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5822#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5794#L556 assume !(main_~val~0#1 < 0); 5800#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5797#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5793#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 5778#L554-4 main_~j~0#1 := 0; 5779#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5790#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5791#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5774#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5775#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5785#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5821#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5820#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5819#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5817#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5816#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5815#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5814#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5812#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5811#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5810#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5809#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5807#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5806#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5805#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5804#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5803#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5799#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5798#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5795#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 5783#L562-3 [2024-11-19 14:20:08,424 INFO L747 eck$LassoCheckResult]: Loop: 5783#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5782#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 5783#L562-3 [2024-11-19 14:20:08,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1611822112, now seen corresponding path program 13 times [2024-11-19 14:20:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522284679] [2024-11-19 14:20:08,425 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:20:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:08,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:08,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:08,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 13 times [2024-11-19 14:20:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:08,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035878422] [2024-11-19 14:20:08,455 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:20:08,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:08,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:08,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:08,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1522145765, now seen corresponding path program 6 times [2024-11-19 14:20:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:08,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517148367] [2024-11-19 14:20:08,460 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:20:08,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:08,488 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-11-19 14:20:08,489 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:08,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:08,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:11,624 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:20:11,625 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:20:11,625 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:20:11,625 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:20:11,625 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:20:11,625 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:11,625 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:20:11,625 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:20:11,625 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration17_Lasso [2024-11-19 14:20:11,625 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:20:11,626 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:20:11,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:11,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:12,849 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:20:12,849 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:20:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:12,850 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:12,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-11-19 14:20:12,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:12,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:12,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:12,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:12,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:12,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:12,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:12,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:12,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:12,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-11-19 14:20:12,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:12,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:12,885 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:12,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-11-19 14:20:12,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:12,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:12,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:12,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:12,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:12,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:12,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:12,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:12,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-11-19 14:20:12,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:12,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:12,914 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:12,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-11-19 14:20:12,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:12,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:12,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:12,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:12,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:12,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:12,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:12,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:12,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:12,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:12,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:12,943 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:12,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-11-19 14:20:12,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:12,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:12,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:12,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:12,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:12,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:12,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:12,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:12,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:12,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:12,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:12,971 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:12,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-11-19 14:20:12,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:12,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:12,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:12,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:12,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:12,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:12,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:12,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:12,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:12,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:12,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:12,999 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:13,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-11-19 14:20:13,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:13,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:13,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:13,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:13,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:13,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:13,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:13,015 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:13,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:13,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:13,027 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:13,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-11-19 14:20:13,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:13,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:13,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:13,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:13,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:13,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:13,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:13,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:13,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:13,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:13,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:13,052 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:13,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-11-19 14:20:13,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:13,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:13,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:13,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:13,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:13,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:13,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:13,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:13,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:13,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:13,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:13,084 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:13,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-11-19 14:20:13,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-19 14:20:13,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:13,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:13,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:13,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:13,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:13,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:13,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:20:13,130 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-19 14:20:13,130 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-19 14:20:13,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:13,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:13,132 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:13,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-11-19 14:20:13,134 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:20:13,144 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:20:13,144 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:20:13,144 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1 Supporting invariants [] [2024-11-19 14:20:13,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:13,203 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2024-11-19 14:20:13,204 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:20:13,204 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:20:13,204 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:20:13,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:13,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:20:13,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:13,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:13,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:13,457 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-19 14:20:13,457 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:13,483 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 88 transitions. Complement of second has 4 states. [2024-11-19 14:20:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:20:13,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 60 letters. Loop has 2 letters. [2024-11-19 14:20:13,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:13,486 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:13,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:13,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:20:13,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:13,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:13,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:13,672 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-19 14:20:13,672 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:13,690 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 88 transitions. Complement of second has 4 states. [2024-11-19 14:20:13,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:20:13,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 60 letters. Loop has 2 letters. [2024-11-19 14:20:13,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:13,698 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:13,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:13,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:20:13,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:13,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:13,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:13,877 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-19 14:20:13,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:13,981 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 115 transitions. Complement of second has 20 states. [2024-11-19 14:20:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:20:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2024-11-19 14:20:13,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 60 letters. Loop has 2 letters. [2024-11-19 14:20:13,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:13,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 62 letters. Loop has 2 letters. [2024-11-19 14:20:13,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:13,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 60 letters. Loop has 4 letters. [2024-11-19 14:20:13,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:13,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 115 transitions. [2024-11-19 14:20:13,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:13,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 85 states and 108 transitions. [2024-11-19 14:20:13,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:20:13,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:20:13,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 108 transitions. [2024-11-19 14:20:13,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:13,988 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 108 transitions. [2024-11-19 14:20:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 108 transitions. [2024-11-19 14:20:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2024-11-19 14:20:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 74 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2024-11-19 14:20:13,994 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 92 transitions. [2024-11-19 14:20:13,994 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 92 transitions. [2024-11-19 14:20:13,994 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-19 14:20:13,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 92 transitions. [2024-11-19 14:20:13,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:13,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:13,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:13,994 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:13,994 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:13,995 INFO L745 eck$LassoCheckResult]: Stem: 6797#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6785#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 6786#L551 assume !(main_~length~0#1 < 1); 6791#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 6789#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6790#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6780#L556 assume !(main_~val~0#1 < 0); 6781#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6782#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6796#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6798#L556 assume !(main_~val~0#1 < 0); 6824#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6823#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6822#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6821#L556 assume !(main_~val~0#1 < 0); 6820#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6819#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6818#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6817#L556 assume !(main_~val~0#1 < 0); 6816#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6815#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6814#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6813#L556 assume !(main_~val~0#1 < 0); 6812#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6811#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6810#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6809#L556 assume !(main_~val~0#1 < 0); 6808#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6807#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6806#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6803#L556 assume !(main_~val~0#1 < 0); 6805#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6804#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6802#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 6787#L554-4 main_~j~0#1 := 0; 6788#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6799#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6853#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6852#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6800#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6795#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6801#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6783#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6784#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6850#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6849#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6848#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6847#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6845#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6844#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6843#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6842#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6840#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6839#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6838#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6837#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6835#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6834#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6833#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6832#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6831#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6828#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6827#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6825#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 6793#L562-3 [2024-11-19 14:20:13,995 INFO L747 eck$LassoCheckResult]: Loop: 6793#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6792#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 6793#L562-3 [2024-11-19 14:20:13,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:13,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1801767883, now seen corresponding path program 14 times [2024-11-19 14:20:13,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510325512] [2024-11-19 14:20:13,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:13,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:14,026 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:20:14,026 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 66 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:14,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:14,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510325512] [2024-11-19 14:20:14,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510325512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:14,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898349120] [2024-11-19 14:20:14,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:14,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:14,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:14,527 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:14,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2024-11-19 14:20:14,600 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:20:14,601 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:14,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:20:14,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:14,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2024-11-19 14:20:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:14,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:14,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898349120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:14,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:14,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2024-11-19 14:20:14,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500962265] [2024-11-19 14:20:14,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:14,981 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:14,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 14 times [2024-11-19 14:20:14,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:14,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634115809] [2024-11-19 14:20:14,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:14,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:14,989 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:20:14,989 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:14,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:14,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:15,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 14:20:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2024-11-19 14:20:15,015 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. cyclomatic complexity: 27 Second operand has 29 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 29 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:15,153 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2024-11-19 14:20:15,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 145 transitions. [2024-11-19 14:20:15,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:15,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 82 states and 101 transitions. [2024-11-19 14:20:15,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:20:15,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:20:15,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 101 transitions. [2024-11-19 14:20:15,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:15,155 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-11-19 14:20:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 101 transitions. [2024-11-19 14:20:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-11-19 14:20:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 78 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2024-11-19 14:20:15,156 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-11-19 14:20:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 14:20:15,162 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-11-19 14:20:15,162 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-19 14:20:15,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 97 transitions. [2024-11-19 14:20:15,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:15,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:15,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:15,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:15,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:15,163 INFO L745 eck$LassoCheckResult]: Stem: 7402#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 7392#L551 assume !(main_~length~0#1 < 1); 7399#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 7393#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 7394#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7384#L556 assume !(main_~val~0#1 < 0); 7385#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7386#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7400#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7401#L556 assume !(main_~val~0#1 < 0); 7462#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7461#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7460#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7459#L556 assume !(main_~val~0#1 < 0); 7458#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7457#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7456#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7455#L556 assume !(main_~val~0#1 < 0); 7454#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7453#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7452#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7451#L556 assume !(main_~val~0#1 < 0); 7450#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7449#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7448#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7447#L556 assume !(main_~val~0#1 < 0); 7446#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7445#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7444#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7443#L556 assume !(main_~val~0#1 < 0); 7442#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7441#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7440#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7407#L556 assume !(main_~val~0#1 < 0); 7413#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7410#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7406#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 7389#L554-4 main_~j~0#1 := 0; 7390#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7403#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7404#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7387#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7388#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7398#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7439#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7438#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7437#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7435#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7434#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7433#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7432#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7430#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7429#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7428#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7427#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7425#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7424#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7423#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7422#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7420#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7419#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7418#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7417#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7416#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7412#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7411#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7408#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 7396#L562-3 [2024-11-19 14:20:15,163 INFO L747 eck$LassoCheckResult]: Loop: 7396#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7395#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 7396#L562-3 [2024-11-19 14:20:15,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash 260997934, now seen corresponding path program 15 times [2024-11-19 14:20:15,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:15,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972778138] [2024-11-19 14:20:15,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:20:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:15,221 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-19 14:20:15,223 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:15,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:15,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:15,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 15 times [2024-11-19 14:20:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:15,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625501988] [2024-11-19 14:20:15,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:20:15,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:15,266 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:20:15,266 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:15,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:15,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:15,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:15,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1710912947, now seen corresponding path program 7 times [2024-11-19 14:20:15,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:15,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547676625] [2024-11-19 14:20:15,270 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:20:15,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:15,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:15,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:18,355 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:20:18,355 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:20:18,355 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:20:18,355 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:20:18,355 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:20:18,356 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,356 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:20:18,356 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:20:18,356 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration19_Lasso [2024-11-19 14:20:18,356 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:20:18,356 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:20:18,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:18,818 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:20:18,818 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:20:18,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,819 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:18,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-11-19 14:20:18,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:18,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:18,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:18,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:18,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:18,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:18,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:18,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:18,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:18,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-11-19 14:20:18,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,844 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:18,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-11-19 14:20:18,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:18,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:18,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:18,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:18,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:18,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:18,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:18,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:18,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:18,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-11-19 14:20:18,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,870 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:18,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-11-19 14:20:18,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:18,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:18,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:18,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:18,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:18,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:18,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:18,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:18,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-11-19 14:20:18,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,897 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:18,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-11-19 14:20:18,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:18,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:18,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:18,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:18,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:18,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:18,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:18,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:18,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:18,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-11-19 14:20:18,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,921 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:18,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-11-19 14:20:18,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:18,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:18,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:18,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:18,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:18,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:18,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:18,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:18,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:18,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-11-19 14:20:18,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,945 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:18,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-11-19 14:20:18,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:18,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:18,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:18,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:18,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:18,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:18,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:18,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:18,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:18,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:18,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,970 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:18,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-11-19 14:20:18,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:18,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:18,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:18,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:18,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:18,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:18,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:18,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:18,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:18,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:18,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:18,996 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:18,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-11-19 14:20:18,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,022 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-11-19 14:20:19,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:19,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:19,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:19,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,047 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-11-19 14:20:19,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:19,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:19,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:19,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,075 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-11-19 14:20:19,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:19,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:19,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:19,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-11-19 14:20:19,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,100 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-11-19 14:20:19,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:19,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:19,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:19,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2024-11-19 14:20:19,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,129 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-11-19 14:20:19,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-19 14:20:19,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:19,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:19,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:19,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,154 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-11-19 14:20:19,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,181 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-11-19 14:20:19,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,209 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-11-19 14:20:19,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-11-19 14:20:19,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,236 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-11-19 14:20:19,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,265 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-11-19 14:20:19,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,293 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-11-19 14:20:19,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,322 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-11-19 14:20:19,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,350 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-11-19 14:20:19,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,382 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-11-19 14:20:19,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,411 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-11-19 14:20:19,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,437 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-11-19 14:20:19,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-11-19 14:20:19,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,464 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-11-19 14:20:19,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:19,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-11-19 14:20:19,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,490 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2024-11-19 14:20:19,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:19,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:19,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:19,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:19,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:19,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:19,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:19,508 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:20:19,517 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-19 14:20:19,517 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-19 14:20:19,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:19,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:19,519 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:19,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2024-11-19 14:20:19,520 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:20:19,533 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:20:19,533 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:20:19,533 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1 Supporting invariants [] [2024-11-19 14:20:19,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,563 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2024-11-19 14:20:19,565 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:20:19,565 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:20:19,565 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:20:19,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:19,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 14:20:19,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:19,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:19,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:19,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:19,981 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-19 14:20:19,981 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:20,009 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 99 transitions. Complement of second has 5 states. [2024-11-19 14:20:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:20:20,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 68 letters. Loop has 2 letters. [2024-11-19 14:20:20,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:20,011 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:20,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:20,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 14:20:20,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:20,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:20,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:20,508 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-19 14:20:20,509 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:20,550 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 99 transitions. Complement of second has 5 states. [2024-11-19 14:20:20,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:20:20,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 68 letters. Loop has 2 letters. [2024-11-19 14:20:20,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:20,551 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:20,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:20,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 14:20:20,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:20,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:20,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:20,867 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-19 14:20:20,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:21,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 128 transitions. Complement of second has 23 states. [2024-11-19 14:20:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:20:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2024-11-19 14:20:21,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 68 letters. Loop has 2 letters. [2024-11-19 14:20:21,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:21,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 70 letters. Loop has 2 letters. [2024-11-19 14:20:21,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:21,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 68 letters. Loop has 4 letters. [2024-11-19 14:20:21,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:21,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 128 transitions. [2024-11-19 14:20:21,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:21,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 95 states and 121 transitions. [2024-11-19 14:20:21,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:20:21,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:20:21,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 121 transitions. [2024-11-19 14:20:21,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:21,104 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 121 transitions. [2024-11-19 14:20:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 121 transitions. [2024-11-19 14:20:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2024-11-19 14:20:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 83 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2024-11-19 14:20:21,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-11-19 14:20:21,106 INFO L425 stractBuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-11-19 14:20:21,106 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-19 14:20:21,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 103 transitions. [2024-11-19 14:20:21,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:21,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:21,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:21,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:21,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:21,111 INFO L745 eck$LassoCheckResult]: Stem: 8518#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 8506#L551 assume !(main_~length~0#1 < 1); 8515#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 8509#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 8510#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8519#L556 assume !(main_~val~0#1 < 0); 8548#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8516#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8517#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8500#L556 assume !(main_~val~0#1 < 0); 8501#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8502#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8547#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8546#L556 assume !(main_~val~0#1 < 0); 8545#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8544#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8543#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8542#L556 assume !(main_~val~0#1 < 0); 8541#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8540#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8539#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8538#L556 assume !(main_~val~0#1 < 0); 8537#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8536#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8535#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8534#L556 assume !(main_~val~0#1 < 0); 8533#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8532#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8531#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8530#L556 assume !(main_~val~0#1 < 0); 8529#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8528#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8527#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8524#L556 assume !(main_~val~0#1 < 0); 8526#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8525#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8523#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 8507#L554-4 main_~j~0#1 := 0; 8508#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8520#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8582#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8581#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8521#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8514#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8522#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8503#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8504#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8579#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8578#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8577#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8576#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8574#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8573#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8572#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8571#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8569#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8568#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8567#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8566#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8564#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8563#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8562#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8561#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8559#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8558#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8557#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8556#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8555#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8552#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8551#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8549#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 8512#L562-3 [2024-11-19 14:20:21,111 INFO L747 eck$LassoCheckResult]: Loop: 8512#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8511#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 8512#L562-3 [2024-11-19 14:20:21,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash -785132413, now seen corresponding path program 16 times [2024-11-19 14:20:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:21,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579253534] [2024-11-19 14:20:21,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:21,120 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:21,120 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 91 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:21,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:21,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579253534] [2024-11-19 14:20:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579253534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:21,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568223899] [2024-11-19 14:20:21,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:21,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:21,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:21,398 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:21,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2024-11-19 14:20:21,542 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:21,542 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:21,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 14:20:21,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:21,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:22,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568223899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:22,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:22,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2024-11-19 14:20:22,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318710382] [2024-11-19 14:20:22,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:22,061 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:22,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 16 times [2024-11-19 14:20:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:22,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457173068] [2024-11-19 14:20:22,061 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:22,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:22,068 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:22,068 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:22,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:22,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:22,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 14:20:22,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2024-11-19 14:20:22,123 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. cyclomatic complexity: 30 Second operand has 32 states, 31 states have (on average 3.7419354838709675) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:22,498 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2024-11-19 14:20:22,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 162 transitions. [2024-11-19 14:20:22,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:22,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 91 states and 112 transitions. [2024-11-19 14:20:22,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:20:22,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:20:22,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 112 transitions. [2024-11-19 14:20:22,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:22,499 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 112 transitions. [2024-11-19 14:20:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 112 transitions. [2024-11-19 14:20:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-11-19 14:20:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 87 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-11-19 14:20:22,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-19 14:20:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 14:20:22,501 INFO L425 stractBuchiCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-19 14:20:22,501 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-19 14:20:22,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 108 transitions. [2024-11-19 14:20:22,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:22,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:22,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:22,502 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:22,502 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:22,502 INFO L745 eck$LassoCheckResult]: Stem: 9196#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 9186#L551 assume !(main_~length~0#1 < 1); 9193#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 9187#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 9188#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9178#L556 assume !(main_~val~0#1 < 0); 9179#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9180#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9194#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9195#L556 assume !(main_~val~0#1 < 0); 9265#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9264#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9263#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9262#L556 assume !(main_~val~0#1 < 0); 9261#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9260#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9259#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9258#L556 assume !(main_~val~0#1 < 0); 9257#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9256#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9255#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9254#L556 assume !(main_~val~0#1 < 0); 9253#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9252#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9251#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9250#L556 assume !(main_~val~0#1 < 0); 9249#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9248#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9247#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9246#L556 assume !(main_~val~0#1 < 0); 9245#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9244#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9243#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9242#L556 assume !(main_~val~0#1 < 0); 9241#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9240#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9239#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9201#L556 assume !(main_~val~0#1 < 0); 9207#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9204#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9200#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 9183#L554-4 main_~j~0#1 := 0; 9184#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9197#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9198#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9181#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9182#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9192#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9238#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9237#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9236#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9234#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9233#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9232#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9231#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9229#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9228#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9227#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9226#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9224#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9223#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9222#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9221#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9219#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9218#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9217#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9216#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9214#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9213#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9212#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9211#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9210#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9206#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9205#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9202#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 9190#L562-3 [2024-11-19 14:20:22,502 INFO L747 eck$LassoCheckResult]: Loop: 9190#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9189#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 9190#L562-3 [2024-11-19 14:20:22,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1182197124, now seen corresponding path program 17 times [2024-11-19 14:20:22,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:22,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065024267] [2024-11-19 14:20:22,503 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:20:22,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:22,527 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-19 14:20:22,528 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:22,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:22,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:22,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 17 times [2024-11-19 14:20:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:22,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848263399] [2024-11-19 14:20:22,544 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:20:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:22,546 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:20:22,547 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:22,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:22,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:22,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2074898817, now seen corresponding path program 8 times [2024-11-19 14:20:22,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:22,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593005278] [2024-11-19 14:20:22,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:22,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:22,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:20:22,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:22,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:22,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:28,249 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:20:28,249 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:20:28,249 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:20:28,250 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:20:28,250 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:20:28,250 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:28,250 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:20:28,250 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:20:28,250 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration21_Lasso [2024-11-19 14:20:28,250 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:20:28,250 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:20:28,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:28,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:28,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:28,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:28,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:28,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:30,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:30,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:30,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:30,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:30,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:30,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:30,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:30,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:30,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:30,551 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:20:30,551 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:20:30,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,553 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-11-19 14:20:30,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:30,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:30,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:30,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2024-11-19 14:20:30,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,580 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-11-19 14:20:30,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:30,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:30,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:30,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-11-19 14:20:30,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,604 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-11-19 14:20:30,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:30,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:30,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,634 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-11-19 14:20:30,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:30,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:30,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:30,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2024-11-19 14:20:30,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,658 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-11-19 14:20:30,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:30,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:30,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:30,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2024-11-19 14:20:30,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,682 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-11-19 14:20:30,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:30,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:30,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:30,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,709 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-11-19 14:20:30,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:30,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:30,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2024-11-19 14:20:30,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,736 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-11-19 14:20:30,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:30,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:30,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:30,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,764 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-11-19 14:20:30,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:30,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:30,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:30,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,791 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-11-19 14:20:30,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:30,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:30,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2024-11-19 14:20:30,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,821 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-11-19 14:20:30,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:30,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:30,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:30,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:30,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,854 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-11-19 14:20:30,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:30,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:30,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:30,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:30,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:30,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:30,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:30,872 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:20:30,880 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-19 14:20:30,880 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:20:30,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:30,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:30,882 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:30,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2024-11-19 14:20:30,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:20:30,900 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:20:30,901 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:20:30,901 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-11-19 14:20:30,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:31,052 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2024-11-19 14:20:31,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:20:31,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:20:31,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:20:31,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:31,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 14:20:31,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:31,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:31,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:31,393 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-19 14:20:31,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:31,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 110 transitions. Complement of second has 4 states. [2024-11-19 14:20:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:20:31,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 76 letters. Loop has 2 letters. [2024-11-19 14:20:31,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:31,413 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:31,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:31,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 14:20:31,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:31,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:31,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:31,653 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-19 14:20:31,653 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:31,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 110 transitions. Complement of second has 4 states. [2024-11-19 14:20:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:20:31,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 76 letters. Loop has 2 letters. [2024-11-19 14:20:31,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:31,675 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:31,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:31,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 14:20:31,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:31,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:31,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:31,916 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-19 14:20:31,916 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:32,105 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 110 states and 141 transitions. Complement of second has 24 states. [2024-11-19 14:20:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:20:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2024-11-19 14:20:32,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 76 letters. Loop has 2 letters. [2024-11-19 14:20:32,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:32,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 78 letters. Loop has 2 letters. [2024-11-19 14:20:32,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:32,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 76 letters. Loop has 4 letters. [2024-11-19 14:20:32,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:32,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 141 transitions. [2024-11-19 14:20:32,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:32,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 105 states and 134 transitions. [2024-11-19 14:20:32,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:20:32,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:20:32,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 134 transitions. [2024-11-19 14:20:32,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:32,107 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 134 transitions. [2024-11-19 14:20:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 134 transitions. [2024-11-19 14:20:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2024-11-19 14:20:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 92 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2024-11-19 14:20:32,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-11-19 14:20:32,109 INFO L425 stractBuchiCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-11-19 14:20:32,109 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-19 14:20:32,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 114 transitions. [2024-11-19 14:20:32,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:32,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:32,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:32,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:32,110 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:32,110 INFO L745 eck$LassoCheckResult]: Stem: 10450#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 10439#L551 assume !(main_~length~0#1 < 1); 10444#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 10442#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 10443#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10433#L556 assume !(main_~val~0#1 < 0); 10434#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10435#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10449#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10451#L556 assume !(main_~val~0#1 < 0); 10485#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10484#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10483#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10482#L556 assume !(main_~val~0#1 < 0); 10481#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10480#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10479#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10478#L556 assume !(main_~val~0#1 < 0); 10477#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10476#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10475#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10474#L556 assume !(main_~val~0#1 < 0); 10473#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10472#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10471#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10470#L556 assume !(main_~val~0#1 < 0); 10469#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10468#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10467#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10466#L556 assume !(main_~val~0#1 < 0); 10465#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10464#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10463#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10462#L556 assume !(main_~val~0#1 < 0); 10461#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10460#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10459#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10456#L556 assume !(main_~val~0#1 < 0); 10458#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10457#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10455#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 10440#L554-4 main_~j~0#1 := 0; 10441#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10452#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10524#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10523#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10453#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10448#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10454#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10436#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10437#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10521#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10520#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10519#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10518#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10516#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10515#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10514#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10513#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10511#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10510#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10509#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10508#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10506#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10505#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10504#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10503#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10501#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10500#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10499#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10498#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10496#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10495#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10494#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10493#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10492#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10489#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10488#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10486#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 10446#L562-3 [2024-11-19 14:20:32,110 INFO L747 eck$LassoCheckResult]: Loop: 10446#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10445#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 10446#L562-3 [2024-11-19 14:20:32,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1112937681, now seen corresponding path program 18 times [2024-11-19 14:20:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:32,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374084102] [2024-11-19 14:20:32,111 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:20:32,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:32,133 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-11-19 14:20:32,133 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:32,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2024-11-19 14:20:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:32,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:32,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374084102] [2024-11-19 14:20:32,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374084102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:32,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585870231] [2024-11-19 14:20:32,456 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:20:32,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:32,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:32,457 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:32,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2024-11-19 14:20:32,591 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-11-19 14:20:32,591 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:32,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 14:20:32,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:32,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:33,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585870231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:33,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:33,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2024-11-19 14:20:33,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506758261] [2024-11-19 14:20:33,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:33,124 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:33,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 18 times [2024-11-19 14:20:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:33,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611220984] [2024-11-19 14:20:33,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:20:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:33,132 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:20:33,132 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:33,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:33,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 14:20:33,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 14:20:33,183 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. cyclomatic complexity: 33 Second operand has 35 states, 34 states have (on average 3.764705882352941) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:33,360 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2024-11-19 14:20:33,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 179 transitions. [2024-11-19 14:20:33,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:33,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 100 states and 123 transitions. [2024-11-19 14:20:33,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:20:33,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:20:33,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 123 transitions. [2024-11-19 14:20:33,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:33,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-11-19 14:20:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 123 transitions. [2024-11-19 14:20:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-19 14:20:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 96 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2024-11-19 14:20:33,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-11-19 14:20:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 14:20:33,364 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-11-19 14:20:33,364 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-19 14:20:33,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 119 transitions. [2024-11-19 14:20:33,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:33,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:33,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:33,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:33,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:33,365 INFO L745 eck$LassoCheckResult]: Stem: 11202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 11191#L551 assume !(main_~length~0#1 < 1); 11196#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 11194#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 11195#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11185#L556 assume !(main_~val~0#1 < 0); 11186#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11187#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11201#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11203#L556 assume !(main_~val~0#1 < 0); 11281#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11280#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11279#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11278#L556 assume !(main_~val~0#1 < 0); 11277#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11276#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11275#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11274#L556 assume !(main_~val~0#1 < 0); 11273#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11272#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11271#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11270#L556 assume !(main_~val~0#1 < 0); 11269#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11268#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11267#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11266#L556 assume !(main_~val~0#1 < 0); 11265#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11264#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11263#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11262#L556 assume !(main_~val~0#1 < 0); 11261#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11260#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11259#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11258#L556 assume !(main_~val~0#1 < 0); 11257#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11256#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11255#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11254#L556 assume !(main_~val~0#1 < 0); 11253#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11252#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11251#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11208#L556 assume !(main_~val~0#1 < 0); 11214#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11211#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11207#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 11192#L554-4 main_~j~0#1 := 0; 11193#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11204#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11205#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11188#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11189#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11200#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11250#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11249#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11248#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11246#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11245#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11244#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11243#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11241#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11240#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11239#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11238#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11236#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11235#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11234#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11233#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11231#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11230#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11229#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11228#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11226#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11225#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11224#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11223#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11221#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11220#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11219#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11218#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11217#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11213#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11212#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11209#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 11198#L562-3 [2024-11-19 14:20:33,365 INFO L747 eck$LassoCheckResult]: Loop: 11198#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11197#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 11198#L562-3 [2024-11-19 14:20:33,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1373220406, now seen corresponding path program 19 times [2024-11-19 14:20:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:33,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133158994] [2024-11-19 14:20:33,366 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:20:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:33,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:33,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:33,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:33,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 19 times [2024-11-19 14:20:33,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:33,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649058193] [2024-11-19 14:20:33,404 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:20:33,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:33,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:33,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:33,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:33,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1109848753, now seen corresponding path program 9 times [2024-11-19 14:20:33,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:33,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832100739] [2024-11-19 14:20:33,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:20:33,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:33,440 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 14:20:33,441 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:33,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:33,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:39,733 WARN L286 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 326 DAG size of output: 239 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-19 14:20:40,080 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:20:40,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:20:40,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:20:40,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:20:40,080 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:20:40,081 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:40,081 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:20:40,081 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:20:40,081 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration23_Lasso [2024-11-19 14:20:40,081 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:20:40,081 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:20:40,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:40,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:41,559 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:20:41,559 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:20:41,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,561 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-11-19 14:20:41,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,588 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2024-11-19 14:20:41,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:41,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:41,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,615 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-11-19 14:20:41,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,640 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-11-19 14:20:41,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,664 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-11-19 14:20:41,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,689 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-11-19 14:20:41,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:41,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:41,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2024-11-19 14:20:41,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,715 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-11-19 14:20:41,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,742 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-11-19 14:20:41,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2024-11-19 14:20:41,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,766 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-11-19 14:20:41,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,794 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-11-19 14:20:41,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:41,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:41,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,821 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-11-19 14:20:41,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,846 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-11-19 14:20:41,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,870 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-11-19 14:20:41,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,896 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-11-19 14:20:41,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:41,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:41,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:41,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,920 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2024-11-19 14:20:41,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:41,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:41,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,949 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2024-11-19 14:20:41,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:41,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:41,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:41,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:41,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:41,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:41,976 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:41,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2024-11-19 14:20:41,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:41,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:41,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:41,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:41,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:41,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:41,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:41,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:42,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2024-11-19 14:20:42,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:42,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:42,008 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:42,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2024-11-19 14:20: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-19 14:20:42,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:42,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:42,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:42,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:42,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:42,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:42,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:42,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2024-11-19 14:20:42,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:42,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:42,040 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:42,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2024-11-19 14:20:42,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:42,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:42,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:42,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:42,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:42,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:42,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:42,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:42,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:42,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:42,068 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:42,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2024-11-19 14:20:42,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:42,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:42,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:42,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:42,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:42,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:42,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:42,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:42,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:42,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:42,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:42,097 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:42,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2024-11-19 14:20:42,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:42,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:42,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:42,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:42,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:42,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:42,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:42,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:42,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:42,125 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:42,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2024-11-19 14:20:42,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:42,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:42,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:42,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:42,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:42,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:42,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:42,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:42,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:42,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:42,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:42,185 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:42,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2024-11-19 14:20:42,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:42,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:42,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:42,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:42,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:42,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:42,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:42,203 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:20:42,215 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-19 14:20:42,215 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:20:42,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:42,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:42,217 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:42,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2024-11-19 14:20:42,219 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:20:42,232 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:20:42,232 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:20:42,232 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 36)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 36)_1 Supporting invariants [] [2024-11-19 14:20:42,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:42,339 INFO L156 tatePredicateManager]: 40 out of 41 supporting invariants were superfluous and have been removed [2024-11-19 14:20:42,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:20:42,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:20:42,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:20:42,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:42,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:20:42,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:42,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:42,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:42,799 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-11-19 14:20:42,799 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:42,846 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 121 transitions. Complement of second has 5 states. [2024-11-19 14:20:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:20:42,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 84 letters. Loop has 2 letters. [2024-11-19 14:20:42,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:42,851 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:42,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:42,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:20:42,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:43,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:43,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:43,453 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2024-11-19 14:20:43,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:43,487 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 121 transitions. Complement of second has 5 states. [2024-11-19 14:20:43,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:20:43,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 84 letters. Loop has 2 letters. [2024-11-19 14:20:43,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:43,488 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:43,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:43,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:20:43,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:43,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:43,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:43,921 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-11-19 14:20:43,921 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:44,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2024-11-19 14:20:44,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 120 states and 154 transitions. Complement of second has 27 states. [2024-11-19 14:20:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:20:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2024-11-19 14:20:44,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 84 letters. Loop has 2 letters. [2024-11-19 14:20:44,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:44,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 86 letters. Loop has 2 letters. [2024-11-19 14:20:44,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:44,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 84 letters. Loop has 4 letters. [2024-11-19 14:20:44,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:44,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 154 transitions. [2024-11-19 14:20:44,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:44,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 115 states and 147 transitions. [2024-11-19 14:20:44,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:20:44,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:20:44,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 147 transitions. [2024-11-19 14:20:44,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:44,206 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 147 transitions. [2024-11-19 14:20:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 147 transitions. [2024-11-19 14:20:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2024-11-19 14:20:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 101 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-11-19 14:20:44,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-11-19 14:20:44,208 INFO L425 stractBuchiCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-11-19 14:20:44,208 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-19 14:20:44,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 125 transitions. [2024-11-19 14:20:44,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:44,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:44,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:44,209 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:44,209 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:44,209 INFO L745 eck$LassoCheckResult]: Stem: 12665#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12652#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 12653#L551 assume !(main_~length~0#1 < 1); 12662#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 12656#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 12657#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12666#L556 assume !(main_~val~0#1 < 0); 12703#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12663#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12664#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12647#L556 assume !(main_~val~0#1 < 0); 12648#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12649#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12702#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12701#L556 assume !(main_~val~0#1 < 0); 12700#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12699#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12698#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12697#L556 assume !(main_~val~0#1 < 0); 12696#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12695#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12694#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12693#L556 assume !(main_~val~0#1 < 0); 12692#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12691#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12690#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12689#L556 assume !(main_~val~0#1 < 0); 12688#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12687#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12686#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12685#L556 assume !(main_~val~0#1 < 0); 12684#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12683#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12682#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12681#L556 assume !(main_~val~0#1 < 0); 12680#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12679#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12678#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12677#L556 assume !(main_~val~0#1 < 0); 12676#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12675#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12674#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12671#L556 assume !(main_~val~0#1 < 0); 12673#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12672#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12670#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 12654#L554-4 main_~j~0#1 := 0; 12655#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12667#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12747#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12746#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12668#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12661#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12669#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12650#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12651#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12744#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12743#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12742#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12741#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12739#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12738#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12737#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12736#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12734#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12733#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12732#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12731#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12729#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12728#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12727#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12726#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12724#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12723#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12722#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12721#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12719#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12718#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12717#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12716#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12714#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12713#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12712#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12711#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12710#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12707#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12706#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12704#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 12659#L562-3 [2024-11-19 14:20:44,209 INFO L747 eck$LassoCheckResult]: Loop: 12659#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12658#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 12659#L562-3 [2024-11-19 14:20:44,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1412762337, now seen corresponding path program 20 times [2024-11-19 14:20:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178567644] [2024-11-19 14:20:44,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:44,221 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:20:44,221 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 153 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:44,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:20:44,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178567644] [2024-11-19 14:20:44,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178567644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:20:44,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37224235] [2024-11-19 14:20:44,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:44,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:20:44,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:44,521 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:20:44,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Waiting until timeout for monitored process [2024-11-19 14:20:44,610 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:20:44,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:20:44,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 14:20:44,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:44,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:20:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:45,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37224235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:20:45,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:20:45,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 37 [2024-11-19 14:20:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902098489] [2024-11-19 14:20:45,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:20:45,178 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:20:45,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 20 times [2024-11-19 14:20:45,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:45,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823043164] [2024-11-19 14:20:45,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:20:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:45,181 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:20:45,181 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:45,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:45,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:45,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:20:45,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 14:20:45,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 14:20:45,208 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. cyclomatic complexity: 36 Second operand has 38 states, 37 states have (on average 3.7837837837837838) internal successors, (140), 38 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:20:45,410 INFO L93 Difference]: Finished difference Result 161 states and 196 transitions. [2024-11-19 14:20:45,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 196 transitions. [2024-11-19 14:20:45,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:45,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 109 states and 134 transitions. [2024-11-19 14:20:45,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:20:45,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:20:45,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 134 transitions. [2024-11-19 14:20:45,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:45,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 134 transitions. [2024-11-19 14:20:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 134 transitions. [2024-11-19 14:20:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-11-19 14:20:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 105 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2024-11-19 14:20:45,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 130 transitions. [2024-11-19 14:20:45,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 14:20:45,413 INFO L425 stractBuchiCegarLoop]: Abstraction has 106 states and 130 transitions. [2024-11-19 14:20:45,413 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-19 14:20:45,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 130 transitions. [2024-11-19 14:20:45,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:45,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:45,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:45,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:45,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:45,414 INFO L745 eck$LassoCheckResult]: Stem: 13490#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13478#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 13479#L551 assume !(main_~length~0#1 < 1); 13484#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 13482#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 13483#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13473#L556 assume !(main_~val~0#1 < 0); 13474#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13475#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13489#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13491#L556 assume !(main_~val~0#1 < 0); 13578#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13577#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13576#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13575#L556 assume !(main_~val~0#1 < 0); 13574#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13573#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13572#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13571#L556 assume !(main_~val~0#1 < 0); 13570#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13569#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13568#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13567#L556 assume !(main_~val~0#1 < 0); 13566#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13565#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13564#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13563#L556 assume !(main_~val~0#1 < 0); 13562#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13561#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13560#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13559#L556 assume !(main_~val~0#1 < 0); 13558#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13557#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13556#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13555#L556 assume !(main_~val~0#1 < 0); 13554#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13553#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13552#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13551#L556 assume !(main_~val~0#1 < 0); 13550#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13549#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13548#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13547#L556 assume !(main_~val~0#1 < 0); 13546#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13545#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13544#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13496#L556 assume !(main_~val~0#1 < 0); 13502#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13499#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13495#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 13480#L554-4 main_~j~0#1 := 0; 13481#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13492#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13493#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13476#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13477#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13488#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13543#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13542#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13541#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13539#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13538#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13537#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13536#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13534#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13533#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13532#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13531#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13529#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13528#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13527#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13526#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13524#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13523#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13522#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13521#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13519#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13518#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13517#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13516#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13514#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13513#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13512#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13511#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13509#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13508#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13507#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13506#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13505#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13501#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13500#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13497#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 13486#L562-3 [2024-11-19 14:20:45,415 INFO L747 eck$LassoCheckResult]: Loop: 13486#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13485#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 13486#L562-3 [2024-11-19 14:20:45,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2010175208, now seen corresponding path program 21 times [2024-11-19 14:20:45,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:45,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636723889] [2024-11-19 14:20:45,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:20:45,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:45,474 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-19 14:20:45,474 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:45,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:45,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:45,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 21 times [2024-11-19 14:20:45,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:45,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994560145] [2024-11-19 14:20:45,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:20:45,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:45,531 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:20:45,531 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:45,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:45,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:45,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash 956909853, now seen corresponding path program 10 times [2024-11-19 14:20:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:45,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269922305] [2024-11-19 14:20:45,538 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:45,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:45,580 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:45,584 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:20:45,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:20:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:20:45,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:20:55,427 WARN L286 SmtUtils]: Spent 9.76s on a formula simplification. DAG size of input: 355 DAG size of output: 260 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-19 14:20:55,827 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:20:55,827 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:20:55,827 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:20:55,827 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:20:55,827 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:20:55,827 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:55,827 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:20:55,827 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:20:55,827 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration25_Lasso [2024-11-19 14:20:55,827 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:20:55,827 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:20:55,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:55,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:55,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:55,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:55,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:20:57,640 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:20:57,640 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:20:57,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,642 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-11-19 14:20:57,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:57,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:57,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:57,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,671 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-11-19 14:20:57,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:57,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:57,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:57,685 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2024-11-19 14:20:57,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,697 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2024-11-19 14:20:57,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:57,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:57,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:57,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,723 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2024-11-19 14:20:57,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:20:57,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:20:57,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:20:57,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:57,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,747 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2024-11-19 14:20:57,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:57,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:57,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2024-11-19 14:20:57,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,773 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2024-11-19 14:20:57,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:57,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:57,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:57,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,802 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2024-11-19 14:20:57,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:57,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:57,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:57,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,835 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2024-11-19 14:20:57,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:57,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:57,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2024-11-19 14:20:57,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,863 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2024-11-19 14:20:57,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:57,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:57,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:57,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,892 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2024-11-19 14:20:57,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:57,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:57,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:57,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,923 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2024-11-19 14:20:57,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:57,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:57,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:57,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:57,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:57,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:57,953 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:57,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2024-11-19 14:20:57,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:57,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:57,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:57,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:57,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:57,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:57,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:57,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:58,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:58,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:58,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:58,011 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:58,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2024-11-19 14:20:58,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:58,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:58,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:58,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:58,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:58,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:58,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:58,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:58,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:58,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:58,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:58,041 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:58,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2024-11-19 14:20:58,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:58,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:58,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:58,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:58,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:58,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:58,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:58,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:20:58,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:58,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:58,071 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:58,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2024-11-19 14:20:58,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:20:58,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:20:58,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:20:58,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:20:58,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:20:58,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:20:58,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:20:58,089 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:20:58,095 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-19 14:20:58,095 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:20:58,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:20:58,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:20:58,097 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:20:58,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2024-11-19 14:20:58,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:20:58,109 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:20:58,109 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:20:58,109 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 40)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 40)_1 Supporting invariants [] [2024-11-19 14:20:58,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2024-11-19 14:20:58,214 INFO L156 tatePredicateManager]: 44 out of 45 supporting invariants were superfluous and have been removed [2024-11-19 14:20:58,216 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:20:58,216 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:20:58,216 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:20:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:58,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 14:20:58,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:58,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:58,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:58,731 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-19 14:20:58,732 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:58,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 132 transitions. Complement of second has 5 states. [2024-11-19 14:20:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:20:58,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 92 letters. Loop has 2 letters. [2024-11-19 14:20:58,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:58,794 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:58,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:58,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 14:20:58,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:59,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2024-11-19 14:20:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:59,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:59,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:59,298 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-19 14:20:59,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:59,327 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 132 transitions. Complement of second has 5 states. [2024-11-19 14:20:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:20:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:20:59,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 92 letters. Loop has 2 letters. [2024-11-19 14:20:59,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:59,331 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:20:59,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:59,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 14:20:59,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:20:59,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:20:59,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:20:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:20:59,736 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-19 14:20:59,736 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:59,944 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 130 states and 167 transitions. Complement of second has 29 states. [2024-11-19 14:20:59,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:20:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 87 transitions. [2024-11-19 14:20:59,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 92 letters. Loop has 2 letters. [2024-11-19 14:20:59,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:59,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 94 letters. Loop has 2 letters. [2024-11-19 14:20:59,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:59,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 92 letters. Loop has 4 letters. [2024-11-19 14:20:59,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:20:59,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 167 transitions. [2024-11-19 14:20:59,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:59,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 160 transitions. [2024-11-19 14:20:59,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:20:59,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:20:59,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 160 transitions. [2024-11-19 14:20:59,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:20:59,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 160 transitions. [2024-11-19 14:20:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 160 transitions. [2024-11-19 14:20:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2024-11-19 14:20:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 110 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:20:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2024-11-19 14:20:59,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-11-19 14:20:59,950 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-11-19 14:20:59,950 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-19 14:20:59,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 136 transitions. [2024-11-19 14:20:59,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:20:59,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:20:59,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:20:59,955 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:20:59,955 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:20:59,955 INFO L745 eck$LassoCheckResult]: Stem: 15083#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15071#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 15072#L551 assume !(main_~length~0#1 < 1); 15077#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 15075#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15076#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15066#L556 assume !(main_~val~0#1 < 0); 15067#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15068#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15082#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15084#L556 assume !(main_~val~0#1 < 0); 15126#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15125#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15124#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15123#L556 assume !(main_~val~0#1 < 0); 15122#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15121#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15120#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15119#L556 assume !(main_~val~0#1 < 0); 15118#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15117#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15116#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15115#L556 assume !(main_~val~0#1 < 0); 15114#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15113#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15112#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15111#L556 assume !(main_~val~0#1 < 0); 15110#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15109#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15108#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15107#L556 assume !(main_~val~0#1 < 0); 15106#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15105#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15104#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15103#L556 assume !(main_~val~0#1 < 0); 15102#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15101#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15100#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15099#L556 assume !(main_~val~0#1 < 0); 15098#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15097#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15096#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15095#L556 assume !(main_~val~0#1 < 0); 15094#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15093#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15092#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15089#L556 assume !(main_~val~0#1 < 0); 15091#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15090#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15088#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 15073#L554-4 main_~j~0#1 := 0; 15074#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15085#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15175#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15174#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15086#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15081#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15087#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15069#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15070#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15172#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15171#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15170#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15169#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15167#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15166#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15165#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15164#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15162#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15161#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15160#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15159#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15157#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15156#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15155#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15154#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15152#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15151#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15150#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15149#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15147#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15146#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15145#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15144#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15142#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15141#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15140#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15139#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15137#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15136#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15135#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15134#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15133#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15130#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15129#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15127#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15079#L562-3 [2024-11-19 14:20:59,955 INFO L747 eck$LassoCheckResult]: Loop: 15079#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15078#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 15079#L562-3 [2024-11-19 14:20:59,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:20:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash 467367277, now seen corresponding path program 22 times [2024-11-19 14:20:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:20:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167607883] [2024-11-19 14:20:59,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:20:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:20:59,985 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:20:59,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:21:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 190 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:21:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:21:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167607883] [2024-11-19 14:21:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167607883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:21:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102699782] [2024-11-19 14:21:00,463 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:21:00,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:21:00,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:00,465 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:21:00,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Waiting until timeout for monitored process [2024-11-19 14:21:00,579 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:21:00,579 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:21:00,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:21:00,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:21:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:21:01,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:21:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:21:01,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102699782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:21:01,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:21:01,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2024-11-19 14:21:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162579756] [2024-11-19 14:21:01,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:21:01,315 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:21:01,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 22 times [2024-11-19 14:21:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160493870] [2024-11-19 14:21:01,315 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:21:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:01,319 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:21:01,319 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:21:01,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:01,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:01,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:21:01,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-19 14:21:01,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1258, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 14:21:01,350 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. cyclomatic complexity: 39 Second operand has 41 states, 40 states have (on average 3.8) internal successors, (152), 41 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:21:01,610 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2024-11-19 14:21:01,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 213 transitions. [2024-11-19 14:21:01,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:21:01,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 118 states and 145 transitions. [2024-11-19 14:21:01,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:21:01,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:21:01,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 145 transitions. [2024-11-19 14:21:01,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:21:01,612 INFO L218 hiAutomatonCegarLoop]: Abstraction has 118 states and 145 transitions. [2024-11-19 14:21:01,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 145 transitions. [2024-11-19 14:21:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-11-19 14:21:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2024-11-19 14:21:01,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-11-19 14:21:01,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 14:21:01,614 INFO L425 stractBuchiCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-11-19 14:21:01,614 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-19 14:21:01,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 141 transitions. [2024-11-19 14:21:01,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:21:01,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:21:01,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:21:01,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:21:01,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:21:01,615 INFO L745 eck$LassoCheckResult]: Stem: 15983#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15971#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 15972#L551 assume !(main_~length~0#1 < 1); 15981#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 15975#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15976#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15966#L556 assume !(main_~val~0#1 < 0); 15967#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15968#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15982#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15984#L556 assume !(main_~val~0#1 < 0); 16080#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16079#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16078#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16077#L556 assume !(main_~val~0#1 < 0); 16076#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16075#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16074#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16073#L556 assume !(main_~val~0#1 < 0); 16072#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16071#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16070#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16069#L556 assume !(main_~val~0#1 < 0); 16068#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16067#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16066#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16065#L556 assume !(main_~val~0#1 < 0); 16064#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16063#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16062#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16061#L556 assume !(main_~val~0#1 < 0); 16060#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16059#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16058#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16057#L556 assume !(main_~val~0#1 < 0); 16056#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16055#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16054#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16053#L556 assume !(main_~val~0#1 < 0); 16052#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16051#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16050#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16049#L556 assume !(main_~val~0#1 < 0); 16048#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16047#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16046#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16045#L556 assume !(main_~val~0#1 < 0); 16044#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16043#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16042#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15989#L556 assume !(main_~val~0#1 < 0); 15995#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15992#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15988#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 15973#L554-4 main_~j~0#1 := 0; 15974#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15985#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15986#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15969#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15970#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15980#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16041#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16040#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16039#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16037#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16036#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16035#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16034#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16032#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16031#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16030#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16029#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16027#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16026#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16025#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16024#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16022#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16021#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16020#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16019#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16017#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16016#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16015#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16014#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16012#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16011#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16010#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16009#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16007#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16006#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16005#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16004#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 16002#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16001#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16000#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15999#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15998#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15994#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15993#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15990#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 15978#L562-3 [2024-11-19 14:21:01,615 INFO L747 eck$LassoCheckResult]: Loop: 15978#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15977#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 15978#L562-3 [2024-11-19 14:21:01,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash 753705062, now seen corresponding path program 23 times [2024-11-19 14:21:01,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:01,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440940961] [2024-11-19 14:21:01,616 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:21:01,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:01,647 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-11-19 14:21:01,647 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:21:01,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:01,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 23 times [2024-11-19 14:21:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:01,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150739039] [2024-11-19 14:21:01,669 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:21:01,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:01,672 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:21:01,672 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:21:01,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:01,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:01,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1538906901, now seen corresponding path program 11 times [2024-11-19 14:21:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:01,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031685242] [2024-11-19 14:21:01,674 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:21:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:01,709 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-11-19 14:21:01,709 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:21:01,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:01,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:17,243 WARN L286 SmtUtils]: Spent 15.48s on a formula simplification. DAG size of input: 384 DAG size of output: 284 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-19 14:21:18,932 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:21:18,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:21:18,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:21:18,932 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:21:18,932 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:21:18,933 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:18,933 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:21:18,933 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:21:18,933 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration27_Lasso [2024-11-19 14:21:18,933 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:21:18,933 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:21:18,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:18,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:18,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:18,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:18,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:18,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:18,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:24,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:24,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:24,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:24,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:24,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:24,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:24,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:24,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:24,635 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:21:24,635 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:21:24,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,637 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2024-11-19 14:21:24,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:24,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:24,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:24,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,665 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2024-11-19 14:21:24,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:24,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:24,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:24,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:24,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,690 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2024-11-19 14:21:24,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:24,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:24,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:24,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:24,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,721 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2024-11-19 14:21:24,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:24,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:24,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:24,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:24,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,749 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2024-11-19 14:21:24,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:24,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:24,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:24,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:24,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,780 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2024-11-19 14:21:24,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:24,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:24,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:24,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2024-11-19 14:21:24,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,804 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2024-11-19 14:21:24,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:24,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:24,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:24,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,841 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2024-11-19 14:21:24,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:24,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:24,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2024-11-19 14:21:24,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,869 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2024-11-19 14:21:24,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:24,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:24,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:24,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,898 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2024-11-19 14:21:24,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:24,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:24,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2024-11-19 14:21:24,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,927 INFO L229 MonitoredProcess]: Starting monitored process 210 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2024-11-19 14:21:24,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:24,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:24,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:24,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,955 INFO L229 MonitoredProcess]: Starting monitored process 211 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2024-11-19 14:21:24,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:24,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:24,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:24,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:24,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:24,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:24,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:24,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:24,988 INFO L229 MonitoredProcess]: Starting monitored process 212 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:24,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2024-11-19 14:21:24,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:24,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:24,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:24,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:25,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:25,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:25,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:25,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:25,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:25,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:25,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:25,017 INFO L229 MonitoredProcess]: Starting monitored process 213 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:25,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2024-11-19 14:21:25,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:25,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:25,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:25,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:25,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:25,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:25,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:25,042 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:25,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2024-11-19 14:21:25,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:25,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:25,063 INFO L229 MonitoredProcess]: Starting monitored process 214 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:25,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2024-11-19 14:21:25,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:25,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:25,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:25,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:25,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:25,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:25,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:25,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:25,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Ended with exit code 0 [2024-11-19 14:21:25,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:25,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:25,096 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:25,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2024-11-19 14:21:25,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:25,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:25,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:25,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:25,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:25,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:25,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:25,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:25,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:25,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:25,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:25,125 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:25,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2024-11-19 14:21:25,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:25,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:25,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:25,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:25,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:25,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:25,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:25,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:25,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:25,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:25,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:25,154 INFO L229 MonitoredProcess]: Starting monitored process 217 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:25,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2024-11-19 14:21:25,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:25,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:25,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:25,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:25,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:25,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:25,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:25,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:25,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:25,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:25,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:25,188 INFO L229 MonitoredProcess]: Starting monitored process 218 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:25,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2024-11-19 14:21:25,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:25,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:25,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:25,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:25,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:25,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:25,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:25,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:25,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:25,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:25,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:25,217 INFO L229 MonitoredProcess]: Starting monitored process 219 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:25,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2024-11-19 14:21:25,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:25,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:25,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:25,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:25,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:25,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:25,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:25,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:25,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Ended with exit code 0 [2024-11-19 14:21:25,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:25,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:25,244 INFO L229 MonitoredProcess]: Starting monitored process 220 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:25,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2024-11-19 14:21:25,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:25,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:25,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:25,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:25,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:25,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:21:25,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:21:25,261 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:21:25,269 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-19 14:21:25,270 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-19 14:21:25,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:25,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:25,272 INFO L229 MonitoredProcess]: Starting monitored process 221 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:25,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2024-11-19 14:21:25,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:21:25,284 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:21:25,284 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:21:25,284 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 44 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 44 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-11-19 14:21:25,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Ended with exit code 0 [2024-11-19 14:21:25,398 INFO L156 tatePredicateManager]: 26 out of 27 supporting invariants were superfluous and have been removed [2024-11-19 14:21:25,399 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:21:25,399 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:21:25,399 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-19 14:21:25,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:25,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:21:25,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:21:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:25,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:21:25,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:21:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:21:25,678 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-19 14:21:25,678 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 141 transitions. cyclomatic complexity: 40 Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:25,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 141 transitions. cyclomatic complexity: 40. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 116 states and 143 transitions. Complement of second has 4 states. [2024-11-19 14:21:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:21:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:21:25,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 100 letters. Loop has 2 letters. [2024-11-19 14:21:25,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:21:25,699 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:21:25,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:25,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:21:25,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:21:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:26,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:21:26,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:21:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:21:26,022 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-19 14:21:26,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 141 transitions. cyclomatic complexity: 40 Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:26,046 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 141 transitions. cyclomatic complexity: 40. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 116 states and 143 transitions. Complement of second has 4 states. [2024-11-19 14:21:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:21:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:21:26,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 100 letters. Loop has 2 letters. [2024-11-19 14:21:26,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:21:26,047 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:21:26,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:26,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:21:26,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:21:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:26,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:21:26,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:21:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:21:26,387 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-19 14:21:26,388 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 141 transitions. cyclomatic complexity: 40 Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:26,691 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 141 transitions. cyclomatic complexity: 40. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 140 states and 180 transitions. Complement of second has 30 states. [2024-11-19 14:21:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:21:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 93 transitions. [2024-11-19 14:21:26,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 93 transitions. Stem has 100 letters. Loop has 2 letters. [2024-11-19 14:21:26,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:21:26,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 93 transitions. Stem has 102 letters. Loop has 2 letters. [2024-11-19 14:21:26,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:21:26,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 93 transitions. Stem has 100 letters. Loop has 4 letters. [2024-11-19 14:21:26,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:21:26,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 180 transitions. [2024-11-19 14:21:26,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:21:26,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 135 states and 173 transitions. [2024-11-19 14:21:26,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:21:26,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:21:26,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 173 transitions. [2024-11-19 14:21:26,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:21:26,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 135 states and 173 transitions. [2024-11-19 14:21:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 173 transitions. [2024-11-19 14:21:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 120. [2024-11-19 14:21:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.225) internal successors, (147), 119 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2024-11-19 14:21:26,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 147 transitions. [2024-11-19 14:21:26,696 INFO L425 stractBuchiCegarLoop]: Abstraction has 120 states and 147 transitions. [2024-11-19 14:21:26,696 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-11-19 14:21:26,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 147 transitions. [2024-11-19 14:21:26,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:21:26,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:21:26,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:21:26,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:21:26,697 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:21:26,697 INFO L745 eck$LassoCheckResult]: Stem: 17609#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 17597#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 17598#L551 assume !(main_~length~0#1 < 1); 17605#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 17599#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 17600#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17608#L556 assume !(main_~val~0#1 < 0); 17654#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17606#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17607#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17590#L556 assume !(main_~val~0#1 < 0); 17591#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17592#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17653#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17652#L556 assume !(main_~val~0#1 < 0); 17651#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17650#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17649#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17648#L556 assume !(main_~val~0#1 < 0); 17647#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17646#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17645#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17644#L556 assume !(main_~val~0#1 < 0); 17643#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17642#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17641#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17640#L556 assume !(main_~val~0#1 < 0); 17639#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17638#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17637#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17636#L556 assume !(main_~val~0#1 < 0); 17635#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17634#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17633#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17632#L556 assume !(main_~val~0#1 < 0); 17631#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17630#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17629#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17628#L556 assume !(main_~val~0#1 < 0); 17627#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17626#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17625#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17624#L556 assume !(main_~val~0#1 < 0); 17623#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17622#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17621#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17620#L556 assume !(main_~val~0#1 < 0); 17619#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17618#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17617#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17614#L556 assume !(main_~val~0#1 < 0); 17616#L556-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 17615#L554-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17613#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 17595#L554-4 main_~j~0#1 := 0; 17596#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17610#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17708#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17707#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17611#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17604#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17612#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17593#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17594#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17705#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17704#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17703#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17702#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17700#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17699#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17698#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17697#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17695#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17694#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17693#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17692#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17690#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17689#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17688#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17687#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17685#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17684#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17683#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17682#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17680#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17679#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17678#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17677#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17675#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17674#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17673#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17672#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17670#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17669#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17668#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17667#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17665#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17664#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17663#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17662#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17661#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17658#L562-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17657#L561-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17655#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 17602#L562-3 [2024-11-19 14:21:26,697 INFO L747 eck$LassoCheckResult]: Loop: 17602#L562-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17601#L562-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 17602#L562-3 [2024-11-19 14:21:26,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1420782149, now seen corresponding path program 24 times [2024-11-19 14:21:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925946948] [2024-11-19 14:21:26,698 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:21:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:26,725 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-11-19 14:21:26,725 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:21:26,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Ended with exit code 0 [2024-11-19 14:21:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 231 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:21:27,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:21:27,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925946948] [2024-11-19 14:21:27,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925946948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:21:27,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29871027] [2024-11-19 14:21:27,156 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:21:27,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:21:27,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:27,160 INFO L229 MonitoredProcess]: Starting monitored process 222 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:21:27,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (222)] Waiting until timeout for monitored process