./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:46:26,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:46:26,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:46:26,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:46:26,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:46:26,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:46:26,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:46:26,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:46:26,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:46:26,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:46:26,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:46:26,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:46:26,562 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:46:26,562 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:46:26,564 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:46:26,564 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:46:26,565 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:46:26,565 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:46:26,565 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:46:26,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:46:26,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:46:26,566 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:46:26,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:46:26,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:46:26,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:46:26,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:46:26,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:46:26,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:46:26,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:46:26,567 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:46:26,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:46:26,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:46:26,567 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:46:26,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:46:26,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:46:26,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:46:26,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:46:26,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:46:26,568 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:46:26,568 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 [2024-11-19 14:46:26,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:46:26,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:46:26,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:46:26,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:46:26,772 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:46:26,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-11-19 14:46:27,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:46:28,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:46:28,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-11-19 14:46:28,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8903c8aca/f84742564f4847739e615e1afe4d8d59/FLAGa01dd035a [2024-11-19 14:46:28,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8903c8aca/f84742564f4847739e615e1afe4d8d59 [2024-11-19 14:46:28,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:46:28,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:46:28,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:46:28,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:46:28,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:46:28,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f751174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28, skipping insertion in model container [2024-11-19 14:46:28,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:46:28,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:46:28,329 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:46:28,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:46:28,383 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:46:28,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28 WrapperNode [2024-11-19 14:46:28,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:46:28,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:46:28,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:46:28,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:46:28,389 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:46:28" (1/1) ... [2024-11-19 14:46:28,394 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:46:28" (1/1) ... [2024-11-19 14:46:28,408 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 11, calls inlined = 18, statements flattened = 90 [2024-11-19 14:46:28,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:46:28,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:46:28,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:46:28,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:46:28,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,426 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 14:46:28,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:46:28,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:46:28,442 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:46:28,442 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:46:28,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (1/1) ... [2024-11-19 14:46:28,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:28,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:28,474 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:46:28,475 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:46:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:46:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:46:28,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:46:28,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:46:28,565 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:46:28,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:46:28,682 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-19 14:46:28,683 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:46:28,698 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:46:28,698 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:46:28,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:46:28 BoogieIcfgContainer [2024-11-19 14:46:28,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:46:28,699 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:46:28,699 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:46:28,703 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:46:28,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:46:28,705 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:46:28" (1/3) ... [2024-11-19 14:46:28,706 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@668367ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:46:28, skipping insertion in model container [2024-11-19 14:46:28,706 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:46:28,706 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:28" (2/3) ... [2024-11-19 14:46:28,707 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@668367ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:46:28, skipping insertion in model container [2024-11-19 14:46:28,707 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:46:28,707 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:46:28" (3/3) ... [2024-11-19 14:46:28,708 INFO L332 chiAutomizerObserver]: Analyzing ICFG bh2017-ex1-poly.i [2024-11-19 14:46:28,744 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:46:28,744 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:46:28,744 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:46:28,744 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:46:28,744 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:46:28,744 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:46:28,744 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:46:28,744 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:46:28,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 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:46:28,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2024-11-19 14:46:28,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:28,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:28,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:46:28,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:28,764 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:46:28,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 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:46:28,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2024-11-19 14:46:28,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:28,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:28,767 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:46:28,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:28,772 INFO L745 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 24#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 46#L16-2true [2024-11-19 14:46:28,773 INFO L747 eck$LassoCheckResult]: Loop: 46#L16-2true assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 28#L18-2true assume !(main_~j~0#1 < 3); 30#L18-3true assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 23#L13-16true assume !(0 == __VERIFIER_assert_~cond#1); 13#L13-19true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 50#L13-20true assume !(0 == __VERIFIER_assert_~cond#1); 39#L13-23true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 34#L13-24true assume !(0 == __VERIFIER_assert_~cond#1); 18#L13-27true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 25#L13-28true assume !(0 == __VERIFIER_assert_~cond#1); 42#L13-31true havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := 1 + (main_~i~0#1 - (if main_~j~0#1 < 0 && 0 != main_~j~0#1 % 2 then 1 + main_~j~0#1 / 2 else main_~j~0#1 / 2));havoc main_~j~0#1; 46#L16-2true [2024-11-19 14:46:28,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:46:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457049837] [2024-11-19 14:46:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:28,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:28,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:28,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1135295544, now seen corresponding path program 1 times [2024-11-19 14:46:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35953972] [2024-11-19 14:46:28,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:28,966 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:46:28,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:28,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35953972] [2024-11-19 14:46:28,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35953972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:46:28,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:46:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:46:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803893749] [2024-11-19 14:46:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:46:28,971 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:28,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:28,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:46:28,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:46:28,997 INFO L87 Difference]: Start difference. First operand has 49 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:46:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:29,030 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-19 14:46:29,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 43 transitions. [2024-11-19 14:46:29,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-19 14:46:29,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 22 states and 23 transitions. [2024-11-19 14:46:29,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-19 14:46:29,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-19 14:46:29,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2024-11-19 14:46:29,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:46:29,039 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-19 14:46:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2024-11-19 14:46:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-19 14:46:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-19 14:46:29,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-19 14:46:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:46:29,060 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-19 14:46:29,060 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:46:29,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2024-11-19 14:46:29,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-19 14:46:29,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:29,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:29,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:46:29,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:29,063 INFO L745 eck$LassoCheckResult]: Stem: 118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 108#L16-2 [2024-11-19 14:46:29,063 INFO L747 eck$LassoCheckResult]: Loop: 108#L16-2 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 115#L18-2 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 114#L13 assume !(0 == __VERIFIER_assert_~cond#1); 105#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 106#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 111#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 112#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 113#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 120#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 121#L18-2 assume !(main_~j~0#1 < 3); 117#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 102#L13-16 assume !(0 == __VERIFIER_assert_~cond#1); 100#L13-19 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 101#L13-20 assume !(0 == __VERIFIER_assert_~cond#1); 103#L13-23 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 104#L13-24 assume !(0 == __VERIFIER_assert_~cond#1); 119#L13-27 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 110#L13-28 assume !(0 == __VERIFIER_assert_~cond#1); 109#L13-31 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := 1 + (main_~i~0#1 - (if main_~j~0#1 < 0 && 0 != main_~j~0#1 % 2 then 1 + main_~j~0#1 / 2 else main_~j~0#1 / 2));havoc main_~j~0#1; 108#L16-2 [2024-11-19 14:46:29,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:46:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:29,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906726042] [2024-11-19 14:46:29,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:29,069 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:46:29,069 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:29,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:29,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1841154240, now seen corresponding path program 1 times [2024-11-19 14:46:29,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805554500] [2024-11-19 14:46:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:29,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:29,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805554500] [2024-11-19 14:46:29,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805554500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:29,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754419244] [2024-11-19 14:46:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:29,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:29,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:29,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 14:46:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:29,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:46:29,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:29,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:29,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754419244] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:29,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:29,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-19 14:46:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272625449] [2024-11-19 14:46:29,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:29,311 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:29,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:29,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:46:29,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:46:29,312 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 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:46:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:29,340 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-19 14:46:29,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 32 transitions. [2024-11-19 14:46:29,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-19 14:46:29,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 32 transitions. [2024-11-19 14:46:29,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-19 14:46:29,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-19 14:46:29,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 32 transitions. [2024-11-19 14:46:29,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:46:29,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-19 14:46:29,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 32 transitions. [2024-11-19 14:46:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 14:46:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 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:46:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-11-19 14:46:29,347 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-19 14:46:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:46:29,348 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-19 14:46:29,348 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:46:29,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 32 transitions. [2024-11-19 14:46:29,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-19 14:46:29,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:29,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:29,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:46:29,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:29,353 INFO L745 eck$LassoCheckResult]: Stem: 293#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 282#L16-2 [2024-11-19 14:46:29,354 INFO L747 eck$LassoCheckResult]: Loop: 282#L16-2 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 290#L18-2 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 288#L13 assume !(0 == __VERIFIER_assert_~cond#1); 289#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 304#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 303#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 302#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 301#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 300#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 295#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 296#L18-2 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 299#L13 assume !(0 == __VERIFIER_assert_~cond#1); 279#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 280#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 285#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 286#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 287#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 291#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 297#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 298#L18-2 assume !(main_~j~0#1 < 3); 292#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 276#L13-16 assume !(0 == __VERIFIER_assert_~cond#1); 274#L13-19 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 275#L13-20 assume !(0 == __VERIFIER_assert_~cond#1); 277#L13-23 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 278#L13-24 assume !(0 == __VERIFIER_assert_~cond#1); 294#L13-27 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 283#L13-28 assume !(0 == __VERIFIER_assert_~cond#1); 284#L13-31 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := 1 + (main_~i~0#1 - (if main_~j~0#1 < 0 && 0 != main_~j~0#1 % 2 then 1 + main_~j~0#1 / 2 else main_~j~0#1 / 2));havoc main_~j~0#1; 282#L16-2 [2024-11-19 14:46:29,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:29,355 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:46:29,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:29,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216241876] [2024-11-19 14:46:29,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:46:29,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:29,364 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:46:29,364 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:29,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:29,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:29,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash -257874632, now seen corresponding path program 2 times [2024-11-19 14:46:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287376093] [2024-11-19 14:46:29,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:29,421 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:29,422 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:29,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:29,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:29,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2038304950, now seen corresponding path program 1 times [2024-11-19 14:46:29,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:29,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901837980] [2024-11-19 14:46:29,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:29,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:29,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:29,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:29,899 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:29,900 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:29,900 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:29,900 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:29,900 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:29,900 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:29,900 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:29,900 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:29,901 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration3_Loop [2024-11-19 14:46:29,901 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:29,901 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:29,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:29,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:29,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:29,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:29,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:29,961 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:29,961 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:29,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:29,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:29,965 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:46:29,966 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:46:29,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:29,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:29,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:46:29,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:29,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:29,999 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:46:30,000 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:46:30,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:30,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:30,043 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:30,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:30,047 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:30,047 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:30,047 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:30,048 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:30,048 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:30,048 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,048 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:30,048 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:30,048 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration3_Loop [2024-11-19 14:46:30,048 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:30,048 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:30,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:30,091 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:30,094 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:30,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:30,096 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:46:30,097 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:46:30,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:46:30,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:30,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:30,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:30,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:30,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:30,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:30,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:30,112 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:30,116 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:30,116 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:30,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:30,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:30,119 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:46:30,121 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:46:30,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:30,122 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:30,123 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:30,123 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7 Supporting invariants [] [2024-11-19 14:46:30,136 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:46:30,139 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:30,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:30,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:30,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:30,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:30,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:30,339 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:46:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:30,482 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-19 14:46:30,484 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 32 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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:46:30,539 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 32 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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) Result 87 states and 90 transitions. Complement of second has 7 states. [2024-11-19 14:46:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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:46:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-19 14:46:30,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 29 letters. [2024-11-19 14:46:30,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:30,545 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:30,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:30,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:30,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:30,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:30,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:30,817 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-19 14:46:30,817 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 32 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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:46:30,897 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 32 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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) Result 60 states and 63 transitions. Complement of second has 10 states. [2024-11-19 14:46:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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:46:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-11-19 14:46:30,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 2 letters. Loop has 29 letters. [2024-11-19 14:46:30,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:30,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 31 letters. Loop has 29 letters. [2024-11-19 14:46:30,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:30,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 2 letters. Loop has 58 letters. [2024-11-19 14:46:30,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:30,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 63 transitions. [2024-11-19 14:46:30,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-19 14:46:30,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 51 states and 54 transitions. [2024-11-19 14:46:30,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:46:30,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-19 14:46:30,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 54 transitions. [2024-11-19 14:46:30,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:30,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-11-19 14:46:30,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 54 transitions. [2024-11-19 14:46:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2024-11-19 14:46:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 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:46:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-19 14:46:30,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-19 14:46:30,905 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-19 14:46:30,905 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:46:30,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 44 transitions. [2024-11-19 14:46:30,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-19 14:46:30,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:30,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:30,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:46:30,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:30,906 INFO L745 eck$LassoCheckResult]: Stem: 708#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 689#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 690#L16-2 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 703#L18-2 [2024-11-19 14:46:30,906 INFO L747 eck$LassoCheckResult]: Loop: 703#L18-2 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 700#L13 assume !(0 == __VERIFIER_assert_~cond#1); 685#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 686#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 694#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 695#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 698#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 705#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 710#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 703#L18-2 [2024-11-19 14:46:30,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-11-19 14:46:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:30,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128122434] [2024-11-19 14:46:30,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:30,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:30,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:30,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash 507021115, now seen corresponding path program 1 times [2024-11-19 14:46:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:30,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968511051] [2024-11-19 14:46:30,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:30,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:30,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:30,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1050452364, now seen corresponding path program 1 times [2024-11-19 14:46:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108145758] [2024-11-19 14:46:30,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:30,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:30,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:31,024 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:31,024 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:31,024 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:31,024 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:31,024 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:31,024 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,024 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:31,024 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:31,025 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration4_Loop [2024-11-19 14:46:31,025 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:31,025 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:31,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,068 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:31,069 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:31,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,070 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:46:31,071 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:46:31,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,084 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:31,084 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:31,095 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:46:31,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,097 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:46:31,098 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:46:31,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,114 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:31,114 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:31,124 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:46:31,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,126 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:46:31,127 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:46:31,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:46:31,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,157 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:46:31,158 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:46:31,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:31,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,191 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:31,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:31,196 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:31,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:31,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:31,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:31,196 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:31,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:31,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:31,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration4_Loop [2024-11-19 14:46:31,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:31,196 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:31,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,265 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:31,265 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:31,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,267 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:46:31,268 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:46:31,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:46:31,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:31,291 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:46:31,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,294 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:46:31,295 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:46:31,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:46:31,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:31,319 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:46:31,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,321 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:46:31,322 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:46:31,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:46:31,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:31,339 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:31,339 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:31,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,340 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:46:31,341 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:46:31,342 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:31,342 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:31,342 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:31,342 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 3 Supporting invariants [] [2024-11-19 14:46:31,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-19 14:46:31,354 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:31,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:31,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:31,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:31,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:46:31,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:31,423 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:46:31,432 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:46:31,433 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:46:31,433 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 44 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:31,452 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 44 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 112 states and 116 transitions. Complement of second has 5 states. [2024-11-19 14:46:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2024-11-19 14:46:31,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 3 letters. Loop has 9 letters. [2024-11-19 14:46:31,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:31,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 12 letters. Loop has 9 letters. [2024-11-19 14:46:31,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:31,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 3 letters. Loop has 18 letters. [2024-11-19 14:46:31,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:31,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 116 transitions. [2024-11-19 14:46:31,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-19 14:46:31,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 77 states and 80 transitions. [2024-11-19 14:46:31,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-19 14:46:31,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:46:31,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 80 transitions. [2024-11-19 14:46:31,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:31,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-19 14:46:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 80 transitions. [2024-11-19 14:46:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2024-11-19 14:46:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 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:46:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2024-11-19 14:46:31,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 63 transitions. [2024-11-19 14:46:31,462 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2024-11-19 14:46:31,462 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:46:31,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 63 transitions. [2024-11-19 14:46:31,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-19 14:46:31,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:31,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:31,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:31,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:46:31,463 INFO L745 eck$LassoCheckResult]: Stem: 917#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 898#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 899#L16-2 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 918#L18-2 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 910#L13 assume !(0 == __VERIFIER_assert_~cond#1); 896#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 897#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 905#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 906#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 908#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 915#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 923#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 942#L18-2 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 939#L13 assume !(0 == __VERIFIER_assert_~cond#1); 940#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 935#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 936#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 931#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 932#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 927#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 928#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 924#L18-2 assume !(main_~j~0#1 < 3); 916#L18-3 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 891#L13-16 assume !(0 == __VERIFIER_assert_~cond#1); 889#L13-19 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 890#L13-20 assume !(0 == __VERIFIER_assert_~cond#1); 892#L13-23 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 893#L13-24 assume !(0 == __VERIFIER_assert_~cond#1); 919#L13-27 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 900#L13-28 assume !(0 == __VERIFIER_assert_~cond#1); 901#L13-31 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := 1 + (main_~i~0#1 - (if main_~j~0#1 < 0 && 0 != main_~j~0#1 % 2 then 1 + main_~j~0#1 / 2 else main_~j~0#1 / 2));havoc main_~j~0#1; 902#L16-2 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 911#L18-2 [2024-11-19 14:46:31,463 INFO L747 eck$LassoCheckResult]: Loop: 911#L18-2 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 909#L13 assume !(0 == __VERIFIER_assert_~cond#1); 894#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 895#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 903#L13-7 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 904#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 907#L13-11 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 914#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 920#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 911#L18-2 [2024-11-19 14:46:31,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1237055979, now seen corresponding path program 2 times [2024-11-19 14:46:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:31,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148310198] [2024-11-19 14:46:31,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:31,478 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:31,478 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:31,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:31,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:31,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:31,489 INFO L85 PathProgramCache]: Analyzing trace with hash 507021115, now seen corresponding path program 2 times [2024-11-19 14:46:31,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:31,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329197014] [2024-11-19 14:46:31,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:31,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:31,493 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:46:31,493 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:31,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:31,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:31,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:31,499 INFO L85 PathProgramCache]: Analyzing trace with hash 47716263, now seen corresponding path program 3 times [2024-11-19 14:46:31,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:31,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156955784] [2024-11-19 14:46:31,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:46:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:31,526 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:46:31,526 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:31,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:31,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:31,611 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:31,611 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:31,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:31,611 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:31,611 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:31,611 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,611 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:31,612 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:31,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration5_Loop [2024-11-19 14:46:31,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:31,612 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:31,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,652 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:31,653 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:31,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,655 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:46:31,656 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:46:31,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,668 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:31,668 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:31,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:31,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,680 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:46:31,681 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:46:31,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,695 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:31,695 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:31,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-19 14:46:31,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,707 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:46:31,708 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:46:31,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:31,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,731 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:46:31,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,733 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:46:31,734 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:46:31,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:31,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:31,867 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:31,873 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:46:31,873 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:31,873 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:31,873 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:31,873 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:31,873 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:31,873 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,873 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:31,873 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:31,873 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration5_Loop [2024-11-19 14:46:31,873 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:31,873 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:31,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:31,920 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:31,920 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:31,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,922 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:31,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:46:31,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:46:31,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:31,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-19 14:46:31,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,953 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:46:31,954 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:46:31,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:46:31,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:31,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-19 14:46:31,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:31,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:31,979 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:46:31,980 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:46:31,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:46:31,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:31,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:31,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:31,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:31,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:31,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:31,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:31,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:32,006 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:46:32,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:32,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:32,007 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:46:32,008 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:46:32,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:46:32,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:32,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:32,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:32,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:32,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:32,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:32,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:32,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:32,026 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:32,027 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:32,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:32,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:32,028 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:32,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:46:32,030 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:32,030 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:32,030 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:32,030 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2024-11-19 14:46:32,040 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:46:32,042 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:32,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:32,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:32,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,178 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:46:32,179 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-19 14:46:32,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:46:32,237 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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) Result 94 states and 98 transitions. Complement of second has 9 states. [2024-11-19 14:46:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:46:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2024-11-19 14:46:32,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 32 letters. Loop has 9 letters. [2024-11-19 14:46:32,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:32,238 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:32,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:32,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:32,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,351 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:46:32,351 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-19 14:46:32,351 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:46:32,453 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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) Result 94 states and 98 transitions. Complement of second has 13 states. [2024-11-19 14:46:32,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:46:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2024-11-19 14:46:32,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 32 letters. Loop has 9 letters. [2024-11-19 14:46:32,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:32,455 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:32,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:32,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:32,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:46:32,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:32,613 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:46:32,613 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-19 14:46:32,613 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:46:32,671 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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) Result 111 states and 118 transitions. Complement of second has 8 states. [2024-11-19 14:46:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:46:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2024-11-19 14:46:32,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 9 letters. [2024-11-19 14:46:32,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:32,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 41 letters. Loop has 9 letters. [2024-11-19 14:46:32,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:32,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 18 letters. [2024-11-19 14:46:32,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:32,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 118 transitions. [2024-11-19 14:46:32,676 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:46:32,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 0 states and 0 transitions. [2024-11-19 14:46:32,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:46:32,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:46:32,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:46:32,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:46:32,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:46:32,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:46:32,676 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:46:32,676 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:46:32,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:46:32,677 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:46:32,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:46:32,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:46:32 BoogieIcfgContainer [2024-11-19 14:46:32,687 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:46:32,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:46:32,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:46:32,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:46:32,688 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:46:28" (3/4) ... [2024-11-19 14:46:32,689 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:46:32,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:46:32,691 INFO L158 Benchmark]: Toolchain (without parser) took 4545.81ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 115.6MB in the beginning and 164.6MB in the end (delta: -49.1MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2024-11-19 14:46:32,692 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 56.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:46:32,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.46ms. Allocated memory is still 169.9MB. Free memory was 115.0MB in the beginning and 139.8MB in the end (delta: -24.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:46:32,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.06ms. Allocated memory is still 169.9MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:46:32,693 INFO L158 Benchmark]: Boogie Preprocessor took 33.01ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 135.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:46:32,694 INFO L158 Benchmark]: RCFGBuilder took 256.64ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 123.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:46:32,694 INFO L158 Benchmark]: BuchiAutomizer took 3987.86ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 123.1MB in the beginning and 165.7MB in the end (delta: -42.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-19 14:46:32,697 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 220.2MB. Free memory was 165.7MB in the beginning and 164.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:46:32,698 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 56.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.46ms. Allocated memory is still 169.9MB. Free memory was 115.0MB in the beginning and 139.8MB in the end (delta: -24.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.06ms. Allocated memory is still 169.9MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.01ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 135.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 256.64ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 123.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3987.86ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 123.1MB in the beginning and 165.7MB in the end (delta: -42.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 220.2MB. Free memory was 165.7MB in the beginning and 164.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 7) and consists of 6 locations. One deterministic module has affine ranking function (((long long) -1 * j) + 3) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * i) + 9) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/11 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 329 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 243 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 164 mSDtfsCounter, 243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq142 hnf95 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 14:46:32,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:32,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE