./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f 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/hh2012-ex3.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 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:27:01,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:27:01,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:27:01,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:27:01,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:27:01,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:27:01,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:27:01,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:27:01,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:27:01,308 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:27:01,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:27:01,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:27:01,309 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:27:01,310 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:27:01,310 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:27:01,312 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:27:01,313 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:27:01,315 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:27:01,316 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:27:01,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:27:01,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:27:01,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:27:01,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:27:01,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:27:01,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:27:01,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:27:01,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:27:01,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:27:01,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:27:01,319 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:27:01,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:27:01,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:27:01,320 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:27:01,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:27:01,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:27:01,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:27:01,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:27:01,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:27:01,325 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:27:01,325 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 -> 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb [2024-11-12 21:27:01,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:27:01,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:27:01,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:27:01,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:27:01,624 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:27:01,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-11-12 21:27:03,117 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:27:03,297 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:27:03,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-11-12 21:27:03,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e72a955/48cdd541c95041c4901455bf4b0e2f73/FLAGaef631e78 [2024-11-12 21:27:03,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e72a955/48cdd541c95041c4901455bf4b0e2f73 [2024-11-12 21:27:03,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:27:03,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:27:03,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:27:03,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:27:03,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:27:03,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386a382b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03, skipping insertion in model container [2024-11-12 21:27:03,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:27:03,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:27:03,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:27:03,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:27:03,578 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:27:03,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03 WrapperNode [2024-11-12 21:27:03,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:27:03,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:27:03,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:27:03,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:27:03,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,609 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 11, calls inlined = 18, statements flattened = 92 [2024-11-12 21:27:03,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:27:03,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:27:03,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:27:03,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:27:03,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,638 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-12 21:27:03,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:27:03,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:27:03,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:27:03,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:27:03,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (1/1) ... [2024-11-12 21:27:03,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:03,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:03,696 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-12 21:27:03,699 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-12 21:27:03,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:27:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:27:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:27:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:27:03,795 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:27:03,797 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:27:03,987 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-12 21:27:03,987 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:27:04,004 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:27:04,005 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 21:27:04,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:27:04 BoogieIcfgContainer [2024-11-12 21:27:04,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:27:04,007 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:27:04,007 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:27:04,010 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:27:04,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:27:04,010 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:27:03" (1/3) ... [2024-11-12 21:27:04,011 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15373dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:27:04, skipping insertion in model container [2024-11-12 21:27:04,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:27:04,011 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:03" (2/3) ... [2024-11-12 21:27:04,012 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15373dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:27:04, skipping insertion in model container [2024-11-12 21:27:04,012 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:27:04,012 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:27:04" (3/3) ... [2024-11-12 21:27:04,013 INFO L332 chiAutomizerObserver]: Analyzing ICFG hh2012-ex3.i [2024-11-12 21:27:04,103 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:27:04,103 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:27:04,103 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:27:04,104 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:27:04,104 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:27:04,104 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:27:04,105 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:27:04,105 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:27:04,109 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-12 21:27:04,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2024-11-12 21:27:04,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:04,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:04,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:04,129 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:27:04,130 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:27:04,130 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-12 21:27:04,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2024-11-12 21:27:04,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:04,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:04,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:04,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:27:04,143 INFO L747 eck$LassoCheckResult]: Stem: "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(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:27:04,144 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0;" "assume !(main_~j~0#1 < 4);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 - main_~j~0#1);havoc main_~j~0#1;" [2024-11-12 21:27:04,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:04,155 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 21:27:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:04,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509463014] [2024-11-12 21:27:04,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:04,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:04,264 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:04,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:04,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1135295544, now seen corresponding path program 1 times [2024-11-12 21:27:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:04,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233915087] [2024-11-12 21:27:04,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:04,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233915087] [2024-11-12 21:27:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233915087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339323669] [2024-11-12 21:27:04,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:04,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:04,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:04,431 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-12 21:27:04,433 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-12 21:27:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:04,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:04,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:04,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:27:04,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339323669] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:27:04,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:27:04,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2024-11-12 21:27:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399761780] [2024-11-12 21:27:04,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:04,547 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:27:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:04,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 21:27:04,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 21:27:04,580 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 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-12 21:27:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:04,663 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2024-11-12 21:27:04,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 60 transitions. [2024-11-12 21:27:04,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-12 21:27:04,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 31 states and 32 transitions. [2024-11-12 21:27:04,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-12 21:27:04,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-12 21:27:04,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 32 transitions. [2024-11-12 21:27:04,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:04,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-12 21:27:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 32 transitions. [2024-11-12 21:27:04,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-12 21:27:04,709 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-12 21:27:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-11-12 21:27:04,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-12 21:27:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 21:27:04,721 INFO L426 stractBuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-12 21:27:04,721 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:27:04,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 32 transitions. [2024-11-12 21:27:04,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-12 21:27:04,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:04,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:04,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:04,723 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-12 21:27:04,723 INFO L747 eck$LassoCheckResult]: Stem: "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(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:27:04,723 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 4);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 - main_~j~0#1);havoc main_~j~0#1;" [2024-11-12 21:27:04,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-12 21:27:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:04,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121732174] [2024-11-12 21:27:04,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:04,734 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:04,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:04,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash -257874632, now seen corresponding path program 1 times [2024-11-12 21:27:04,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:04,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254187255] [2024-11-12 21:27:04,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:04,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:04,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:04,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254187255] [2024-11-12 21:27:04,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254187255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:04,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747580947] [2024-11-12 21:27:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:04,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:04,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:05,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:27:05,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 21:27:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:05,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:05,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:05,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:27:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747580947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:27:05,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:27:05,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-12 21:27:05,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867572433] [2024-11-12 21:27:05,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:05,245 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:27:05,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:05,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 21:27:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 21:27:05,247 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-12 21:27:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:05,316 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-11-12 21:27:05,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2024-11-12 21:27:05,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-12 21:27:05,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 50 transitions. [2024-11-12 21:27:05,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-12 21:27:05,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-12 21:27:05,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 50 transitions. [2024-11-12 21:27:05,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:05,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 50 transitions. [2024-11-12 21:27:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 50 transitions. [2024-11-12 21:27:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-12 21:27:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:27:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2024-11-12 21:27:05,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 50 transitions. [2024-11-12 21:27:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 21:27:05,327 INFO L426 stractBuchiCegarLoop]: Abstraction has 49 states and 50 transitions. [2024-11-12 21:27:05,327 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 21:27:05,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 50 transitions. [2024-11-12 21:27:05,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-12 21:27:05,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:05,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:05,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:05,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:27:05,329 INFO L747 eck$LassoCheckResult]: Stem: "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(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" [2024-11-12 21:27:05,330 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 4);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 - main_~j~0#1);havoc main_~j~0#1;" [2024-11-12 21:27:05,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-12 21:27:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:05,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840164457] [2024-11-12 21:27:05,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:05,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:05,341 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:05,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:05,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1028574776, now seen corresponding path program 2 times [2024-11-12 21:27:05,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:05,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916582652] [2024-11-12 21:27:05,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:05,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:05,420 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:05,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:05,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1757615670, now seen corresponding path program 1 times [2024-11-12 21:27:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:05,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718994649] [2024-11-12 21:27:05,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:05,499 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:05,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:06,564 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:06,565 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:06,565 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:06,565 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:06,565 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:27:06,565 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:06,566 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:06,566 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:06,566 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex3.i_Iteration3_Loop [2024-11-12 21:27:06,566 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:06,566 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:06,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,659 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:06,660 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:27:06,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:06,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:06,666 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-12 21:27:06,669 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-12 21:27:06,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:06,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:06,691 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:06,692 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-12 21:27:06,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-12 21:27:06,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:06,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:06,709 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-12 21:27:06,711 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-12 21:27:06,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:06,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:06,739 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:06,739 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 21:27:06,757 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-12 21:27:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:06,759 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-12 21:27:06,760 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-12 21:27:06,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:06,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:06,773 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:06,773 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-12 21:27:06,790 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-12 21:27:06,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:06,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:06,792 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-12 21:27:06,793 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-12 21:27:06,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:06,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:06,829 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-12 21:27:06,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:06,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:06,832 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-12 21:27:06,833 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-12 21:27:06,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:27:06,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:06,877 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:27:06,881 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-12 21:27:06,882 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:06,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:06,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:06,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:06,882 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:27:06,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:06,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:06,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:06,883 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex3.i_Iteration3_Loop [2024-11-12 21:27:06,883 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:06,883 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:06,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:06,946 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:06,950 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:27:06,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:06,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:06,953 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-12 21:27:06,956 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-12 21:27:06,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:27:06,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:06,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:06,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:06,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:06,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:06,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:06,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:06,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:07,003 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-12 21:27:07,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:07,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:07,007 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-12 21:27:07,008 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-12 21:27:07,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:27:07,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:07,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:07,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:07,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:07,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:07,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:07,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:07,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:07,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-12 21:27:07,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:07,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:07,044 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-12 21:27:07,047 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-12 21:27:07,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:27:07,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:07,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:07,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:07,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:07,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:07,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:07,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:07,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:07,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:07,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:07,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:07,085 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-12 21:27:07,086 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-12 21:27:07,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:27:07,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:07,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:07,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:07,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:07,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:07,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:07,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:07,104 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:27:07,107 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:27:07,107 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 21:27:07,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:07,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:07,111 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-12 21:27:07,114 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-12 21:27:07,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:27:07,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:27:07,116 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:27:07,117 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-12 21:27:07,133 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-12 21:27:07,136 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:27:07,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:07,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:07,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:07,224 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-12 21:27:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:07,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 21:27:07,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:27:07,723 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2024-11-12 21:27:07,724 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 50 transitions. cyclomatic complexity: 2 Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-12 21:27:07,809 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 50 transitions. cyclomatic complexity: 2. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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 141 states and 144 transitions. Complement of second has 7 states. [2024-11-12 21:27:07,812 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-12 21:27:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-12 21:27:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-12 21:27:07,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 47 letters. [2024-11-12 21:27:07,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:07,817 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:27:07,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:07,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:07,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:07,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 21:27:07,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:27:08,237 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2024-11-12 21:27:08,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 50 transitions. cyclomatic complexity: 2 Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-12 21:27:08,460 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 50 transitions. cyclomatic complexity: 2. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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 179 states and 184 transitions. Complement of second has 17 states. [2024-11-12 21:27:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-11-12 21:27:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-12 21:27:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2024-11-12 21:27:08,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 2 letters. Loop has 47 letters. [2024-11-12 21:27:08,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:08,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 49 letters. Loop has 47 letters. [2024-11-12 21:27:08,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 2 letters. Loop has 94 letters. [2024-11-12 21:27:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:08,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 184 transitions. [2024-11-12 21:27:08,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2024-11-12 21:27:08,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 152 states and 156 transitions. [2024-11-12 21:27:08,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-11-12 21:27:08,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2024-11-12 21:27:08,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 156 transitions. [2024-11-12 21:27:08,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:27:08,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 156 transitions. [2024-11-12 21:27:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 156 transitions. [2024-11-12 21:27:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 106. [2024-11-12 21:27:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.028301886792453) internal successors, (109), 105 states have internal predecessors, (109), 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-12 21:27:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2024-11-12 21:27:08,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 109 transitions. [2024-11-12 21:27:08,488 INFO L426 stractBuchiCegarLoop]: Abstraction has 106 states and 109 transitions. [2024-11-12 21:27:08,488 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 21:27:08,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 109 transitions. [2024-11-12 21:27:08,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-12 21:27:08,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:08,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:08,493 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:27:08,493 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:27:08,493 INFO L747 eck$LassoCheckResult]: Stem: "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(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~post2#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0;" "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" [2024-11-12 21:27:08,493 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !!(main_~j~0#1 < 4);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_#t~post2#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(main_~j~0#1 < 4);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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_~i~0#1 <= 3 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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;" "assume !(0 == __VERIFIER_assert_~cond#1);" "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 - main_~j~0#1);havoc main_~j~0#1;" "assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0;" [2024-11-12 21:27:08,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:08,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1050452364, now seen corresponding path program 1 times [2024-11-12 21:27:08,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:08,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938576105] [2024-11-12 21:27:08,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:08,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:08,507 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:08,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:08,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash 722930716, now seen corresponding path program 3 times [2024-11-12 21:27:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:08,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842742801] [2024-11-12 21:27:08,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:08,551 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:08,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:08,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:08,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1087022409, now seen corresponding path program 2 times [2024-11-12 21:27:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:08,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095776381] [2024-11-12 21:27:08,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:08,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:08,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:08,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095776381] [2024-11-12 21:27:08,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095776381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:08,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843532068] [2024-11-12 21:27:08,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 21:27:08,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:08,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:08,746 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:27:08,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-12 21:27:08,797 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:27:08,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:27:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-12 21:27:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244501739] [2024-11-12 21:27:08,798 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:09,468 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:09,468 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:09,468 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:09,468 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:09,468 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:27:09,468 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,468 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:09,468 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:09,468 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex3.i_Iteration4_Loop [2024-11-12 21:27:09,468 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:09,469 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:09,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:09,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:09,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:09,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:09,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:09,532 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:09,532 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:27:09,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,534 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-12 21:27:09,535 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-12 21:27:09,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:09,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:09,547 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:09,547 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2#1=0} Honda state: {ULTIMATE.start_main_#t~post2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 21:27:09,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-12 21:27:09,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,559 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-12 21:27:09,560 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-12 21:27:09,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:09,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:09,573 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:09,573 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-12 21:27:09,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:09,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,586 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-12 21:27:09,587 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-12 21:27:09,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:09,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:09,602 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:09,602 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 21:27:09,614 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-12 21:27:09,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,616 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-12 21:27:09,618 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-12 21:27:09,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:09,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:09,632 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:09,632 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-12 21:27:09,643 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-12 21:27:09,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,644 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-12 21:27:09,645 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-12 21:27:09,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:09,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:09,668 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-12 21:27:09,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,670 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-12 21:27:09,671 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-12 21:27:09,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:27:09,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:09,745 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:27:09,751 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-12 21:27:09,752 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:09,752 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:09,752 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:09,752 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:09,752 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:27:09,752 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,752 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:09,752 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:09,752 INFO L132 ssoRankerPreferences]: Filename of dumped script: hh2012-ex3.i_Iteration4_Loop [2024-11-12 21:27:09,752 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:09,752 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:09,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:09,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:09,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:09,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:09,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:09,821 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:09,821 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:27:09,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,823 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-12 21:27:09,824 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-12 21:27:09,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:27:09,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:09,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:09,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:09,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:09,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:09,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:09,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:09,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:09,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-12 21:27:09,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,859 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-12 21:27:09,861 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-12 21:27:09,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:27:09,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:09,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:09,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:09,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:09,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:09,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:09,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:09,881 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:09,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-12 21:27:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,898 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-12 21:27:09,899 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-12 21:27:09,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:27:09,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:09,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:09,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:09,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:09,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:09,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:09,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:09,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:09,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-12 21:27:09,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,933 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:27:09,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-12 21:27:09,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:27:09,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:09,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:09,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:09,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:09,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:09,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:09,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:09,952 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:27:09,957 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:27:09,957 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 21:27:09,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:09,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:09,960 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:27:09,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-12 21:27:09,962 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:27:09,962 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:27:09,962 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:27:09,962 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2024-11-12 21:27:09,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:09,976 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:27:09,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:10,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:10,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:10,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 21:27:10,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:10,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:27:10,241 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-12 21:27:10,242 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 109 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:27:10,352 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 109 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 291 states and 297 transitions. Complement of second has 11 states. [2024-11-12 21:27:10,354 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-12 21:27:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:27:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2024-11-12 21:27:10,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 69 transitions. Stem has 12 letters. Loop has 47 letters. [2024-11-12 21:27:10,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:10,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 69 transitions. Stem has 59 letters. Loop has 47 letters. [2024-11-12 21:27:10,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:10,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 69 transitions. Stem has 12 letters. Loop has 94 letters. [2024-11-12 21:27:10,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:10,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 291 states and 297 transitions. [2024-11-12 21:27:10,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2024-11-12 21:27:10,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 291 states to 245 states and 251 transitions. [2024-11-12 21:27:10,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-11-12 21:27:10,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2024-11-12 21:27:10,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 251 transitions. [2024-11-12 21:27:10,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:27:10,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 245 states and 251 transitions. [2024-11-12 21:27:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 251 transitions. [2024-11-12 21:27:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 172. [2024-11-12 21:27:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 172 states have (on average 1.0348837209302326) internal successors, (178), 171 states have internal predecessors, (178), 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-12 21:27:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 178 transitions. [2024-11-12 21:27:10,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 172 states and 178 transitions. [2024-11-12 21:27:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:10,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 21:27:10,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 21:27:10,393 INFO L87 Difference]: Start difference. First operand 172 states and 178 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:27:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:10,439 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2024-11-12 21:27:10,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 151 transitions. [2024-11-12 21:27:10,441 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 21:27:10,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 0 states and 0 transitions. [2024-11-12 21:27:10,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-12 21:27:10,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-12 21:27:10,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-12 21:27:10,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:10,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 21:27:10,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 21:27:10,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 21:27:10,442 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 21:27:10,443 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 21:27:10,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-12 21:27:10,443 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 21:27:10,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-12 21:27:10,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 09:27:10 BoogieIcfgContainer [2024-11-12 21:27:10,450 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 21:27:10,450 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 21:27:10,450 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 21:27:10,450 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 21:27:10,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:27:04" (3/4) ... [2024-11-12 21:27:10,453 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 21:27:10,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 21:27:10,455 INFO L158 Benchmark]: Toolchain (without parser) took 7129.28ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 99.5MB in the beginning and 136.3MB in the end (delta: -36.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:10,455 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 113.2MB. Free memory was 73.1MB in the beginning and 72.9MB in the end (delta: 125.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:10,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.74ms. Allocated memory is still 165.7MB. Free memory was 99.3MB in the beginning and 87.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 21:27:10,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.47ms. Allocated memory is still 165.7MB. Free memory was 87.2MB in the beginning and 85.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:27:10,456 INFO L158 Benchmark]: Boogie Preprocessor took 46.13ms. Allocated memory is still 165.7MB. Free memory was 85.4MB in the beginning and 83.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:27:10,456 INFO L158 Benchmark]: RCFGBuilder took 349.02ms. Allocated memory is still 165.7MB. Free memory was 83.5MB in the beginning and 70.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 21:27:10,457 INFO L158 Benchmark]: BuchiAutomizer took 6443.03ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 70.5MB in the beginning and 136.3MB in the end (delta: -65.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:10,457 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 199.2MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:10,458 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.24ms. Allocated memory is still 113.2MB. Free memory was 73.1MB in the beginning and 72.9MB in the end (delta: 125.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.74ms. Allocated memory is still 165.7MB. Free memory was 99.3MB in the beginning and 87.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.47ms. Allocated memory is still 165.7MB. Free memory was 87.2MB in the beginning and 85.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.13ms. Allocated memory is still 165.7MB. Free memory was 85.4MB in the beginning and 83.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 349.02ms. Allocated memory is still 165.7MB. Free memory was 83.5MB in the beginning and 70.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6443.03ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 70.5MB in the beginning and 136.3MB in the end (delta: -65.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 199.2MB. Free memory is still 136.3MB. There was no memory consumed. 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 (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 7) and consists of 9 locations. One deterministic module has affine ranking function (((long long) -2 * i) + 5) and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 4.2s. Construction of modules took 0.3s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 119 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, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 58/116 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 517 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 347 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 170 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf93 smp100 dnf100 smp100 tf108 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 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-12 21:27:10,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-12 21:27:10,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:10,886 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-12 21:27:11,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE