./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Parts.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Parts.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:20:18,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:20:18,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:20:18,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:20:18,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:20:18,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:20:18,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:20:18,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:20:18,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:20:18,161 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:20:18,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:20:18,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:20:18,162 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:20:18,163 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:20:18,165 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:20:18,165 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:20:18,165 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:20:18,165 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:20:18,166 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:20:18,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:20:18,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:20:18,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:20:18,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:20:18,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:20:18,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:20:18,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:20:18,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:20:18,171 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:20:18,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:20:18,171 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:20:18,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:20:18,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:20:18,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:20:18,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:20:18,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:20:18,172 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:20:18,172 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 [2024-11-09 15:20:18,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:20:18,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:20:18,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:20:18,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:20:18,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:20:18,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Parts.c [2024-11-09 15:20:19,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:20:19,779 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:20:19,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2024-11-09 15:20:19,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12e2e9d4f/9a549989fcfb471fb9d2d6e5a232cf15/FLAG4bd2205d6 [2024-11-09 15:20:20,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12e2e9d4f/9a549989fcfb471fb9d2d6e5a232cf15 [2024-11-09 15:20:20,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:20:20,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:20:20,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:20:20,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:20:20,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:20:20,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d94fca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20, skipping insertion in model container [2024-11-09 15:20:20,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:20:20,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:20:20,362 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:20:20,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:20:20,389 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:20:20,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20 WrapperNode [2024-11-09 15:20:20,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:20:20,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:20:20,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:20:20,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:20:20,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,414 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-11-09 15:20:20,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:20:20,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:20:20,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:20:20,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:20:20,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,429 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 15:20:20,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:20:20,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:20:20,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:20:20,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:20:20,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (1/1) ... [2024-11-09 15:20:20,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:20,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:20,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:20,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:20:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2024-11-09 15:20:20,513 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2024-11-09 15:20:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:20:20,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:20:20,561 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:20:20,563 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:20:20,690 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 15:20:20,690 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:20:20,699 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:20:20,700 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:20:20,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:20:20 BoogieIcfgContainer [2024-11-09 15:20:20,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:20:20,701 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:20:20,701 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:20:20,704 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:20:20,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:20:20,704 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:20:20" (1/3) ... [2024-11-09 15:20:20,705 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b9ce082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:20:20, skipping insertion in model container [2024-11-09 15:20:20,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:20:20,705 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:20" (2/3) ... [2024-11-09 15:20:20,705 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b9ce082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:20:20, skipping insertion in model container [2024-11-09 15:20:20,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:20:20,705 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:20:20" (3/3) ... [2024-11-09 15:20:20,706 INFO L332 chiAutomizerObserver]: Analyzing ICFG Parts.c [2024-11-09 15:20:20,748 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:20:20,748 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:20:20,748 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:20:20,748 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:20:20,748 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:20:20,748 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:20:20,748 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:20:20,749 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:20:20,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 15:20:20,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-09 15:20:20,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:20,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:20,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:20:20,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:20,770 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:20:20,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 15:20:20,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-09 15:20:20,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:20,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:20,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:20:20,772 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:20,778 INFO L745 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 23#L28true assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5#L31true assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 16#L34-3true [2024-11-09 15:20:20,778 INFO L747 eck$LassoCheckResult]: Loop: 16#L34-3true assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 12#L35-2true assume !true; 8#L35-3true havoc main_~q~0#1; 7#L34-2true main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 16#L34-3true [2024-11-09 15:20:20,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 1 times [2024-11-09 15:20:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:20,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818979210] [2024-11-09 15:20:20,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:20,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:20,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:20,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:20,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2137072, now seen corresponding path program 1 times [2024-11-09 15:20:20,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:20,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110594677] [2024-11-09 15:20:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:20,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:20,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110594677] [2024-11-09 15:20:20,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110594677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:20,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:20,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:20:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210045667] [2024-11-09 15:20:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:20,928 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:20:20,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:20,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 15:20:20,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 15:20:20,961 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-09 15:20:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:20,971 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2024-11-09 15:20:20,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2024-11-09 15:20:20,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-09 15:20:20,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 28 transitions. [2024-11-09 15:20:20,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-09 15:20:20,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-09 15:20:20,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2024-11-09 15:20:20,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:20:20,982 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-11-09 15:20:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2024-11-09 15:20:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 15:20:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 15:20:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-11-09 15:20:21,004 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-11-09 15:20:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 15:20:21,009 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-11-09 15:20:21,009 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:20:21,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2024-11-09 15:20:21,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-09 15:20:21,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:21,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:21,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:20:21,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:21,012 INFO L745 eck$LassoCheckResult]: Stem: 77#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 69#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 70#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 67#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 68#L34-3 [2024-11-09 15:20:21,013 INFO L747 eck$LassoCheckResult]: Loop: 68#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 78#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 72#L35-3 havoc main_~q~0#1; 71#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 68#L34-3 [2024-11-09 15:20:21,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 2 times [2024-11-09 15:20:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:21,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868683338] [2024-11-09 15:20:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:21,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:21,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:21,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2130345, now seen corresponding path program 1 times [2024-11-09 15:20:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218919319] [2024-11-09 15:20:21,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:21,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:21,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:21,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash -821894448, now seen corresponding path program 1 times [2024-11-09 15:20:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:21,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092994060] [2024-11-09 15:20:21,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:21,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:21,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092994060] [2024-11-09 15:20:21,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092994060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:21,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:21,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:20:21,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187508306] [2024-11-09 15:20:21,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:21,163 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:21,164 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:21,164 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:21,164 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:21,164 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:21,164 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:21,164 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:21,164 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:21,165 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2024-11-09 15:20:21,165 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:21,165 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:21,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,287 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:21,288 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:21,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:21,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:21,293 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:21,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:20:21,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:21,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:21,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:21,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:21,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:21,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:21,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:20:21,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:21,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:21,412 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:21,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:21,417 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:21,418 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:21,421 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:21,421 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:21,421 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:21,421 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:21,421 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:21,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:21,422 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2024-11-09 15:20:21,422 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:21,422 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:21,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,470 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:21,474 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:21,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:21,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:21,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:21,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:20:21,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:21,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:21,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:21,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:21,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:21,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:21,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:21,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:21,502 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:21,508 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-09 15:20:21,508 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-09 15:20:21,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:21,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:21,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:20:21,534 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:21,534 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:21,535 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:21,535 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -1*ULTIMATE.start_main_~p~0#1 Supporting invariants [] [2024-11-09 15:20:21,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-09 15:20:21,550 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:21,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:21,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:21,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:21,600 WARN L253 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:21,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:21,664 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 15:20:21,666 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-09 15:20:21,719 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 31 states and 41 transitions. Complement of second has 7 states. [2024-11-09 15:20:21,720 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-09 15:20:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-09 15:20:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:20:21,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-09 15:20:21,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:21,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-09 15:20:21,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:21,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 8 letters. [2024-11-09 15:20:21,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:21,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-11-09 15:20:21,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-09 15:20:21,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 38 transitions. [2024-11-09 15:20:21,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-09 15:20:21,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 15:20:21,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2024-11-09 15:20:21,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:21,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-09 15:20:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2024-11-09 15:20:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-09 15:20:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 15:20:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-09 15:20:21,733 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-09 15:20:21,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:21,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:20:21,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:20:21,734 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-09 15:20:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:21,772 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-11-09 15:20:21,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2024-11-09 15:20:21,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-09 15:20:21,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2024-11-09 15:20:21,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-09 15:20:21,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 15:20:21,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2024-11-09 15:20:21,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:20:21,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-09 15:20:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2024-11-09 15:20:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-09 15:20:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 15:20:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-11-09 15:20:21,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-09 15:20:21,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:20:21,779 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-09 15:20:21,779 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:20:21,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2024-11-09 15:20:21,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-09 15:20:21,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:21,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:21,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:20:21,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:21,782 INFO L745 eck$LassoCheckResult]: Stem: 233#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 226#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 223#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 224#L34-3 [2024-11-09 15:20:21,782 INFO L747 eck$LassoCheckResult]: Loop: 224#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 234#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 215#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 222#$Ultimate##0 ~p := #in~p;~q := #in~q; 232#L20 assume ~p <= 0;#res := 1; 231#partsFINAL assume true; 214#partsEXIT >#71#return; 219#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 235#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 229#L35-3 havoc main_~q~0#1; 227#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 224#L34-3 [2024-11-09 15:20:21,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 3 times [2024-11-09 15:20:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993021669] [2024-11-09 15:20:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:21,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:21,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:21,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:21,794 INFO L85 PathProgramCache]: Analyzing trace with hash -601564238, now seen corresponding path program 1 times [2024-11-09 15:20:21,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:21,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669357733] [2024-11-09 15:20:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:21,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:21,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:21,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:21,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:21,810 INFO L85 PathProgramCache]: Analyzing trace with hash 273756331, now seen corresponding path program 1 times [2024-11-09 15:20:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:21,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997027515] [2024-11-09 15:20:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:21,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:21,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:21,936 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:21,936 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:21,936 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:21,937 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:21,937 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:21,937 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:21,937 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:21,937 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:21,937 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2024-11-09 15:20:21,937 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:21,937 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:21,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:21,989 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:21,989 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:21,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:21,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:21,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:21,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:20:21,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:21,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:22,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:20:22,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:22,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:22,016 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:22,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:20:22,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:22,019 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:22,046 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:22,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:20:22,051 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:22,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:22,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:22,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:22,051 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:22,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:22,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:22,052 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:22,052 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2024-11-09 15:20:22,052 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:22,052 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:22,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:22,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:22,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:22,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:22,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:22,106 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:22,106 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:22,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:22,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:22,110 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:22,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:20:22,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:22,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:22,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:22,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:22,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:22,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:22,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:22,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:22,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:22,141 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-09 15:20:22,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:22,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:22,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:22,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:20:22,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:22,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:22,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:22,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:22,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:22,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:22,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:22,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:22,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:22,174 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-09 15:20:22,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:22,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:22,176 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:22,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:20:22,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:22,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:22,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:22,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:22,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:22,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:22,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:22,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:22,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:22,195 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:22,195 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:20:22,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:22,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:22,198 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:22,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:20:22,199 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:22,199 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:22,200 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:22,200 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 1 Supporting invariants [] [2024-11-09 15:20:22,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:20:22,218 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:22,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:22,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:22,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:22,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:22,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:22,355 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-09 15:20:22,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:20:22,589 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 159 states and 248 transitions. Complement of second has 34 states. [2024-11-09 15:20:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:20:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2024-11-09 15:20:22,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 4 letters. Loop has 11 letters. [2024-11-09 15:20:22,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:22,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 15 letters. Loop has 11 letters. [2024-11-09 15:20:22,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:22,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 4 letters. Loop has 22 letters. [2024-11-09 15:20:22,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:22,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 248 transitions. [2024-11-09 15:20:22,602 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-09 15:20:22,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 157 states and 246 transitions. [2024-11-09 15:20:22,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2024-11-09 15:20:22,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2024-11-09 15:20:22,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 246 transitions. [2024-11-09 15:20:22,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:22,611 INFO L218 hiAutomatonCegarLoop]: Abstraction has 157 states and 246 transitions. [2024-11-09 15:20:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 246 transitions. [2024-11-09 15:20:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 132. [2024-11-09 15:20:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 92 states have (on average 1.315217391304348) internal successors, (121), 87 states have internal predecessors, (121), 28 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (48), 36 states have call predecessors, (48), 28 states have call successors, (48) [2024-11-09 15:20:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2024-11-09 15:20:22,633 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 197 transitions. [2024-11-09 15:20:22,633 INFO L425 stractBuchiCegarLoop]: Abstraction has 132 states and 197 transitions. [2024-11-09 15:20:22,634 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:20:22,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 197 transitions. [2024-11-09 15:20:22,636 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-09 15:20:22,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:22,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:22,639 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:20:22,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:22,640 INFO L745 eck$LassoCheckResult]: Stem: 550#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 528#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 529#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 526#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 527#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 560#L35-2 [2024-11-09 15:20:22,640 INFO L747 eck$LassoCheckResult]: Loop: 560#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 562#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 566#$Ultimate##0 ~p := #in~p;~q := #in~q; 584#L20 assume !(~p <= 0); 570#L21 assume ~q <= 0;#res := 0; 568#partsFINAL assume true; 565#partsEXIT >#71#return; 563#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 561#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 541#L35-3 havoc main_~q~0#1; 533#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 534#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 560#L35-2 [2024-11-09 15:20:22,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 1 times [2024-11-09 15:20:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:22,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209887529] [2024-11-09 15:20:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:22,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:22,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:22,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:22,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1796298250, now seen corresponding path program 1 times [2024-11-09 15:20:22,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:22,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005920574] [2024-11-09 15:20:22,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:22,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:22,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 15:20:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:22,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005920574] [2024-11-09 15:20:22,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005920574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:22,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:22,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 15:20:22,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996718035] [2024-11-09 15:20:22,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:22,857 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:20:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:22,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 15:20:22,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 15:20:22,858 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. cyclomatic complexity: 70 Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:20:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:23,072 INFO L93 Difference]: Finished difference Result 265 states and 484 transitions. [2024-11-09 15:20:23,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 484 transitions. [2024-11-09 15:20:23,077 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2024-11-09 15:20:23,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 256 states and 475 transitions. [2024-11-09 15:20:23,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2024-11-09 15:20:23,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-11-09 15:20:23,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 475 transitions. [2024-11-09 15:20:23,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:23,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 256 states and 475 transitions. [2024-11-09 15:20:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 475 transitions. [2024-11-09 15:20:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 210. [2024-11-09 15:20:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 40 states have call successors, (40), 12 states have call predecessors, (40), 30 states have return successors, (166), 57 states have call predecessors, (166), 40 states have call successors, (166) [2024-11-09 15:20:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 383 transitions. [2024-11-09 15:20:23,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 210 states and 383 transitions. [2024-11-09 15:20:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 15:20:23,123 INFO L425 stractBuchiCegarLoop]: Abstraction has 210 states and 383 transitions. [2024-11-09 15:20:23,125 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:20:23,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 383 transitions. [2024-11-09 15:20:23,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2024-11-09 15:20:23,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:23,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:23,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:20:23,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:23,128 INFO L745 eck$LassoCheckResult]: Stem: 975#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 934#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 935#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 932#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 933#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 985#L35-2 [2024-11-09 15:20:23,128 INFO L747 eck$LassoCheckResult]: Loop: 985#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 919#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 993#$Ultimate##0 ~p := #in~p;~q := #in~q; 1042#L20 assume !(~p <= 0); 1039#L21 assume ~q <= 0;#res := 0; 1000#partsFINAL assume true; 997#partsEXIT >#71#return; 996#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 985#L35-2 [2024-11-09 15:20:23,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:23,129 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 2 times [2024-11-09 15:20:23,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:23,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071812132] [2024-11-09 15:20:23,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:23,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:23,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:23,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:23,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash 499890354, now seen corresponding path program 1 times [2024-11-09 15:20:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:23,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059816931] [2024-11-09 15:20:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:23,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:23,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:23,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 188539696, now seen corresponding path program 1 times [2024-11-09 15:20:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392108507] [2024-11-09 15:20:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:23,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:23,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:20:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:23,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:23,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392108507] [2024-11-09 15:20:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392108507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:23,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:23,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:20:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077667612] [2024-11-09 15:20:23,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:23,258 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-09 15:20:23,317 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:23,317 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:23,317 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:23,317 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:23,317 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:23,317 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:23,317 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:23,317 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:23,317 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2024-11-09 15:20:23,318 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:23,318 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:23,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:23,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:23,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:23,350 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:23,350 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:23,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:23,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:23,352 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:23,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:20:23,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:23,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:23,365 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:23,365 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:23,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:20:23,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:23,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:23,376 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:23,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:20:23,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:23,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:23,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:23,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:23,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:23,402 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:23,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:20:23,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:23,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:23,433 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:23,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:20:23,438 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:23,439 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:23,439 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:23,439 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:23,439 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:23,439 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:23,439 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:23,439 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:23,439 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2024-11-09 15:20:23,439 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:23,439 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:23,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:23,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:23,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:23,473 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:23,473 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:23,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:23,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:23,477 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:23,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:20:23,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:23,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:23,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:23,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:23,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:23,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:23,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:23,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:23,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:23,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-09 15:20:23,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:23,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:23,511 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:23,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:20:23,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:23,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:23,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:23,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:23,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:23,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:23,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:23,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:23,529 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:23,532 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:23,532 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:20:23,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:23,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:23,534 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:23,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:20:23,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:23,536 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:23,536 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:23,536 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 1 Supporting invariants [] [2024-11-09 15:20:23,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:23,548 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:23,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:23,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:23,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:23,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:23,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:23,639 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-09 15:20:23,639 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 210 states and 383 transitions. cyclomatic complexity: 178 Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:20:23,809 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 210 states and 383 transitions. cyclomatic complexity: 178. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 1177 states and 2382 transitions. Complement of second has 39 states. [2024-11-09 15:20:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:20:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2024-11-09 15:20:23,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 5 letters. Loop has 8 letters. [2024-11-09 15:20:23,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:23,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 13 letters. Loop has 8 letters. [2024-11-09 15:20:23,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:23,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 5 letters. Loop has 16 letters. [2024-11-09 15:20:23,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:23,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1177 states and 2382 transitions. [2024-11-09 15:20:23,829 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 62 [2024-11-09 15:20:23,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1177 states to 1022 states and 2053 transitions. [2024-11-09 15:20:23,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2024-11-09 15:20:23,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296 [2024-11-09 15:20:23,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1022 states and 2053 transitions. [2024-11-09 15:20:23,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:23,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1022 states and 2053 transitions. [2024-11-09 15:20:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states and 2053 transitions. [2024-11-09 15:20:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 843. [2024-11-09 15:20:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 539 states have (on average 1.2467532467532467) internal successors, (672), 536 states have internal predecessors, (672), 178 states have call successors, (178), 51 states have call predecessors, (178), 126 states have return successors, (797), 255 states have call predecessors, (797), 175 states have call successors, (797) [2024-11-09 15:20:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1647 transitions. [2024-11-09 15:20:23,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 843 states and 1647 transitions. [2024-11-09 15:20:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:23,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:20:23,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:20:23,927 INFO L87 Difference]: Start difference. First operand 843 states and 1647 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:20:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:23,987 INFO L93 Difference]: Finished difference Result 754 states and 1224 transitions. [2024-11-09 15:20:23,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1224 transitions. [2024-11-09 15:20:23,993 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 61 [2024-11-09 15:20:23,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 337 states and 528 transitions. [2024-11-09 15:20:23,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-11-09 15:20:23,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-11-09 15:20:23,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 528 transitions. [2024-11-09 15:20:23,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:23,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 337 states and 528 transitions. [2024-11-09 15:20:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 528 transitions. [2024-11-09 15:20:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 315. [2024-11-09 15:20:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 212 states have internal predecessors, (253), 72 states have call successors, (72), 29 states have call predecessors, (72), 38 states have return successors, (175), 73 states have call predecessors, (175), 64 states have call successors, (175) [2024-11-09 15:20:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 500 transitions. [2024-11-09 15:20:24,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 315 states and 500 transitions. [2024-11-09 15:20:24,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:20:24,007 INFO L425 stractBuchiCegarLoop]: Abstraction has 315 states and 500 transitions. [2024-11-09 15:20:24,007 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:20:24,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 500 transitions. [2024-11-09 15:20:24,008 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 61 [2024-11-09 15:20:24,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:24,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:24,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:24,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:24,009 INFO L745 eck$LassoCheckResult]: Stem: 4066#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4034#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4035#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4032#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 4033#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 4067#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 4022#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 4257#$Ultimate##0 ~p := #in~p;~q := #in~q; 4255#L20 assume ~p <= 0;#res := 1; 4253#partsFINAL assume true; 4254#partsEXIT >#71#return; 4073#L36-1 [2024-11-09 15:20:24,009 INFO L747 eck$LassoCheckResult]: Loop: 4073#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 4074#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 4036#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 4037#$Ultimate##0 ~p := #in~p;~q := #in~q; 4301#L20 assume ~p <= 0;#res := 1; 4302#partsFINAL assume true; 4220#partsEXIT >#71#return; 4073#L36-1 [2024-11-09 15:20:24,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:24,010 INFO L85 PathProgramCache]: Analyzing trace with hash 621423982, now seen corresponding path program 1 times [2024-11-09 15:20:24,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:24,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749695681] [2024-11-09 15:20:24,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:24,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:24,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:24,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:24,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash 283574208, now seen corresponding path program 1 times [2024-11-09 15:20:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608946447] [2024-11-09 15:20:24,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:24,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:24,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:24,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:24,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash -597668429, now seen corresponding path program 1 times [2024-11-09 15:20:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673157502] [2024-11-09 15:20:24,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:24,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:24,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:24,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:24,105 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:24,105 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:24,106 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:24,106 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:24,106 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:24,106 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,106 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:24,106 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:24,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2024-11-09 15:20:24,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:24,106 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:24,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,137 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:24,137 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:24,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:24,139 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:24,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:20:24,141 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:24,141 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:24,153 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:24,153 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:24,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:24,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:24,166 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:24,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:20:24,169 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:24,169 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:24,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:24,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:24,194 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:24,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:20:24,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:24,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:24,424 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:24,429 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-09 15:20:24,430 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:24,430 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:24,430 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:24,430 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:24,430 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:24,430 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,430 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:24,430 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:24,430 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2024-11-09 15:20:24,430 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:24,430 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:24,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,464 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:24,464 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:24,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:24,466 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:24,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:20:24,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:24,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:24,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:24,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:24,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:24,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:24,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:24,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:24,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:24,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:20:24,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:24,498 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:24,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:20:24,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:24,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:24,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:24,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:24,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:24,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:24,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:24,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:24,516 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:24,518 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:24,518 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:20:24,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:24,519 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:24,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:20:24,521 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:24,521 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:24,521 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:24,521 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~q~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2024-11-09 15:20:24,531 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-09 15:20:24,532 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:24,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:24,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:20:24,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:24,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:24,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:24,661 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:24,661 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 315 states and 500 transitions. cyclomatic complexity: 193 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:20:24,756 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-09 15:20:24,768 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 315 states and 500 transitions. cyclomatic complexity: 193. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 492 states and 789 transitions. Complement of second has 13 states. [2024-11-09 15:20:24,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:24,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:20:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2024-11-09 15:20:24,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 7 letters. [2024-11-09 15:20:24,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:24,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 18 letters. Loop has 7 letters. [2024-11-09 15:20:24,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:24,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 14 letters. [2024-11-09 15:20:24,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:24,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 789 transitions. [2024-11-09 15:20:24,785 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 90 [2024-11-09 15:20:24,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 390 states and 617 transitions. [2024-11-09 15:20:24,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 262 [2024-11-09 15:20:24,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2024-11-09 15:20:24,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 390 states and 617 transitions. [2024-11-09 15:20:24,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:24,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 390 states and 617 transitions. [2024-11-09 15:20:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states and 617 transitions. [2024-11-09 15:20:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2024-11-09 15:20:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 251 states have (on average 1.2151394422310757) internal successors, (305), 258 states have internal predecessors, (305), 90 states have call successors, (92), 37 states have call predecessors, (92), 47 states have return successors, (218), 92 states have call predecessors, (218), 78 states have call successors, (218) [2024-11-09 15:20:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 615 transitions. [2024-11-09 15:20:24,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 388 states and 615 transitions. [2024-11-09 15:20:24,803 INFO L425 stractBuchiCegarLoop]: Abstraction has 388 states and 615 transitions. [2024-11-09 15:20:24,804 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:20:24,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 388 states and 615 transitions. [2024-11-09 15:20:24,806 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 90 [2024-11-09 15:20:24,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:24,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:24,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:24,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:20:24,807 INFO L745 eck$LassoCheckResult]: Stem: 4994#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4941#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4942#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4939#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 4940#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 4995#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 4943#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 4944#$Ultimate##0 ~p := #in~p;~q := #in~q; 5184#L20 assume !(~p <= 0); 5185#L21 assume !(~q <= 0); 5252#L22 assume ~q > ~p; 5188#L22-1 call #t~ret0 := parts(~p, ~p);< 5246#$Ultimate##0 [2024-11-09 15:20:24,807 INFO L747 eck$LassoCheckResult]: Loop: 5246#$Ultimate##0 ~p := #in~p;~q := #in~q; 5251#L20 assume !(~p <= 0); 5250#L21 assume !(~q <= 0); 5248#L22 assume ~q > ~p; 5189#L22-1 call #t~ret0 := parts(~p, ~p);< 5246#$Ultimate##0 [2024-11-09 15:20:24,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2084292643, now seen corresponding path program 1 times [2024-11-09 15:20:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:24,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394201851] [2024-11-09 15:20:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:24,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:24,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394201851] [2024-11-09 15:20:24,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394201851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:24,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:24,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:20:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937805180] [2024-11-09 15:20:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:24,842 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:24,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 28756408, now seen corresponding path program 1 times [2024-11-09 15:20:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:24,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999941329] [2024-11-09 15:20:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:24,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:24,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:24,896 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:24,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:24,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:24,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:24,897 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:24,897 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,897 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:24,897 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:24,897 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2024-11-09 15:20:24,897 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:24,897 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:24,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:24,936 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:24,937 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:24,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:24,938 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:24,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:20:24,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:24,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:24,950 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:24,950 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:24,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:24,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:24,962 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:24,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:20:24,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:24,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:24,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-09 15:20:24,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:24,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:24,994 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:24,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:20:24,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:24,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:25,127 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:25,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:25,132 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:25,132 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:25,132 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:25,133 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:25,133 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:25,133 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:25,133 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:25,133 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:25,133 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2024-11-09 15:20:25,133 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:25,133 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:25,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:25,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:25,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:25,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:25,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:25,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:25,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:25,191 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:25,192 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:25,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:25,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:25,193 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:25,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:20:25,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:25,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:25,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:25,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:25,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:25,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:25,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:25,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:25,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:25,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:25,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:25,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:25,219 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:25,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:20:25,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:25,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:25,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:25,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:25,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:25,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:25,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:25,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:25,233 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:25,236 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:25,236 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:20:25,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:25,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:25,237 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:25,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:20:25,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:25,239 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:25,239 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:25,239 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2024-11-09 15:20:25,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:25,251 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:25,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:25,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:25,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:25,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:25,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:25,327 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-09 15:20:25,328 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 388 states and 615 transitions. cyclomatic complexity: 236 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:20:25,410 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 388 states and 615 transitions. cyclomatic complexity: 236. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1110 states and 2143 transitions. Complement of second has 45 states. [2024-11-09 15:20:25,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:20:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2024-11-09 15:20:25,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 5 letters. [2024-11-09 15:20:25,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:25,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 17 letters. Loop has 5 letters. [2024-11-09 15:20:25,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:25,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 10 letters. [2024-11-09 15:20:25,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:25,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1110 states and 2143 transitions. [2024-11-09 15:20:25,425 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 232 [2024-11-09 15:20:25,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1110 states to 1049 states and 2041 transitions. [2024-11-09 15:20:25,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 587 [2024-11-09 15:20:25,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 595 [2024-11-09 15:20:25,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1049 states and 2041 transitions. [2024-11-09 15:20:25,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:25,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1049 states and 2041 transitions. [2024-11-09 15:20:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states and 2041 transitions. [2024-11-09 15:20:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 952. [2024-11-09 15:20:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 603 states have (on average 1.2404643449419568) internal successors, (748), 645 states have internal predecessors, (748), 246 states have call successors, (248), 101 states have call predecessors, (248), 103 states have return successors, (765), 205 states have call predecessors, (765), 217 states have call successors, (765) [2024-11-09 15:20:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1761 transitions. [2024-11-09 15:20:25,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 952 states and 1761 transitions. [2024-11-09 15:20:25,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:20:25,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:20:25,474 INFO L87 Difference]: Start difference. First operand 952 states and 1761 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:20:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:25,507 INFO L93 Difference]: Finished difference Result 825 states and 1466 transitions. [2024-11-09 15:20:25,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1466 transitions. [2024-11-09 15:20:25,519 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 149 [2024-11-09 15:20:25,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 824 states and 1465 transitions. [2024-11-09 15:20:25,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2024-11-09 15:20:25,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2024-11-09 15:20:25,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 824 states and 1465 transitions. [2024-11-09 15:20:25,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:25,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 824 states and 1465 transitions. [2024-11-09 15:20:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states and 1465 transitions. [2024-11-09 15:20:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 816. [2024-11-09 15:20:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 526 states have (on average 1.2376425855513309) internal successors, (651), 566 states have internal predecessors, (651), 197 states have call successors, (199), 86 states have call predecessors, (199), 93 states have return successors, (607), 163 states have call predecessors, (607), 177 states have call successors, (607) [2024-11-09 15:20:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1457 transitions. [2024-11-09 15:20:25,553 INFO L240 hiAutomatonCegarLoop]: Abstraction has 816 states and 1457 transitions. [2024-11-09 15:20:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:20:25,554 INFO L425 stractBuchiCegarLoop]: Abstraction has 816 states and 1457 transitions. [2024-11-09 15:20:25,554 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:20:25,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 816 states and 1457 transitions. [2024-11-09 15:20:25,558 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 147 [2024-11-09 15:20:25,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:25,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:25,559 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:25,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:25,560 INFO L745 eck$LassoCheckResult]: Stem: 8389#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 8348#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 8349#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8346#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 8347#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 8658#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 8352#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 8353#$Ultimate##0 ~p := #in~p;~q := #in~q; 8930#L20 assume ~p <= 0;#res := 1; 8929#partsFINAL assume true; 8923#partsEXIT >#71#return; 8924#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 8630#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 8628#L35-3 havoc main_~q~0#1; 8627#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 8624#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 8600#L35-2 [2024-11-09 15:20:25,560 INFO L747 eck$LassoCheckResult]: Loop: 8600#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 8596#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 8597#$Ultimate##0 ~p := #in~p;~q := #in~q; 8607#L20 assume !(~p <= 0); 8608#L21 assume ~q <= 0;#res := 0; 8663#partsFINAL assume true; 8661#partsEXIT >#71#return; 8465#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 8417#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 8410#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 8555#$Ultimate##0 ~p := #in~p;~q := #in~q; 8548#L20 assume !(~p <= 0); 8543#L21 assume !(~q <= 0); 8542#L22 assume !(~q > ~p); 8455#L23 call #t~ret1 := parts(~p - ~q, ~q);< 8566#$Ultimate##0 ~p := #in~p;~q := #in~q; 8591#L20 assume ~p <= 0;#res := 1; 8567#partsFINAL assume true; 8565#partsEXIT >#67#return; 8444#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 8491#$Ultimate##0 ~p := #in~p;~q := #in~q; 8557#L20 assume !(~p <= 0); 8551#L21 assume ~q <= 0;#res := 0; 8552#partsFINAL assume true; 8620#partsEXIT >#69#return; 8471#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 8564#partsFINAL assume true; 8563#partsEXIT >#71#return; 8562#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 8408#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 8409#L35-3 havoc main_~q~0#1; 8626#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 8623#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 8600#L35-2 [2024-11-09 15:20:25,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash -103488292, now seen corresponding path program 2 times [2024-11-09 15:20:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:25,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376206133] [2024-11-09 15:20:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:25,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376206133] [2024-11-09 15:20:25,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376206133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:25,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082353548] [2024-11-09 15:20:25,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:20:25,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:25,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:25,627 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:25,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-09 15:20:25,654 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:20:25,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:20:25,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:25,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:25,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:25,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:25,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082353548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:25,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:25,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-09 15:20:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801639651] [2024-11-09 15:20:25,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:25,783 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:25,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash 112905049, now seen corresponding path program 1 times [2024-11-09 15:20:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:25,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191895262] [2024-11-09 15:20:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:25,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 15:20:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:25,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 15:20:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191895262] [2024-11-09 15:20:25,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191895262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392327652] [2024-11-09 15:20:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:25,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:25,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:25,938 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:25,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-09 15:20:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:25,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:20:25,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 15:20:26,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 15:20:26,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392327652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:26,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:26,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-09 15:20:26,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251938017] [2024-11-09 15:20:26,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:26,248 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:20:26,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:26,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 15:20:26,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 15:20:26,249 INFO L87 Difference]: Start difference. First operand 816 states and 1457 transitions. cyclomatic complexity: 661 Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:20:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:26,291 INFO L93 Difference]: Finished difference Result 868 states and 1539 transitions. [2024-11-09 15:20:26,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 868 states and 1539 transitions. [2024-11-09 15:20:26,298 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 157 [2024-11-09 15:20:26,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 868 states to 861 states and 1531 transitions. [2024-11-09 15:20:26,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2024-11-09 15:20:26,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2024-11-09 15:20:26,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 861 states and 1531 transitions. [2024-11-09 15:20:26,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:26,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 861 states and 1531 transitions. [2024-11-09 15:20:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states and 1531 transitions. [2024-11-09 15:20:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 815. [2024-11-09 15:20:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 525 states have (on average 1.2361904761904763) internal successors, (649), 566 states have internal predecessors, (649), 197 states have call successors, (199), 86 states have call predecessors, (199), 93 states have return successors, (607), 162 states have call predecessors, (607), 177 states have call successors, (607) [2024-11-09 15:20:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1455 transitions. [2024-11-09 15:20:26,327 INFO L240 hiAutomatonCegarLoop]: Abstraction has 815 states and 1455 transitions. [2024-11-09 15:20:26,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 15:20:26,327 INFO L425 stractBuchiCegarLoop]: Abstraction has 815 states and 1455 transitions. [2024-11-09 15:20:26,328 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:20:26,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 815 states and 1455 transitions. [2024-11-09 15:20:26,331 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 147 [2024-11-09 15:20:26,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:26,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:26,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:26,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:26,333 INFO L745 eck$LassoCheckResult]: Stem: 10414#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 10371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 10372#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10369#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 10370#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 10429#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10949#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10950#$Ultimate##0 ~p := #in~p;~q := #in~q; 10954#L20 assume ~p <= 0;#res := 1; 10952#partsFINAL assume true; 10948#partsEXIT >#71#return; 10930#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10929#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10921#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10923#$Ultimate##0 ~p := #in~p;~q := #in~q; 10925#L20 assume ~p <= 0;#res := 1; 10924#partsFINAL assume true; 10920#partsEXIT >#71#return; 10917#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10696#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 10695#L35-3 havoc main_~q~0#1; 10694#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10686#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 10670#L35-2 [2024-11-09 15:20:26,333 INFO L747 eck$LassoCheckResult]: Loop: 10670#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10662#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10664#$Ultimate##0 ~p := #in~p;~q := #in~q; 10676#L20 assume !(~p <= 0); 10677#L21 assume ~q <= 0;#res := 0; 10933#partsFINAL assume true; 10932#partsEXIT >#71#return; 10652#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10651#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 10434#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 10440#$Ultimate##0 ~p := #in~p;~q := #in~q; 10594#L20 assume !(~p <= 0); 10590#L21 assume !(~q <= 0); 10511#L22 assume !(~q > ~p); 10475#L23 call #t~ret1 := parts(~p - ~q, ~q);< 10574#$Ultimate##0 ~p := #in~p;~q := #in~q; 10608#L20 assume ~p <= 0;#res := 1; 10607#partsFINAL assume true; 10603#partsEXIT >#67#return; 10459#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 10575#$Ultimate##0 ~p := #in~p;~q := #in~q; 10584#L20 assume !(~p <= 0); 10582#L21 assume ~q <= 0;#res := 0; 10571#partsFINAL assume true; 10572#partsEXIT >#69#return; 10495#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 10441#partsFINAL assume true; 10442#partsEXIT >#71#return; 10637#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 10432#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 10433#L35-3 havoc main_~q~0#1; 10688#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10687#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 10670#L35-2 [2024-11-09 15:20:26,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2031167415, now seen corresponding path program 3 times [2024-11-09 15:20:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475579633] [2024-11-09 15:20:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:26,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:26,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:26,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:26,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash 112905049, now seen corresponding path program 2 times [2024-11-09 15:20:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956798407] [2024-11-09 15:20:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 15:20:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:26,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 15:20:26,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:26,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956798407] [2024-11-09 15:20:26,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956798407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:26,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842468539] [2024-11-09 15:20:26,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:20:26,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:26,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:26,448 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:26,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-09 15:20:26,483 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:20:26,484 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:20:26,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:20:26,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 15:20:26,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 15:20:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842468539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:26,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:26,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-09 15:20:26,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868160947] [2024-11-09 15:20:26,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:26,758 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:20:26,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:26,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 15:20:26,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-09 15:20:26,759 INFO L87 Difference]: Start difference. First operand 815 states and 1455 transitions. cyclomatic complexity: 660 Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 15:20:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:27,086 INFO L93 Difference]: Finished difference Result 1101 states and 2036 transitions. [2024-11-09 15:20:27,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1101 states and 2036 transitions. [2024-11-09 15:20:27,098 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 182 [2024-11-09 15:20:27,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1101 states to 1026 states and 1936 transitions. [2024-11-09 15:20:27,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2024-11-09 15:20:27,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 554 [2024-11-09 15:20:27,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1026 states and 1936 transitions. [2024-11-09 15:20:27,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:27,110 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1936 transitions. [2024-11-09 15:20:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states and 1936 transitions. [2024-11-09 15:20:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 831. [2024-11-09 15:20:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 542 states have (on average 1.2029520295202951) internal successors, (652), 577 states have internal predecessors, (652), 181 states have call successors, (183), 86 states have call predecessors, (183), 108 states have return successors, (641), 167 states have call predecessors, (641), 170 states have call successors, (641) [2024-11-09 15:20:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1476 transitions. [2024-11-09 15:20:27,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 831 states and 1476 transitions. [2024-11-09 15:20:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 15:20:27,136 INFO L425 stractBuchiCegarLoop]: Abstraction has 831 states and 1476 transitions. [2024-11-09 15:20:27,136 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:20:27,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 831 states and 1476 transitions. [2024-11-09 15:20:27,140 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 116 [2024-11-09 15:20:27,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:27,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:27,142 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:27,142 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 15:20:27,142 INFO L745 eck$LassoCheckResult]: Stem: 12583#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 12538#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 12539#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12533#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 12534#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 12836#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12837#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 12856#$Ultimate##0 ~p := #in~p;~q := #in~q; 12866#L20 assume ~p <= 0;#res := 1; 12863#partsFINAL assume true; 12864#partsEXIT >#71#return; 12855#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12885#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12854#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 12883#$Ultimate##0 ~p := #in~p;~q := #in~q; 12886#L20 assume ~p <= 0;#res := 1; 12884#partsFINAL assume true; 12878#partsEXIT >#71#return; 12879#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12614#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 12615#L35-3 havoc main_~q~0#1; 13163#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 13157#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13156#L35-2 [2024-11-09 15:20:27,142 INFO L747 eck$LassoCheckResult]: Loop: 13156#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12598#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 13327#$Ultimate##0 ~p := #in~p;~q := #in~q; 12597#L20 assume !(~p <= 0); 12600#L21 assume ~q <= 0;#res := 0; 13328#partsFINAL assume true; 13325#partsEXIT >#71#return; 12957#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12954#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12912#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 13070#$Ultimate##0 ~p := #in~p;~q := #in~q; 13068#L20 assume !(~p <= 0); 13066#L21 assume !(~q <= 0); 13065#L22 assume !(~q > ~p); 12939#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13060#$Ultimate##0 ~p := #in~p;~q := #in~q; 13076#L20 assume ~p <= 0;#res := 1; 13063#partsFINAL assume true; 13042#partsEXIT >#67#return; 12924#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13006#$Ultimate##0 ~p := #in~p;~q := #in~q; 13080#L20 assume !(~p <= 0); 13077#L21 assume ~q <= 0;#res := 0; 13079#partsFINAL assume true; 13259#partsEXIT >#69#return; 12997#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13320#partsFINAL assume true; 12911#partsEXIT >#71#return; 12914#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12960#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 12913#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 13070#$Ultimate##0 ~p := #in~p;~q := #in~q; 13068#L20 assume !(~p <= 0); 13066#L21 assume !(~q <= 0); 13065#L22 assume !(~q > ~p); 12939#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13060#$Ultimate##0 ~p := #in~p;~q := #in~q; 13076#L20 assume ~p <= 0;#res := 1; 13063#partsFINAL assume true; 13042#partsEXIT >#67#return; 12924#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13006#$Ultimate##0 ~p := #in~p;~q := #in~q; 13080#L20 assume !(~p <= 0); 13077#L21 assume ~q <= 0;#res := 0; 13079#partsFINAL assume true; 13259#partsEXIT >#69#return; 12997#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13320#partsFINAL assume true; 12911#partsEXIT >#71#return; 12612#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12613#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 13317#L35-3 havoc main_~q~0#1; 12549#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12550#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13156#L35-2 [2024-11-09 15:20:27,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2031167415, now seen corresponding path program 4 times [2024-11-09 15:20:27,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:27,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367104392] [2024-11-09 15:20:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:27,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:27,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:27,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:27,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 541134186, now seen corresponding path program 3 times [2024-11-09 15:20:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366469037] [2024-11-09 15:20:27,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:27,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 15:20:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:27,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:27,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:27,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 15:20:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:27,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:27,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 17 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 15:20:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366469037] [2024-11-09 15:20:27,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366469037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251783768] [2024-11-09 15:20:27,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:20:27,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:27,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:27,280 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:27,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-09 15:20:27,310 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 15:20:27,310 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:20:27,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 15:20:27,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-09 15:20:27,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 15:20:27,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251783768] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:27,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:27,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2024-11-09 15:20:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713781382] [2024-11-09 15:20:27,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:27,781 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:20:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:27,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 15:20:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-11-09 15:20:27,782 INFO L87 Difference]: Start difference. First operand 831 states and 1476 transitions. cyclomatic complexity: 665 Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 22 states have internal predecessors, (57), 6 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 13 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-09 15:20:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:28,338 INFO L93 Difference]: Finished difference Result 1217 states and 2217 transitions. [2024-11-09 15:20:28,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1217 states and 2217 transitions. [2024-11-09 15:20:28,346 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 168 [2024-11-09 15:20:28,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1217 states to 1176 states and 2144 transitions. [2024-11-09 15:20:28,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 602 [2024-11-09 15:20:28,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2024-11-09 15:20:28,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1176 states and 2144 transitions. [2024-11-09 15:20:28,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:28,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1176 states and 2144 transitions. [2024-11-09 15:20:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states and 2144 transitions. [2024-11-09 15:20:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1013. [2024-11-09 15:20:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 668 states have (on average 1.18562874251497) internal successors, (792), 717 states have internal predecessors, (792), 196 states have call successors, (198), 96 states have call predecessors, (198), 149 states have return successors, (874), 199 states have call predecessors, (874), 185 states have call successors, (874) [2024-11-09 15:20:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1864 transitions. [2024-11-09 15:20:28,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1013 states and 1864 transitions. [2024-11-09 15:20:28,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 15:20:28,385 INFO L425 stractBuchiCegarLoop]: Abstraction has 1013 states and 1864 transitions. [2024-11-09 15:20:28,385 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:20:28,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1013 states and 1864 transitions. [2024-11-09 15:20:28,389 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 130 [2024-11-09 15:20:28,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:28,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:28,390 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:28,390 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:20:28,390 INFO L745 eck$LassoCheckResult]: Stem: 15080#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 15038#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 15039#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15032#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 15033#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 15097#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 15034#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 15035#$Ultimate##0 ~p := #in~p;~q := #in~q; 15724#L20 assume ~p <= 0;#res := 1; 15723#partsFINAL assume true; 15722#partsEXIT >#71#return; 15720#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 15719#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 15691#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 15734#$Ultimate##0 ~p := #in~p;~q := #in~q; 15834#L20 assume !(~p <= 0); 15833#L21 assume !(~q <= 0); 15694#L22 assume ~q > ~p; 15041#L22-1 call #t~ret0 := parts(~p, ~p);< 15692#$Ultimate##0 ~p := #in~p;~q := #in~q; 15091#L20 assume !(~p <= 0); 15092#L21 assume !(~q <= 0); 15876#L22 assume !(~q > ~p); 15040#L23 call #t~ret1 := parts(~p - ~q, ~q);< 15042#$Ultimate##0 [2024-11-09 15:20:28,390 INFO L747 eck$LassoCheckResult]: Loop: 15042#$Ultimate##0 ~p := #in~p;~q := #in~q; 15916#L20 assume !(~p <= 0); 15913#L21 assume !(~q <= 0); 15912#L22 assume !(~q > ~p); 15898#L23 call #t~ret1 := parts(~p - ~q, ~q);< 15042#$Ultimate##0 [2024-11-09 15:20:28,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash -571940934, now seen corresponding path program 1 times [2024-11-09 15:20:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:28,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326611512] [2024-11-09 15:20:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:28,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 15:20:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326611512] [2024-11-09 15:20:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326611512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:28,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:20:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233885300] [2024-11-09 15:20:28,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:28,420 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:28,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash 28756503, now seen corresponding path program 1 times [2024-11-09 15:20:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:28,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721100282] [2024-11-09 15:20:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:28,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:28,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:28,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:28,463 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:28,463 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:28,463 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:28,463 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:28,463 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:28,463 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,463 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:28,463 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:28,463 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2024-11-09 15:20:28,463 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:28,463 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:28,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,500 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:28,500 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:28,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,501 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:20:28,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:28,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:28,513 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:28,514 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:28,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-09 15:20:28,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,525 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:20:28,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:28,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:28,537 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:28,537 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:28,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:28,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,548 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-09 15:20:28,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:28,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:28,560 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:28,560 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:28,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:28,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,571 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-09 15:20:28,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:28,573 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:28,583 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:28,583 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:28,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-09 15:20:28,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,594 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-09 15:20:28,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:28,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:28,606 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:28,606 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:28,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:28,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,617 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-09 15:20:28,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:28,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:28,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:28,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,639 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-09 15:20:28,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:28,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:28,699 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:28,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:28,703 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:28,704 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:28,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:28,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:28,704 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:28,704 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,704 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:28,704 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:28,704 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2024-11-09 15:20:28,704 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:28,704 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:28,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:28,747 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:28,747 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:28,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,749 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-09 15:20:28,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:28,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:28,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:28,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:28,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:28,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:28,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:28,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:28,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:28,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:28,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,772 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-09 15:20:28,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:28,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:28,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:28,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:28,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:28,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:28,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:28,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:28,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:28,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:28,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,795 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-09 15:20:28,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:28,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:28,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:28,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:28,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:28,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:28,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:28,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:28,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:28,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:28,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,818 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-09 15:20:28,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:28,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:28,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:28,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:28,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:28,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:28,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:28,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:28,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:28,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:28,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,841 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-09 15:20:28,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:28,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:28,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:28,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:28,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:28,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:28,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:28,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:28,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:28,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-09 15:20:28,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,866 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-09 15:20:28,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:28,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:28,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:28,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:28,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:28,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:28,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:28,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:28,880 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:28,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:28,882 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:20:28,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:28,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:28,884 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:28,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-09 15:20:28,885 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:28,885 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:28,886 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:28,886 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2024-11-09 15:20:28,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:28,896 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:28,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:28,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:20:28,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:28,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:28,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:29,017 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:29,018 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1013 states and 1864 transitions. cyclomatic complexity: 874 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:20:29,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1013 states and 1864 transitions. cyclomatic complexity: 874. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 1516 states and 2804 transitions. Complement of second has 30 states. [2024-11-09 15:20:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:20:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2024-11-09 15:20:29,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 24 letters. Loop has 5 letters. [2024-11-09 15:20:29,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:29,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 29 letters. Loop has 5 letters. [2024-11-09 15:20:29,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:29,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 24 letters. Loop has 10 letters. [2024-11-09 15:20:29,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:29,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1516 states and 2804 transitions. [2024-11-09 15:20:29,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-09 15:20:29,153 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 136 [2024-11-09 15:20:29,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1516 states to 1358 states and 2570 transitions. [2024-11-09 15:20:29,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 593 [2024-11-09 15:20:29,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2024-11-09 15:20:29,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1358 states and 2570 transitions. [2024-11-09 15:20:29,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:29,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1358 states and 2570 transitions. [2024-11-09 15:20:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states and 2570 transitions. [2024-11-09 15:20:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1314. [2024-11-09 15:20:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 880 states have (on average 1.2159090909090908) internal successors, (1070), 974 states have internal predecessors, (1070), 255 states have call successors, (257), 134 states have call predecessors, (257), 179 states have return successors, (1134), 205 states have call predecessors, (1134), 243 states have call successors, (1134) [2024-11-09 15:20:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 2461 transitions. [2024-11-09 15:20:29,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1314 states and 2461 transitions. [2024-11-09 15:20:29,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:29,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:20:29,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:20:29,198 INFO L87 Difference]: Start difference. First operand 1314 states and 2461 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 15:20:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:29,223 INFO L93 Difference]: Finished difference Result 1062 states and 1988 transitions. [2024-11-09 15:20:29,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1062 states and 1988 transitions. [2024-11-09 15:20:29,230 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 88 [2024-11-09 15:20:29,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1062 states to 1046 states and 1971 transitions. [2024-11-09 15:20:29,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2024-11-09 15:20:29,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2024-11-09 15:20:29,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1046 states and 1971 transitions. [2024-11-09 15:20:29,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:29,238 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1046 states and 1971 transitions. [2024-11-09 15:20:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states and 1971 transitions. [2024-11-09 15:20:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1044. [2024-11-09 15:20:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 703 states have (on average 1.2147937411095306) internal successors, (854), 776 states have internal predecessors, (854), 190 states have call successors, (191), 101 states have call predecessors, (191), 151 states have return successors, (924), 166 states have call predecessors, (924), 190 states have call successors, (924) [2024-11-09 15:20:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1969 transitions. [2024-11-09 15:20:29,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1044 states and 1969 transitions. [2024-11-09 15:20:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:20:29,261 INFO L425 stractBuchiCegarLoop]: Abstraction has 1044 states and 1969 transitions. [2024-11-09 15:20:29,261 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:20:29,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1044 states and 1969 transitions. [2024-11-09 15:20:29,265 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 88 [2024-11-09 15:20:29,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:29,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:29,266 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:29,266 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:29,266 INFO L745 eck$LassoCheckResult]: Stem: 20140#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 20094#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 20095#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 20092#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 20093#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 20159#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20652#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20653#$Ultimate##0 ~p := #in~p;~q := #in~q; 20657#L20 assume ~p <= 0;#res := 1; 20656#partsFINAL assume true; 20651#partsEXIT >#71#return; 20649#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20438#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20439#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20461#$Ultimate##0 ~p := #in~p;~q := #in~q; 20507#L20 assume ~p <= 0;#res := 1; 20505#partsFINAL assume true; 20459#partsEXIT >#71#return; 20402#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20400#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 20397#L35-3 havoc main_~q~0#1; 20368#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 20364#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 20358#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20351#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20354#$Ultimate##0 ~p := #in~p;~q := #in~q; 20361#L20 assume ~p <= 0;#res := 1; 20356#partsFINAL assume true; 20350#partsEXIT >#71#return; 20348#L36-1 [2024-11-09 15:20:29,266 INFO L747 eck$LassoCheckResult]: Loop: 20348#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20346#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 20079#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 20343#$Ultimate##0 ~p := #in~p;~q := #in~q; 20342#L20 assume ~p <= 0;#res := 1; 20341#partsFINAL assume true; 20352#partsEXIT >#71#return; 20348#L36-1 [2024-11-09 15:20:29,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:29,267 INFO L85 PathProgramCache]: Analyzing trace with hash -537230682, now seen corresponding path program 5 times [2024-11-09 15:20:29,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:29,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249929482] [2024-11-09 15:20:29,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:29,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:29,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:20:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:29,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 15:20:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 15:20:29,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:29,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249929482] [2024-11-09 15:20:29,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249929482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:29,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:29,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:20:29,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818768356] [2024-11-09 15:20:29,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:29,299 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:29,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:29,299 INFO L85 PathProgramCache]: Analyzing trace with hash 283574208, now seen corresponding path program 2 times [2024-11-09 15:20:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:29,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313693870] [2024-11-09 15:20:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:29,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:29,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:29,343 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:29,343 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:29,343 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:29,343 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:29,343 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:29,344 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:29,344 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:29,344 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:29,344 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2024-11-09 15:20:29,344 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:29,344 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:29,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:29,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:29,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:29,366 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:29,367 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:29,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:29,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:29,370 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:29,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-09 15:20:29,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:29,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:29,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-09 15:20:29,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:29,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:29,394 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:29,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-09 15:20:29,396 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:29,396 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:29,595 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:29,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:29,600 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:29,600 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:29,600 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:29,600 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:29,600 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:29,600 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:29,600 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:29,600 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:29,600 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2024-11-09 15:20:29,600 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:29,600 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:29,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:29,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:29,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:29,625 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:29,628 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:29,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:29,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:29,630 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:29,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-09 15:20:29,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:29,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:29,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:29,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:29,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:29,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:29,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:29,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:29,647 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:29,649 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:29,649 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:20:29,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:29,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:29,650 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:29,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-09 15:20:29,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:29,653 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:29,653 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:29,653 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~q~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~q~0#1 Supporting invariants [] [2024-11-09 15:20:29,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-09 15:20:29,664 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:29,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:29,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:29,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:29,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:29,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:29,813 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:29,813 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:20:29,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1057 states and 1983 transitions. Complement of second has 10 states. [2024-11-09 15:20:29,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:20:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2024-11-09 15:20:29,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 29 letters. Loop has 7 letters. [2024-11-09 15:20:29,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:29,857 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:29,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:29,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:29,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:29,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:29,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:29,995 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:29,995 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:20:30,065 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1055 states and 1980 transitions. Complement of second has 10 states. [2024-11-09 15:20:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:20:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2024-11-09 15:20:30,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 29 letters. Loop has 7 letters. [2024-11-09 15:20:30,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:30,066 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:30,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-09 15:20:30,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:30,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:30,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:30,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:30,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:30,199 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:30,199 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:20:30,270 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1044 states and 1969 transitions. cyclomatic complexity: 954. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1991 states and 3830 transitions. Complement of second has 11 states. [2024-11-09 15:20:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:20:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2024-11-09 15:20:30,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 29 letters. Loop has 7 letters. [2024-11-09 15:20:30,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:30,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 36 letters. Loop has 7 letters. [2024-11-09 15:20:30,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:30,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 29 letters. Loop has 14 letters. [2024-11-09 15:20:30,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:30,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1991 states and 3830 transitions. [2024-11-09 15:20:30,287 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2024-11-09 15:20:30,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1991 states to 1609 states and 2925 transitions. [2024-11-09 15:20:30,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2024-11-09 15:20:30,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2024-11-09 15:20:30,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1609 states and 2925 transitions. [2024-11-09 15:20:30,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:30,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1609 states and 2925 transitions. [2024-11-09 15:20:30,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states and 2925 transitions. [2024-11-09 15:20:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1533. [2024-11-09 15:20:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1035 states have (on average 1.2115942028985507) internal successors, (1254), 1144 states have internal predecessors, (1254), 295 states have call successors, (315), 165 states have call predecessors, (315), 203 states have return successors, (1235), 223 states have call predecessors, (1235), 278 states have call successors, (1235) [2024-11-09 15:20:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2804 transitions. [2024-11-09 15:20:30,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1533 states and 2804 transitions. [2024-11-09 15:20:30,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:30,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:20:30,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:20:30,342 INFO L87 Difference]: Start difference. First operand 1533 states and 2804 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 15:20:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:30,394 INFO L93 Difference]: Finished difference Result 879 states and 1532 transitions. [2024-11-09 15:20:30,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 879 states and 1532 transitions. [2024-11-09 15:20:30,400 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 62 [2024-11-09 15:20:30,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 879 states to 496 states and 873 transitions. [2024-11-09 15:20:30,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2024-11-09 15:20:30,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2024-11-09 15:20:30,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 873 transitions. [2024-11-09 15:20:30,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:30,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 496 states and 873 transitions. [2024-11-09 15:20:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 873 transitions. [2024-11-09 15:20:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 478. [2024-11-09 15:20:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 331 states have (on average 1.1993957703927491) internal successors, (397), 353 states have internal predecessors, (397), 87 states have call successors, (94), 57 states have call predecessors, (94), 60 states have return successors, (356), 67 states have call predecessors, (356), 81 states have call successors, (356) [2024-11-09 15:20:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 847 transitions. [2024-11-09 15:20:30,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 478 states and 847 transitions. [2024-11-09 15:20:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:20:30,417 INFO L425 stractBuchiCegarLoop]: Abstraction has 478 states and 847 transitions. [2024-11-09 15:20:30,417 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-09 15:20:30,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 847 transitions. [2024-11-09 15:20:30,419 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 62 [2024-11-09 15:20:30,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:30,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:30,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:30,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:30,420 INFO L745 eck$LassoCheckResult]: Stem: 28115#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 28062#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 28063#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 28055#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 28056#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 28143#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 28176#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 28177#$Ultimate##0 ~p := #in~p;~q := #in~q; 28181#L20 assume ~p <= 0;#res := 1; 28179#partsFINAL assume true; 28175#partsEXIT >#71#return; 28173#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28172#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 28162#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 28167#$Ultimate##0 ~p := #in~p;~q := #in~q; 28164#L20 assume ~p <= 0;#res := 1; 28161#partsFINAL assume true; 28163#partsEXIT >#71#return; 28184#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28254#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 28253#L35-3 havoc main_~q~0#1; 28069#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28070#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 28226#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 28057#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 28058#$Ultimate##0 ~p := #in~p;~q := #in~q; 28287#L20 assume !(~p <= 0); 28286#L21 assume ~q <= 0;#res := 0; 28237#partsFINAL assume true; 28160#partsEXIT >#71#return; 28137#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28131#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 28059#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 28060#$Ultimate##0 ~p := #in~p;~q := #in~q; 28213#L20 assume !(~p <= 0); 28211#L21 assume !(~q <= 0); 28209#L22 assume !(~q > ~p); 28092#L23 call #t~ret1 := parts(~p - ~q, ~q);< 28392#$Ultimate##0 ~p := #in~p;~q := #in~q; 28393#L20 assume ~p <= 0;#res := 1; 28445#partsFINAL assume true; 28439#partsEXIT >#67#return; 28036#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 28436#$Ultimate##0 [2024-11-09 15:20:30,420 INFO L747 eck$LassoCheckResult]: Loop: 28436#$Ultimate##0 ~p := #in~p;~q := #in~q; 28426#L20 assume !(~p <= 0); 28427#L21 assume !(~q <= 0); 28423#L22 assume !(~q > ~p); 28044#L23 call #t~ret1 := parts(~p - ~q, ~q);< 28429#$Ultimate##0 ~p := #in~p;~q := #in~q; 28430#L20 assume ~p <= 0;#res := 1; 28441#partsFINAL assume true; 28438#partsEXIT >#67#return; 28034#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 28436#$Ultimate##0 [2024-11-09 15:20:30,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:30,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1463979575, now seen corresponding path program 1 times [2024-11-09 15:20:30,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:30,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316195075] [2024-11-09 15:20:30,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:30,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:30,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:30,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:30,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2050528601, now seen corresponding path program 1 times [2024-11-09 15:20:30,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:30,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852066842] [2024-11-09 15:20:30,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:30,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:30,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:30,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:30,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1784633359, now seen corresponding path program 2 times [2024-11-09 15:20:30,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:30,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500173749] [2024-11-09 15:20:30,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:30,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:30,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:30,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:20:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 15:20:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:30,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:20:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 15:20:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 15:20:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500173749] [2024-11-09 15:20:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500173749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661702441] [2024-11-09 15:20:30,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:20:30,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:30,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:30,516 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:30,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-11-09 15:20:30,554 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:20:30,554 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:20:30,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:20:30,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 15:20:30,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 15:20:30,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661702441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:30,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:30,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2024-11-09 15:20:30,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833799239] [2024-11-09 15:20:30,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:30,704 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:30,704 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:30,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:30,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:30,704 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:30,704 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:30,704 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:30,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:30,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2024-11-09 15:20:30,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:30,705 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:30,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:30,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:30,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:30,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:30,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:30,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:30,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:30,753 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:30,753 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:30,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:30,755 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:30,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-09 15:20:30,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:30,757 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:30,768 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:30,768 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:30,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-09 15:20:30,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:30,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:30,783 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:30,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-09 15:20:30,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:30,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:30,796 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:30,796 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:30,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-09 15:20:30,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:30,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:30,809 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:30,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-09 15:20:30,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:30,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:30,822 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:30,822 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:30,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:30,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:30,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:30,850 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:30,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-09 15:20:30,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:30,852 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:30,863 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:30,864 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:30,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-09 15:20:30,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:30,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:30,877 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:30,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-09 15:20:30,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:30,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:30,890 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:30,890 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:30,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-09 15:20:30,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:30,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:30,902 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:30,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-09 15:20:30,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:30,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:30,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-09 15:20:30,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:30,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:30,926 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:30,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-09 15:20:30,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:30,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:31,072 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:31,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-09 15:20:31,079 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:31,079 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:31,079 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:31,079 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:31,079 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:31,079 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:31,079 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:31,079 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:31,079 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2024-11-09 15:20:31,079 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:31,079 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:31,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:31,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:31,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:31,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:31,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:31,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:31,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:31,121 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:31,121 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:31,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:31,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:31,123 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:31,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-09 15:20:31,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:31,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:31,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:31,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:31,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:31,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:31,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:31,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:31,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:31,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-09 15:20:31,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:31,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:31,147 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:31,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-09 15:20:31,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:31,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:31,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:31,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:31,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:31,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:31,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:31,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:31,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:31,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:31,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:31,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:31,172 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:31,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-09 15:20:31,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:31,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:31,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:31,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:31,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:31,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:31,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:31,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:31,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:31,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:31,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:31,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:31,196 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:31,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-09 15:20:31,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:31,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:31,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:31,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:31,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:31,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:31,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:31,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:31,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:31,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:31,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:31,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:31,220 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:31,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-09 15:20:31,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:31,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:31,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:31,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:31,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:31,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:31,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:31,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:31,234 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:31,236 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:31,236 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:20:31,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:31,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:31,239 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:31,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-09 15:20:31,240 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:31,240 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:31,240 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:31,240 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2024-11-09 15:20:31,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-09 15:20:31,251 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:31,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:31,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 15:20:31,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:31,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:20:31,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:31,479 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:31,479 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 847 transitions. cyclomatic complexity: 389 Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:20:31,652 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 847 transitions. cyclomatic complexity: 389. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1817 states and 3566 transitions. Complement of second has 43 states. [2024-11-09 15:20:31,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 15:20:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2024-11-09 15:20:31,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 69 transitions. Stem has 43 letters. Loop has 10 letters. [2024-11-09 15:20:31,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:31,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 69 transitions. Stem has 53 letters. Loop has 10 letters. [2024-11-09 15:20:31,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:31,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 69 transitions. Stem has 43 letters. Loop has 20 letters. [2024-11-09 15:20:31,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:31,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1817 states and 3566 transitions. [2024-11-09 15:20:31,668 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 107 [2024-11-09 15:20:31,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1817 states to 1431 states and 2862 transitions. [2024-11-09 15:20:31,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2024-11-09 15:20:31,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 383 [2024-11-09 15:20:31,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1431 states and 2862 transitions. [2024-11-09 15:20:31,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:31,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1431 states and 2862 transitions. [2024-11-09 15:20:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states and 2862 transitions. [2024-11-09 15:20:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1145. [2024-11-09 15:20:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 780 states have (on average 1.2294871794871796) internal successors, (959), 848 states have internal predecessors, (959), 234 states have call successors, (241), 138 states have call predecessors, (241), 131 states have return successors, (896), 158 states have call predecessors, (896), 214 states have call successors, (896) [2024-11-09 15:20:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2096 transitions. [2024-11-09 15:20:31,732 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1145 states and 2096 transitions. [2024-11-09 15:20:31,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:31,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 15:20:31,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:20:31,732 INFO L87 Difference]: Start difference. First operand 1145 states and 2096 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 15:20:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:31,817 INFO L93 Difference]: Finished difference Result 1326 states and 2340 transitions. [2024-11-09 15:20:31,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1326 states and 2340 transitions. [2024-11-09 15:20:31,827 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 117 [2024-11-09 15:20:31,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1326 states to 1286 states and 2285 transitions. [2024-11-09 15:20:31,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2024-11-09 15:20:31,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2024-11-09 15:20:31,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1286 states and 2285 transitions. [2024-11-09 15:20:31,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:31,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1286 states and 2285 transitions. [2024-11-09 15:20:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states and 2285 transitions. [2024-11-09 15:20:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1248. [2024-11-09 15:20:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 846 states have (on average 1.2257683215130024) internal successors, (1037), 924 states have internal predecessors, (1037), 256 states have call successors, (265), 150 states have call predecessors, (265), 146 states have return successors, (937), 173 states have call predecessors, (937), 231 states have call successors, (937) [2024-11-09 15:20:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 2239 transitions. [2024-11-09 15:20:31,877 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1248 states and 2239 transitions. [2024-11-09 15:20:31,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:20:31,878 INFO L425 stractBuchiCegarLoop]: Abstraction has 1248 states and 2239 transitions. [2024-11-09 15:20:31,878 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-09 15:20:31,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1248 states and 2239 transitions. [2024-11-09 15:20:31,882 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 114 [2024-11-09 15:20:31,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:31,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:31,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:31,883 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:20:31,884 INFO L745 eck$LassoCheckResult]: Stem: 33450#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 33413#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 33414#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 33406#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 33407#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 33481#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33560#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33561#$Ultimate##0 ~p := #in~p;~q := #in~q; 33563#L20 assume ~p <= 0;#res := 1; 33562#partsFINAL assume true; 33559#partsEXIT >#71#return; 33552#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 33549#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33499#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33517#$Ultimate##0 ~p := #in~p;~q := #in~q; 33501#L20 assume ~p <= 0;#res := 1; 33498#partsFINAL assume true; 33500#partsEXIT >#71#return; 33484#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 33457#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 33425#L35-3 havoc main_~q~0#1; 33421#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 33422#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 33482#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33483#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33490#$Ultimate##0 ~p := #in~p;~q := #in~q; 33489#L20 assume !(~p <= 0); 33488#L21 assume ~q <= 0;#res := 0; 33486#partsFINAL assume true; 33487#partsEXIT >#71#return; 33592#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 33590#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 33584#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 33587#$Ultimate##0 ~p := #in~p;~q := #in~q; 33983#L20 assume !(~p <= 0); 33969#L21 assume !(~q <= 0); 33966#L22 assume ~q > ~p; 33530#L22-1 call #t~ret0 := parts(~p, ~p);< 34022#$Ultimate##0 ~p := #in~p;~q := #in~q; 34020#L20 assume !(~p <= 0); 34019#L21 assume !(~q <= 0); 34018#L22 assume !(~q > ~p); 33526#L23 call #t~ret1 := parts(~p - ~q, ~q);< 34010#$Ultimate##0 ~p := #in~p;~q := #in~q; 34011#L20 assume ~p <= 0;#res := 1; 34126#partsFINAL assume true; 34124#partsEXIT >#67#return; 33416#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 33789#$Ultimate##0 ~p := #in~p;~q := #in~q; 33905#L20 assume !(~p <= 0); 33903#L21 assume !(~q <= 0); 33423#L22 [2024-11-09 15:20:31,884 INFO L747 eck$LassoCheckResult]: Loop: 33423#L22 assume !(~q > ~p); 33415#L23 call #t~ret1 := parts(~p - ~q, ~q);< 33418#$Ultimate##0 ~p := #in~p;~q := #in~q; 33428#L20 assume !(~p <= 0); 33426#L21 assume !(~q <= 0); 33423#L22 [2024-11-09 15:20:31,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash 813232914, now seen corresponding path program 1 times [2024-11-09 15:20:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:31,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049633832] [2024-11-09 15:20:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:31,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:20:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:31,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 15:20:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:31,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 15:20:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 15:20:31,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:31,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049633832] [2024-11-09 15:20:31,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049633832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:31,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440249239] [2024-11-09 15:20:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:31,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:31,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:31,950 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:31,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2024-11-09 15:20:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:32,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:32,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 15:20:32,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 15:20:32,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440249239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:32,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:32,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-09 15:20:32,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851668041] [2024-11-09 15:20:32,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:32,061 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:32,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash 43524783, now seen corresponding path program 2 times [2024-11-09 15:20:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415805962] [2024-11-09 15:20:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:32,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:32,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:32,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:32,156 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:32,157 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:32,157 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:32,157 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:32,157 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:32,157 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:32,157 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:32,157 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:32,157 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2024-11-09 15:20:32,157 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:32,157 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:32,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:32,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:32,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:32,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:32,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:32,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-09 15:20:32,241 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:32,241 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:32,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:32,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:32,243 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:32,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-09 15:20:32,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:32,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:32,256 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:32,257 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:32,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-09 15:20:32,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:32,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:32,269 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:32,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-09 15:20:32,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:32,271 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:32,282 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:32,282 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:32,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:32,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:32,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:32,294 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:32,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-09 15:20:32,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:32,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:32,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:32,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:32,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:32,327 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:32,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-09 15:20:32,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:32,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:39,390 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:39,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-11-09 15:20:39,398 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:39,398 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:39,398 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:39,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:39,398 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:39,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:39,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:39,398 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:39,398 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2024-11-09 15:20:39,398 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:39,398 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:39,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:39,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:39,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:39,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:39,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:39,450 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:39,451 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:39,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:39,452 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:39,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-09 15:20:39,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:39,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:39,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:39,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:39,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:39,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:39,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:39,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:39,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:39,471 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:39,471 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:20:39,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:39,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:39,472 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:39,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-09 15:20:39,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:39,474 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:39,474 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:39,474 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2024-11-09 15:20:39,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-11-09 15:20:39,485 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:39,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:39,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:20:39,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:39,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:20:39,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:39,704 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:39,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:20:39,777 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1305 states and 2307 transitions. Complement of second has 15 states. [2024-11-09 15:20:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:20:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2024-11-09 15:20:39,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 51 letters. Loop has 5 letters. [2024-11-09 15:20:39,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:39,779 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:39,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:39,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:20:39,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:39,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:20:39,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:40,001 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:40,001 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:20:40,065 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1305 states and 2307 transitions. Complement of second has 15 states. [2024-11-09 15:20:40,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:20:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2024-11-09 15:20:40,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 51 letters. Loop has 5 letters. [2024-11-09 15:20:40,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:40,068 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:40,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:40,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:20:40,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:40,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:20:40,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:40,270 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:40,270 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:20:40,358 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1248 states and 2239 transitions. cyclomatic complexity: 1040. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1957 states and 3620 transitions. Complement of second has 20 states. [2024-11-09 15:20:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:20:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2024-11-09 15:20:40,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 51 letters. Loop has 5 letters. [2024-11-09 15:20:40,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:40,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 56 letters. Loop has 5 letters. [2024-11-09 15:20:40,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:40,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 51 letters. Loop has 10 letters. [2024-11-09 15:20:40,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:40,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1957 states and 3620 transitions. [2024-11-09 15:20:40,377 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 129 [2024-11-09 15:20:40,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1957 states to 1570 states and 3178 transitions. [2024-11-09 15:20:40,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2024-11-09 15:20:40,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 348 [2024-11-09 15:20:40,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1570 states and 3178 transitions. [2024-11-09 15:20:40,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:40,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1570 states and 3178 transitions. [2024-11-09 15:20:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states and 3178 transitions. [2024-11-09 15:20:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1355. [2024-11-09 15:20:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 897 states have (on average 1.274247491638796) internal successors, (1143), 1004 states have internal predecessors, (1143), 314 states have call successors, (323), 176 states have call predecessors, (323), 144 states have return successors, (926), 174 states have call predecessors, (926), 291 states have call successors, (926) [2024-11-09 15:20:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2392 transitions. [2024-11-09 15:20:40,442 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1355 states and 2392 transitions. [2024-11-09 15:20:40,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:40,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 15:20:40,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:20:40,442 INFO L87 Difference]: Start difference. First operand 1355 states and 2392 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:40,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-11-09 15:20:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:40,550 INFO L93 Difference]: Finished difference Result 1374 states and 2399 transitions. [2024-11-09 15:20:40,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1374 states and 2399 transitions. [2024-11-09 15:20:40,557 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 110 [2024-11-09 15:20:40,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1374 states to 1356 states and 2379 transitions. [2024-11-09 15:20:40,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2024-11-09 15:20:40,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2024-11-09 15:20:40,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1356 states and 2379 transitions. [2024-11-09 15:20:40,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:40,570 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1356 states and 2379 transitions. [2024-11-09 15:20:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states and 2379 transitions. [2024-11-09 15:20:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1327. [2024-11-09 15:20:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 878 states have (on average 1.2710706150341686) internal successors, (1116), 982 states have internal predecessors, (1116), 306 states have call successors, (313), 172 states have call predecessors, (313), 143 states have return successors, (906), 172 states have call predecessors, (906), 287 states have call successors, (906) [2024-11-09 15:20:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2335 transitions. [2024-11-09 15:20:40,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1327 states and 2335 transitions. [2024-11-09 15:20:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:20:40,602 INFO L425 stractBuchiCegarLoop]: Abstraction has 1327 states and 2335 transitions. [2024-11-09 15:20:40,602 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-09 15:20:40,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1327 states and 2335 transitions. [2024-11-09 15:20:40,606 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 107 [2024-11-09 15:20:40,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:40,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:40,607 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:40,607 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:40,608 INFO L745 eck$LassoCheckResult]: Stem: 42949#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 42895#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 42896#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 42893#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 42894#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 42966#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 43076#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 43077#$Ultimate##0 ~p := #in~p;~q := #in~q; 43079#L20 assume ~p <= 0;#res := 1; 43078#partsFINAL assume true; 43075#partsEXIT >#71#return; 43060#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43057#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 42989#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 43009#$Ultimate##0 ~p := #in~p;~q := #in~q; 42991#L20 assume ~p <= 0;#res := 1; 42988#partsFINAL assume true; 42990#partsEXIT >#71#return; 43088#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42967#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 42968#L35-3 havoc main_~q~0#1; 42903#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42904#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 42950#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 42951#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 42979#$Ultimate##0 ~p := #in~p;~q := #in~q; 42978#L20 assume !(~p <= 0); 42977#L21 assume ~q <= 0;#res := 0; 42975#partsFINAL assume true; 42976#partsEXIT >#71#return; 42960#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42961#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 42899#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 42900#$Ultimate##0 ~p := #in~p;~q := #in~q; 43339#L20 assume !(~p <= 0); 43336#L21 assume !(~q <= 0); 43334#L22 assume !(~q > ~p); 43330#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43331#$Ultimate##0 ~p := #in~p;~q := #in~q; 43349#L20 assume ~p <= 0;#res := 1; 43348#partsFINAL assume true; 43329#partsEXIT >#67#return; 43321#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 43324#$Ultimate##0 ~p := #in~p;~q := #in~q; 43347#L20 assume !(~p <= 0); 43343#L21 assume ~q <= 0;#res := 0; 43326#partsFINAL assume true; 43320#partsEXIT >#69#return; 43315#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 43312#partsFINAL assume true; 43309#partsEXIT >#71#return; 43107#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43056#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 42981#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 42986#$Ultimate##0 ~p := #in~p;~q := #in~q; 43061#L20 assume !(~p <= 0); 43014#L21 assume !(~q <= 0); 43015#L22 assume ~q > ~p; 43004#L22-1 call #t~ret0 := parts(~p, ~p);< 43008#$Ultimate##0 ~p := #in~p;~q := #in~q; 43666#L20 assume !(~p <= 0); 43865#L21 assume !(~q <= 0); 43863#L22 assume !(~q > ~p); 43830#L23 [2024-11-09 15:20:40,608 INFO L747 eck$LassoCheckResult]: Loop: 43830#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43861#$Ultimate##0 ~p := #in~p;~q := #in~q; 43864#L20 assume ~p <= 0;#res := 1; 43862#partsFINAL assume true; 43860#partsEXIT >#67#return; 43019#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 43723#$Ultimate##0 ~p := #in~p;~q := #in~q; 43827#L20 assume !(~p <= 0); 43824#L21 assume !(~q <= 0); 43825#L22 assume !(~q > ~p); 43830#L23 [2024-11-09 15:20:40,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1115927007, now seen corresponding path program 1 times [2024-11-09 15:20:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673130140] [2024-11-09 15:20:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:40,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:40,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:40,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:20:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 15:20:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:40,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 15:20:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:40,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:40,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 42 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-09 15:20:40,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:40,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673130140] [2024-11-09 15:20:40,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673130140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:40,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995649594] [2024-11-09 15:20:40,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:40,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:40,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:40,686 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:40,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2024-11-09 15:20:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:40,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:40,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 42 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-09 15:20:40,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 42 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-09 15:20:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995649594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:40,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:40,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-09 15:20:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708072819] [2024-11-09 15:20:40,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:40,843 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:40,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash -172323367, now seen corresponding path program 2 times [2024-11-09 15:20:40,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:40,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843567000] [2024-11-09 15:20:40,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:40,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:40,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:40,964 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:40,964 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:40,964 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:40,964 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:40,964 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:40,964 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:40,964 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:40,964 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:40,964 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2024-11-09 15:20:40,964 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:40,965 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:40,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:40,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:40,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:40,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:40,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:41,019 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:41,019 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:41,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:41,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:41,037 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:41,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-09 15:20:41,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:41,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:41,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-11-09 15:20:41,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:41,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:41,069 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:41,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-09 15:20:41,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:41,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:41,748 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:41,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-11-09 15:20:41,753 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:41,753 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:41,754 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:41,754 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:41,754 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:41,754 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:41,754 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:41,754 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:41,754 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2024-11-09 15:20:41,754 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:41,754 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:41,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:41,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:41,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:41,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:41,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:41,815 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:41,816 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:41,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:41,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:41,820 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:41,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-09 15:20:41,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:41,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:41,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:41,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:41,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:41,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:41,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:41,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:41,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:41,843 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:41,843 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:20:41,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:41,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:41,845 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:41,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-09 15:20:41,847 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:41,847 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:41,847 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:41,847 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2024-11-09 15:20:41,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:41,862 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:41,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:41,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:20:41,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:42,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:20:42,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:42,159 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2024-11-09 15:20:42,159 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053 Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:42,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-11-09 15:20:42,316 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 4172 states and 7487 transitions. Complement of second has 23 states. [2024-11-09 15:20:42,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2024-11-09 15:20:42,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 63 letters. Loop has 10 letters. [2024-11-09 15:20:42,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:42,320 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:42,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:42,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:20:42,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:42,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:20:42,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:42,644 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2024-11-09 15:20:42,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053 Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:42,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 4094 states and 7449 transitions. Complement of second has 25 states. [2024-11-09 15:20:42,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2024-11-09 15:20:42,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 63 letters. Loop has 10 letters. [2024-11-09 15:20:42,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:42,791 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:42,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:42,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:20:42,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:20:43,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:43,082 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2024-11-09 15:20:43,082 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053 Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:43,275 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1327 states and 2335 transitions. cyclomatic complexity: 1053. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 9334 states and 15635 transitions. Complement of second has 102 states. [2024-11-09 15:20:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2024-11-09 15:20:43,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 63 letters. Loop has 10 letters. [2024-11-09 15:20:43,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:43,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 73 letters. Loop has 10 letters. [2024-11-09 15:20:43,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:43,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 63 letters. Loop has 20 letters. [2024-11-09 15:20:43,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:43,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9334 states and 15635 transitions. [2024-11-09 15:20:43,343 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 180 [2024-11-09 15:20:43,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9334 states to 5775 states and 10049 transitions. [2024-11-09 15:20:43,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2024-11-09 15:20:43,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2024-11-09 15:20:43,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5775 states and 10049 transitions. [2024-11-09 15:20:43,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:43,419 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5775 states and 10049 transitions. [2024-11-09 15:20:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states and 10049 transitions. [2024-11-09 15:20:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 4678. [2024-11-09 15:20:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4678 states, 2807 states have (on average 1.2582828642679016) internal successors, (3532), 3388 states have internal predecessors, (3532), 1395 states have call successors, (1478), 611 states have call predecessors, (1478), 476 states have return successors, (2680), 678 states have call predecessors, (2680), 1346 states have call successors, (2680) [2024-11-09 15:20:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4678 states to 4678 states and 7690 transitions. [2024-11-09 15:20:43,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4678 states and 7690 transitions. [2024-11-09 15:20:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:43,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 15:20:43,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-09 15:20:43,552 INFO L87 Difference]: Start difference. First operand 4678 states and 7690 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 15:20:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:43,632 INFO L93 Difference]: Finished difference Result 4727 states and 7780 transitions. [2024-11-09 15:20:43,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4727 states and 7780 transitions. [2024-11-09 15:20:43,658 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 154 [2024-11-09 15:20:43,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4727 states to 4711 states and 7761 transitions. [2024-11-09 15:20:43,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2024-11-09 15:20:43,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2024-11-09 15:20:43,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4711 states and 7761 transitions. [2024-11-09 15:20:43,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:43,744 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4711 states and 7761 transitions. [2024-11-09 15:20:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states and 7761 transitions. [2024-11-09 15:20:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 4681. [2024-11-09 15:20:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4681 states, 2809 states have (on average 1.2580989676041296) internal successors, (3534), 3390 states have internal predecessors, (3534), 1396 states have call successors, (1479), 611 states have call predecessors, (1479), 476 states have return successors, (2681), 679 states have call predecessors, (2681), 1347 states have call successors, (2681) [2024-11-09 15:20:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 7694 transitions. [2024-11-09 15:20:43,831 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4681 states and 7694 transitions. [2024-11-09 15:20:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 15:20:43,832 INFO L425 stractBuchiCegarLoop]: Abstraction has 4681 states and 7694 transitions. [2024-11-09 15:20:43,832 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-09 15:20:43,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4681 states and 7694 transitions. [2024-11-09 15:20:43,845 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 141 [2024-11-09 15:20:43,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:43,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:43,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 7, 6, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:43,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 15:20:43,846 INFO L745 eck$LassoCheckResult]: Stem: 72525#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 72478#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 72479#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 72476#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 72477#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 72543#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 74622#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 74642#$Ultimate##0 ~p := #in~p;~q := #in~q; 74656#L20 assume ~p <= 0;#res := 1; 74644#partsFINAL assume true; 74641#partsEXIT >#71#return; 74639#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74621#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 74611#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72580#$Ultimate##0 ~p := #in~p;~q := #in~q; 74657#L20 assume ~p <= 0;#res := 1; 74625#partsFINAL assume true; 74610#partsEXIT >#71#return; 73625#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 73562#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 72563#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72568#$Ultimate##0 ~p := #in~p;~q := #in~q; 72565#L20 assume ~p <= 0;#res := 1; 72562#partsFINAL assume true; 72564#partsEXIT >#71#return; 74537#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 72526#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 72527#L35-3 havoc main_~q~0#1; 72491#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 72492#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 72544#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 72480#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72481#$Ultimate##0 ~p := #in~p;~q := #in~q; 74536#L20 assume !(~p <= 0); 74535#L21 assume ~q <= 0;#res := 0; 72551#partsFINAL assume true; 72549#partsEXIT >#71#return; 72550#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74529#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 74524#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 74526#$Ultimate##0 ~p := #in~p;~q := #in~q; 74578#L20 assume !(~p <= 0); 74575#L21 assume !(~q <= 0); 74572#L22 assume !(~q > ~p); 74569#L23 call #t~ret1 := parts(~p - ~q, ~q);< 74570#$Ultimate##0 ~p := #in~p;~q := #in~q; 74580#L20 assume ~p <= 0;#res := 1; 74579#partsFINAL assume true; 74568#partsEXIT >#67#return; 74540#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 74541#$Ultimate##0 ~p := #in~p;~q := #in~q; 74567#L20 assume !(~p <= 0); 74566#L21 assume ~q <= 0;#res := 0; 74565#partsFINAL assume true; 74539#partsEXIT >#69#return; 74530#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 74527#partsFINAL assume true; 74523#partsEXIT >#71#return; 72901#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 72670#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 72559#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 72631#$Ultimate##0 ~p := #in~p;~q := #in~q; 72629#L20 assume !(~p <= 0); 72627#L21 assume !(~q <= 0); 72608#L22 assume !(~q > ~p); 72610#L23 call #t~ret1 := parts(~p - ~q, ~q);< 72857#$Ultimate##0 ~p := #in~p;~q := #in~q; 73256#L20 assume !(~p <= 0); 73255#L21 assume !(~q <= 0); 73111#L22 assume !(~q > ~p); 73112#L23 [2024-11-09 15:20:43,846 INFO L747 eck$LassoCheckResult]: Loop: 73112#L23 call #t~ret1 := parts(~p - ~q, ~q);< 73250#$Ultimate##0 ~p := #in~p;~q := #in~q; 74438#L20 assume ~p <= 0;#res := 1; 74437#partsFINAL assume true; 73247#partsEXIT >#67#return; 73110#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 73210#$Ultimate##0 ~p := #in~p;~q := #in~q; 73125#L20 assume !(~p <= 0); 73121#L21 assume !(~q <= 0); 73122#L22 assume !(~q > ~p); 72688#L23 call #t~ret1 := parts(~p - ~q, ~q);< 72857#$Ultimate##0 ~p := #in~p;~q := #in~q; 73256#L20 assume !(~p <= 0); 73255#L21 assume !(~q <= 0); 73111#L22 assume !(~q > ~p); 73112#L23 [2024-11-09 15:20:43,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:43,846 INFO L85 PathProgramCache]: Analyzing trace with hash 34537157, now seen corresponding path program 1 times [2024-11-09 15:20:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208294835] [2024-11-09 15:20:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:20:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 15:20:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:20:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 15:20:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 15:20:43,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:43,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208294835] [2024-11-09 15:20:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208294835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:43,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640284478] [2024-11-09 15:20:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:43,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:43,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:43,946 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:43,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-11-09 15:20:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:20:43,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 15:20:44,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 15:20:44,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640284478] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:44,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:44,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-09 15:20:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943258006] [2024-11-09 15:20:44,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:44,141 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:44,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1614589677, now seen corresponding path program 3 times [2024-11-09 15:20:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:44,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114092574] [2024-11-09 15:20:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:44,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:44,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:44,323 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:44,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:44,323 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:44,324 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:44,324 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:44,324 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,324 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:44,324 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:44,324 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2024-11-09 15:20:44,324 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:44,324 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:44,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,376 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:44,376 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:44,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,378 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:44,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-11-09 15:20:44,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,379 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,390 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,390 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:44,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-11-09 15:20:44,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,401 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:44,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-11-09 15:20:44,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,413 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,413 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:44,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:44,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,424 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:44,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-11-09 15:20:44,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,435 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,435 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:44,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-11-09 15:20:44,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,446 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:44,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-11-09 15:20:44,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-11-09 15:20:44,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,479 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:44,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-11-09 15:20:44,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:44,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:48,277 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:48,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:48,284 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:48,284 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:48,284 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:48,284 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:48,284 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:48,284 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,284 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:48,284 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:48,284 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2024-11-09 15:20:48,284 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:48,284 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:48,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,342 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:48,342 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:48,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,349 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:48,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-11-09 15:20:48,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:48,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:48,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:48,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:48,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:48,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:48,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:48,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:48,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:48,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-09 15:20:48,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,375 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:48,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-11-09 15:20:48,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:48,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:48,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:48,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:48,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:48,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:48,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:48,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:48,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:48,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-11-09 15:20:48,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,425 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:48,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-11-09 15:20:48,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:48,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:48,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:48,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:48,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:48,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:48,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:48,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:48,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:48,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-11-09 15:20:48,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,452 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:48,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-11-09 15:20:48,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:48,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:48,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:48,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:48,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:48,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:48,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:48,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:48,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:48,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-11-09 15:20:48,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,477 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:48,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-11-09 15:20:48,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:48,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:48,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:48,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:48,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:48,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:48,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:48,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:48,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:48,493 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:48,493 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:20:48,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,495 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:48,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-11-09 15:20:48,496 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:48,496 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:48,496 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:48,496 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2024-11-09 15:20:48,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-11-09 15:20:48,507 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:48,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:48,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:20:48,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:48,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 15:20:48,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:48,874 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-11-09 15:20:48,874 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:49,169 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 17123 states and 28306 transitions. Complement of second has 56 states. [2024-11-09 15:20:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2024-11-09 15:20:49,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 70 letters. Loop has 15 letters. [2024-11-09 15:20:49,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:49,170 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:49,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:49,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:20:49,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:49,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 15:20:49,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:49,512 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2024-11-09 15:20:49,512 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:49,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-11-09 15:20:49,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 19433 states and 32559 transitions. Complement of second has 54 states. [2024-11-09 15:20:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2024-11-09 15:20:49,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 70 letters. Loop has 15 letters. [2024-11-09 15:20:49,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:49,908 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:49,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:49,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:20:49,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:50,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 15:20:50,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:50,251 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-11-09 15:20:50,252 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:50,818 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4681 states and 7694 transitions. cyclomatic complexity: 3122. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 39830 states and 67154 transitions. Complement of second has 381 states. [2024-11-09 15:20:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 15:20:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2024-11-09 15:20:50,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 88 transitions. Stem has 70 letters. Loop has 15 letters. [2024-11-09 15:20:50,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:50,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 88 transitions. Stem has 85 letters. Loop has 15 letters. [2024-11-09 15:20:50,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:50,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 88 transitions. Stem has 70 letters. Loop has 30 letters. [2024-11-09 15:20:50,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:50,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39830 states and 67154 transitions. [2024-11-09 15:20:51,317 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 176 [2024-11-09 15:20:51,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39830 states to 15617 states and 27516 transitions. [2024-11-09 15:20:51,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2024-11-09 15:20:51,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 609 [2024-11-09 15:20:51,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15617 states and 27516 transitions. [2024-11-09 15:20:51,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:51,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15617 states and 27516 transitions. [2024-11-09 15:20:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states and 27516 transitions. [2024-11-09 15:20:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 12095. [2024-11-09 15:20:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12095 states, 7471 states have (on average 1.224467942711819) internal successors, (9148), 8740 states have internal predecessors, (9148), 3359 states have call successors, (3511), 1553 states have call predecessors, (3511), 1265 states have return successors, (6387), 1801 states have call predecessors, (6387), 3312 states have call successors, (6387) [2024-11-09 15:20:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12095 states to 12095 states and 19046 transitions. [2024-11-09 15:20:51,975 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12095 states and 19046 transitions. [2024-11-09 15:20:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:51,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 15:20:51,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-09 15:20:51,975 INFO L87 Difference]: Start difference. First operand 12095 states and 19046 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 12 states have internal predecessors, (42), 9 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 15:20:52,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:52,151 INFO L93 Difference]: Finished difference Result 10330 states and 15945 transitions. [2024-11-09 15:20:52,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10330 states and 15945 transitions. [2024-11-09 15:20:52,298 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 119 [2024-11-09 15:20:52,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10330 states to 10330 states and 15945 transitions. [2024-11-09 15:20:52,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 491 [2024-11-09 15:20:52,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2024-11-09 15:20:52,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10330 states and 15945 transitions. [2024-11-09 15:20:52,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:52,381 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10330 states and 15945 transitions. [2024-11-09 15:20:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10330 states and 15945 transitions. [2024-11-09 15:20:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10330 to 10303. [2024-11-09 15:20:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10303 states, 6358 states have (on average 1.2142183076439133) internal successors, (7720), 7443 states have internal predecessors, (7720), 2854 states have call successors, (2983), 1292 states have call predecessors, (2983), 1091 states have return successors, (5183), 1567 states have call predecessors, (5183), 2815 states have call successors, (5183) [2024-11-09 15:20:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10303 states to 10303 states and 15886 transitions. [2024-11-09 15:20:52,683 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10303 states and 15886 transitions. [2024-11-09 15:20:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 15:20:52,688 INFO L425 stractBuchiCegarLoop]: Abstraction has 10303 states and 15886 transitions. [2024-11-09 15:20:52,688 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-09 15:20:52,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10303 states and 15886 transitions. [2024-11-09 15:20:52,749 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 119 [2024-11-09 15:20:52,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:52,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:52,750 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 7, 7, 6, 6, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:52,750 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:20:52,754 INFO L745 eck$LassoCheckResult]: Stem: 177838#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 177789#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 177790#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 177787#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 177788#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 177856#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177911#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177912#$Ultimate##0 ~p := #in~p;~q := #in~q; 177914#L20 assume ~p <= 0;#res := 1; 177913#partsFINAL assume true; 177910#partsEXIT >#71#return; 177909#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 177906#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177902#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177903#$Ultimate##0 ~p := #in~p;~q := #in~q; 177908#L20 assume ~p <= 0;#res := 1; 177905#partsFINAL assume true; 177901#partsEXIT >#71#return; 177884#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 177883#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177877#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177881#$Ultimate##0 ~p := #in~p;~q := #in~q; 177876#L20 assume ~p <= 0;#res := 1; 177878#partsFINAL assume true; 177915#partsEXIT >#71#return; 177916#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 178331#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 178330#L35-3 havoc main_~q~0#1; 178329#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 178325#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 177857#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177858#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 178161#$Ultimate##0 ~p := #in~p;~q := #in~q; 178172#L20 assume !(~p <= 0); 178171#L21 assume ~q <= 0;#res := 0; 178169#partsFINAL assume true; 178160#partsEXIT >#71#return; 177846#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 177847#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177793#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 177794#$Ultimate##0 ~p := #in~p;~q := #in~q; 178186#L20 assume !(~p <= 0); 178184#L21 assume ~q <= 0;#res := 0; 178185#partsFINAL assume true; 178459#partsEXIT >#71#return; 178457#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 178456#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 178092#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 178094#$Ultimate##0 ~p := #in~p;~q := #in~q; 178475#L20 assume !(~p <= 0); 178473#L21 assume !(~q <= 0); 178471#L22 assume ~q > ~p; 178021#L22-1 call #t~ret0 := parts(~p, ~p);< 178244#$Ultimate##0 ~p := #in~p;~q := #in~q; 178476#L20 assume !(~p <= 0); 181154#L21 assume !(~q <= 0); 181153#L22 assume !(~q > ~p); 179253#L23 call #t~ret1 := parts(~p - ~q, ~q);< 181142#$Ultimate##0 ~p := #in~p;~q := #in~q; 184708#L20 assume ~p <= 0;#res := 1; 184707#partsFINAL assume true; 179252#partsEXIT >#67#return; 179250#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 179251#$Ultimate##0 ~p := #in~p;~q := #in~q; 179261#L20 assume !(~p <= 0); 179260#L21 assume ~q <= 0;#res := 0; 179259#partsFINAL assume true; 179249#partsEXIT >#69#return; 178044#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 178682#partsFINAL assume true; 178015#partsEXIT >#65#return; 178027#L22-2 #res := #t~ret0;havoc #t~ret0; 178240#partsFINAL assume true; 178091#partsEXIT >#71#return; 178078#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 178077#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 177867#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 178075#$Ultimate##0 ~p := #in~p;~q := #in~q; 178006#L20 assume !(~p <= 0); 177996#L21 assume !(~q <= 0); 177945#L22 assume ~q > ~p; 177888#L22-1 call #t~ret0 := parts(~p, ~p);< 177940#$Ultimate##0 [2024-11-09 15:20:52,754 INFO L747 eck$LassoCheckResult]: Loop: 177940#$Ultimate##0 ~p := #in~p;~q := #in~q; 177938#L20 assume !(~p <= 0); 177936#L21 assume !(~q <= 0); 177932#L22 assume ~q > ~p; 177894#L22-1 call #t~ret0 := parts(~p, ~p);< 177940#$Ultimate##0 [2024-11-09 15:20:52,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash -9765940, now seen corresponding path program 1 times [2024-11-09 15:20:52,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:52,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76605917] [2024-11-09 15:20:52,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:52,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:20:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 15:20:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:20:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 15:20:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 15:20:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-09 15:20:52,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76605917] [2024-11-09 15:20:52,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76605917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871912553] [2024-11-09 15:20:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:52,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:52,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:52,935 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:52,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2024-11-09 15:20:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:53,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:20:53,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 15:20:53,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:20:53,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871912553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:53,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:20:53,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-09 15:20:53,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086832127] [2024-11-09 15:20:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:53,069 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:53,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash 28756408, now seen corresponding path program 2 times [2024-11-09 15:20:53,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:53,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429096876] [2024-11-09 15:20:53,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:53,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:53,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:53,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:53,132 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:53,133 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:53,133 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:53,133 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:53,133 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:53,133 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,133 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:53,134 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:53,134 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2024-11-09 15:20:53,134 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:53,134 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:53,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,175 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:53,175 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:53,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,177 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-11-09 15:20:53,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:53,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:53,190 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:53,190 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:53,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-11-09 15:20:53,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,202 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-09 15:20:53,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:53,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:53,214 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:53,214 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:53,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:53,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,226 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-11-09 15:20:53,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:53,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:53,238 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:53,238 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:53,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-09 15:20:53,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,250 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-11-09 15:20:53,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:53,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:53,262 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:53,262 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:53,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-11-09 15:20:53,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,274 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-11-09 15:20:53,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:53,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:53,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-11-09 15:20:53,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,305 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-09 15:20:53,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:53,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:53,343 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:53,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:53,348 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:53,348 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:53,348 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:53,348 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:53,348 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:53,348 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,348 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:53,348 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:53,348 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2024-11-09 15:20:53,348 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:53,348 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:53,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:53,387 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:53,387 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:53,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,388 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-09 15:20:53,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:53,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:53,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:53,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:53,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:53,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:53,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:53,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:53,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:53,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-11-09 15:20:53,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,413 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-11-09 15:20:53,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:53,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:53,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:53,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:53,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:53,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:53,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:53,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:53,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:53,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-11-09 15:20:53,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,439 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-11-09 15:20:53,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:53,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:53,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:53,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:53,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:53,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:53,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:53,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:53,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:53,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-11-09 15:20:53,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,466 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-11-09 15:20:53,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:53,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:53,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:53,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:53,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:53,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:53,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:53,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:53,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:53,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-11-09 15:20:53,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,490 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-11-09 15:20:53,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:53,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:53,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:53,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:53,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:53,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:53,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:53,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:53,504 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:53,507 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:53,507 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:20:53,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:53,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:53,510 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:53,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-11-09 15:20:53,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:53,511 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:53,511 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:53,511 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2024-11-09 15:20:53,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:53,522 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:53,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:53,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:20:53,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:53,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:53,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:53,888 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:53,888 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809 Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:20:54,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-11-09 15:20:54,082 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 15816 states and 22568 transitions. Complement of second has 42 states. [2024-11-09 15:20:54,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:20:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2024-11-09 15:20:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 82 letters. Loop has 5 letters. [2024-11-09 15:20:54,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:54,084 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:54,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:54,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:20:54,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:54,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:54,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:54,385 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:54,385 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809 Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:20:54,532 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 15816 states and 22568 transitions. Complement of second has 42 states. [2024-11-09 15:20:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:20:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2024-11-09 15:20:54,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 82 letters. Loop has 5 letters. [2024-11-09 15:20:54,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:54,534 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:54,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:54,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:20:54,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:54,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:54,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:54,911 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:20:54,911 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809 Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:20:55,078 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10303 states and 15886 transitions. cyclomatic complexity: 5809. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 21413 states and 31115 transitions. Complement of second has 43 states. [2024-11-09 15:20:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:20:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2024-11-09 15:20:55,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 82 letters. Loop has 5 letters. [2024-11-09 15:20:55,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:55,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 87 letters. Loop has 5 letters. [2024-11-09 15:20:55,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:55,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 82 letters. Loop has 10 letters. [2024-11-09 15:20:55,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:55,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21413 states and 31115 transitions. [2024-11-09 15:20:55,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2024-11-09 15:20:55,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21413 states to 11927 states and 19027 transitions. [2024-11-09 15:20:55,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2024-11-09 15:20:55,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2024-11-09 15:20:55,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11927 states and 19027 transitions. [2024-11-09 15:20:55,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:55,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11927 states and 19027 transitions. [2024-11-09 15:20:55,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11927 states and 19027 transitions. [2024-11-09 15:20:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11927 to 7997. [2024-11-09 15:20:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7997 states, 4994 states have (on average 1.21005206247497) internal successors, (6043), 5713 states have internal predecessors, (6043), 2108 states have call successors, (2201), 1006 states have call predecessors, (2201), 895 states have return successors, (3780), 1277 states have call predecessors, (3780), 2096 states have call successors, (3780) [2024-11-09 15:20:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 12024 transitions. [2024-11-09 15:20:55,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7997 states and 12024 transitions. [2024-11-09 15:20:55,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:55,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:20:55,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:20:55,562 INFO L87 Difference]: Start difference. First operand 7997 states and 12024 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 15:20:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:55,640 INFO L93 Difference]: Finished difference Result 4190 states and 6496 transitions. [2024-11-09 15:20:55,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4190 states and 6496 transitions. [2024-11-09 15:20:55,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-11-09 15:20:55,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4190 states to 4106 states and 6348 transitions. [2024-11-09 15:20:55,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2024-11-09 15:20:55,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2024-11-09 15:20:55,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4106 states and 6348 transitions. [2024-11-09 15:20:55,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:55,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4106 states and 6348 transitions. [2024-11-09 15:20:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states and 6348 transitions. [2024-11-09 15:20:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4045. [2024-11-09 15:20:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4045 states, 2527 states have (on average 1.216462208151959) internal successors, (3074), 2888 states have internal predecessors, (3074), 1061 states have call successors, (1117), 524 states have call predecessors, (1117), 457 states have return successors, (1948), 632 states have call predecessors, (1948), 1060 states have call successors, (1948) [2024-11-09 15:20:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4045 states to 4045 states and 6139 transitions. [2024-11-09 15:20:55,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4045 states and 6139 transitions. [2024-11-09 15:20:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:20:55,889 INFO L425 stractBuchiCegarLoop]: Abstraction has 4045 states and 6139 transitions. [2024-11-09 15:20:55,889 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-09 15:20:55,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4045 states and 6139 transitions. [2024-11-09 15:20:55,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-11-09 15:20:55,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:55,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:55,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:55,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:55,905 INFO L745 eck$LassoCheckResult]: Stem: 254643#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 254601#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 254602#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 254594#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 254595#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 254661#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254696#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254697#$Ultimate##0 ~p := #in~p;~q := #in~q; 254699#L20 assume ~p <= 0;#res := 1; 254698#partsFINAL assume true; 254695#partsEXIT >#71#return; 254694#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254692#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254689#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254690#$Ultimate##0 ~p := #in~p;~q := #in~q; 254701#L20 assume ~p <= 0;#res := 1; 254700#partsFINAL assume true; 254688#partsEXIT >#71#return; 254686#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254685#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254679#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254683#$Ultimate##0 ~p := #in~p;~q := #in~q; 254678#L20 assume ~p <= 0;#res := 1; 254680#partsFINAL assume true; 254719#partsEXIT >#71#return; 254720#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254795#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 254618#L35-3 havoc main_~q~0#1; 254619#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 254789#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 254787#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254596#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254597#$Ultimate##0 ~p := #in~p;~q := #in~q; 254794#L20 assume !(~p <= 0); 254793#L21 assume ~q <= 0;#res := 0; 254792#partsFINAL assume true; 254665#partsEXIT >#71#return; 254666#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254763#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254729#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254732#$Ultimate##0 ~p := #in~p;~q := #in~q; 254838#L20 assume !(~p <= 0); 254832#L21 assume !(~q <= 0); 254828#L22 assume !(~q > ~p); 254829#L23 call #t~ret1 := parts(~p - ~q, ~q);< 255049#$Ultimate##0 ~p := #in~p;~q := #in~q; 255052#L20 assume ~p <= 0;#res := 1; 255051#partsFINAL assume true; 255048#partsEXIT >#67#return; 255045#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 255046#$Ultimate##0 ~p := #in~p;~q := #in~q; 255057#L20 assume !(~p <= 0); 255054#L21 assume ~q <= 0;#res := 0; 255053#partsFINAL assume true; 255044#partsEXIT >#69#return; 255037#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 255032#partsFINAL assume true; 254728#partsEXIT >#71#return; 254725#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254722#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254668#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254600#$Ultimate##0 ~p := #in~p;~q := #in~q; 254726#L20 assume !(~p <= 0); 254727#L21 assume !(~q <= 0); 254721#L22 assume ~q > ~p; 254714#L22-1 call #t~ret0 := parts(~p, ~p);< 256832#$Ultimate##0 ~p := #in~p;~q := #in~q; 256833#L20 assume !(~p <= 0); 257125#L21 assume !(~q <= 0); 257122#L22 assume !(~q > ~p); 257112#L23 call #t~ret1 := parts(~p - ~q, ~q);< 257116#$Ultimate##0 ~p := #in~p;~q := #in~q; 257302#L20 assume ~p <= 0;#res := 1; 257301#partsFINAL assume true; 257229#partsEXIT >#67#return; 257154#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 257166#$Ultimate##0 ~p := #in~p;~q := #in~q; 257324#L20 assume !(~p <= 0); 257309#L21 assume ~q <= 0;#res := 0; 257307#partsFINAL assume true; 257153#partsEXIT >#69#return; 257152#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 256622#partsFINAL assume true; 254702#partsEXIT >#65#return; 254681#L22-2 #res := #t~ret0;havoc #t~ret0; 254682#partsFINAL assume true; 254667#partsEXIT >#71#return; 254664#L36-1 [2024-11-09 15:20:55,906 INFO L747 eck$LassoCheckResult]: Loop: 254664#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254647#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 254648#L35-3 havoc main_~q~0#1; 254614#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 254615#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 254662#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254663#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254674#$Ultimate##0 ~p := #in~p;~q := #in~q; 254673#L20 assume !(~p <= 0); 254672#L21 assume ~q <= 0;#res := 0; 254670#partsFINAL assume true; 254671#partsEXIT >#71#return; 254654#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254655#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254733#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254750#$Ultimate##0 ~p := #in~p;~q := #in~q; 254785#L20 assume !(~p <= 0); 254784#L21 assume !(~q <= 0); 254781#L22 assume !(~q > ~p); 254778#L23 call #t~ret1 := parts(~p - ~q, ~q);< 254779#$Ultimate##0 ~p := #in~p;~q := #in~q; 254788#L20 assume ~p <= 0;#res := 1; 254786#partsFINAL assume true; 254777#partsEXIT >#67#return; 254758#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 254760#$Ultimate##0 ~p := #in~p;~q := #in~q; 254783#L20 assume !(~p <= 0); 254780#L21 assume ~q <= 0;#res := 0; 254764#partsFINAL assume true; 254757#partsEXIT >#69#return; 254755#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 254753#partsFINAL assume true; 254752#partsEXIT >#71#return; 254742#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 254740#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 254676#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 254737#$Ultimate##0 ~p := #in~p;~q := #in~q; 254816#L20 assume !(~p <= 0); 254815#L21 assume !(~q <= 0); 254812#L22 assume ~q > ~p; 254705#L22-1 call #t~ret0 := parts(~p, ~p);< 254718#$Ultimate##0 ~p := #in~p;~q := #in~q; 256943#L20 assume !(~p <= 0); 257076#L21 assume !(~q <= 0); 257074#L22 assume !(~q > ~p); 257064#L23 call #t~ret1 := parts(~p - ~q, ~q);< 257068#$Ultimate##0 ~p := #in~p;~q := #in~q; 257300#L20 assume ~p <= 0;#res := 1; 257289#partsFINAL assume true; 257228#partsEXIT >#67#return; 257154#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 257166#$Ultimate##0 ~p := #in~p;~q := #in~q; 257324#L20 assume !(~p <= 0); 257309#L21 assume ~q <= 0;#res := 0; 257307#partsFINAL assume true; 257153#partsEXIT >#69#return; 257152#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 256622#partsFINAL assume true; 254702#partsEXIT >#65#return; 254716#L22-2 #res := #t~ret0;havoc #t~ret0; 254675#partsFINAL assume true; 254677#partsEXIT >#71#return; 254664#L36-1 [2024-11-09 15:20:55,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:55,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 2 times [2024-11-09 15:20:55,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:55,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100499877] [2024-11-09 15:20:55,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:55,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:55,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:55,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:55,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash -96725577, now seen corresponding path program 1 times [2024-11-09 15:20:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:55,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298480154] [2024-11-09 15:20:55,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:55,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:55,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:55,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1897649466, now seen corresponding path program 3 times [2024-11-09 15:20:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:55,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317142313] [2024-11-09 15:20:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:55,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:20:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 15:20:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:20:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 15:20:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 15:20:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 15:20:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 15:20:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 15:20:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 154 proven. 76 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2024-11-09 15:20:56,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:56,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317142313] [2024-11-09 15:20:56,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317142313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:56,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856036226] [2024-11-09 15:20:56,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:20:56,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:56,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:56,199 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:56,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2024-11-09 15:20:56,258 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-09 15:20:56,258 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:20:56,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:20:56,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 474 proven. 32 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2024-11-09 15:20:56,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 185 proven. 86 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2024-11-09 15:20:56,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856036226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:56,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:56,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2024-11-09 15:20:56,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64954393] [2024-11-09 15:20:56,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:57,042 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:57,042 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:57,042 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:57,042 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:57,043 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:57,043 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:57,043 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:57,043 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:57,043 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2024-11-09 15:20:57,043 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:57,043 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:57,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:57,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:57,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:57,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:57,075 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:57,075 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:57,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:57,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:57,077 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:57,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-11-09 15:20:57,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:57,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:57,096 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:57,097 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=2, ULTIMATE.start_main_~q~0#1=2} Honda state: {ULTIMATE.start_main_~x~0#1=2, ULTIMATE.start_main_~q~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:20:57,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-11-09 15:20:57,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:57,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:57,109 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:57,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-11-09 15:20:57,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:57,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:57,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:57,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:57,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:57,174 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:57,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-11-09 15:20:57,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:57,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:57,187 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:57,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-11-09 15:20:57,198 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:57,198 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:57,198 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:57,198 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:57,198 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:57,198 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:57,198 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:57,198 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:57,198 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2024-11-09 15:20:57,198 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:57,198 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:57,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:57,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:57,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:57,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:57,234 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:57,235 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:57,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:57,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:57,236 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:57,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-11-09 15:20:57,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:57,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:57,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:57,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:57,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:57,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:57,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:57,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:57,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:57,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-11-09 15:20:57,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:57,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:57,261 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:57,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-11-09 15:20:57,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:57,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:57,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:57,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:57,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:57,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:57,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:57,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:57,274 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:57,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:57,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:57,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:57,286 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:57,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-11-09 15:20:57,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:57,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:57,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:57,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:57,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:57,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:57,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:57,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:57,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:57,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2024-11-09 15:20:57,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:57,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:57,311 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:57,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-11-09 15:20:57,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:20:57,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:57,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:57,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:57,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:57,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:57,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:57,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:57,325 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:57,326 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:57,326 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:20:57,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:57,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:57,327 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:20:57,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-11-09 15:20:57,329 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:57,329 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:57,329 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:57,329 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 1 Supporting invariants [] [2024-11-09 15:20:57,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-11-09 15:20:57,340 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:57,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:57,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:20:57,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:57,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 15:20:57,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 14 proven. 47 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 15:20:57,865 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2024-11-09 15:20:57,865 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4045 states and 6139 transitions. cyclomatic complexity: 2186 Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-09 15:20:58,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4045 states and 6139 transitions. cyclomatic complexity: 2186. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) Result 9389 states and 14758 transitions. Complement of second has 71 states. [2024-11-09 15:20:58,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2024-11-09 15:20:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-09 15:20:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2024-11-09 15:20:58,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 82 transitions. Stem has 87 letters. Loop has 62 letters. [2024-11-09 15:20:58,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:58,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 82 transitions. Stem has 149 letters. Loop has 62 letters. [2024-11-09 15:20:58,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:58,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 82 transitions. Stem has 87 letters. Loop has 124 letters. [2024-11-09 15:20:58,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:58,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9389 states and 14758 transitions. [2024-11-09 15:20:58,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2024-11-09 15:20:58,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9389 states to 9336 states and 14686 transitions. [2024-11-09 15:20:58,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 491 [2024-11-09 15:20:58,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2024-11-09 15:20:58,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9336 states and 14686 transitions. [2024-11-09 15:20:58,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:58,254 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9336 states and 14686 transitions. [2024-11-09 15:20:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9336 states and 14686 transitions. [2024-11-09 15:20:58,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-11-09 15:20:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9336 to 8436. [2024-11-09 15:20:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8436 states, 5176 states have (on average 1.2078825347758888) internal successors, (6252), 5956 states have internal predecessors, (6252), 2295 states have call successors, (2405), 1072 states have call predecessors, (2405), 965 states have return successors, (3541), 1407 states have call predecessors, (3541), 2292 states have call successors, (3541) [2024-11-09 15:20:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 12198 transitions. [2024-11-09 15:20:58,503 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8436 states and 12198 transitions. [2024-11-09 15:20:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:58,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 15:20:58,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-09 15:20:58,504 INFO L87 Difference]: Start difference. First operand 8436 states and 12198 transitions. Second operand has 21 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 14 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (22), 9 states have call predecessors, (22), 14 states have call successors, (22) [2024-11-09 15:20:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:58,789 INFO L93 Difference]: Finished difference Result 7265 states and 10824 transitions. [2024-11-09 15:20:58,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7265 states and 10824 transitions. [2024-11-09 15:20:58,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2024-11-09 15:20:58,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7265 states to 3744 states and 5610 transitions. [2024-11-09 15:20:58,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 396 [2024-11-09 15:20:58,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 396 [2024-11-09 15:20:58,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3744 states and 5610 transitions. [2024-11-09 15:20:58,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:58,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3744 states and 5610 transitions. [2024-11-09 15:20:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states and 5610 transitions. [2024-11-09 15:20:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3499. [2024-11-09 15:20:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 2147 states have (on average 1.1974848625989754) internal successors, (2571), 2445 states have internal predecessors, (2571), 939 states have call successors, (980), 440 states have call predecessors, (980), 413 states have return successors, (1449), 613 states have call predecessors, (1449), 936 states have call successors, (1449) [2024-11-09 15:20:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 5000 transitions. [2024-11-09 15:20:58,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3499 states and 5000 transitions. [2024-11-09 15:20:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 15:20:58,897 INFO L425 stractBuchiCegarLoop]: Abstraction has 3499 states and 5000 transitions. [2024-11-09 15:20:58,897 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-09 15:20:58,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3499 states and 5000 transitions. [2024-11-09 15:20:58,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2024-11-09 15:20:58,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:58,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:58,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:58,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 15, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:58,906 INFO L745 eck$LassoCheckResult]: Stem: 285453#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 285400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 285401#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 285394#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 285395#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 285495#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285492#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285493#$Ultimate##0 ~p := #in~p;~q := #in~q; 285496#L20 assume ~p <= 0;#res := 1; 285494#partsFINAL assume true; 285491#partsEXIT >#71#return; 285489#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285486#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285481#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285483#$Ultimate##0 ~p := #in~p;~q := #in~q; 285487#L20 assume ~p <= 0;#res := 1; 285484#partsFINAL assume true; 285480#partsEXIT >#71#return; 285479#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285477#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285473#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285474#$Ultimate##0 ~p := #in~p;~q := #in~q; 285478#L20 assume ~p <= 0;#res := 1; 285476#partsFINAL assume true; 285472#partsEXIT >#71#return; 285471#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285470#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 285423#L35-3 havoc main_~q~0#1; 285413#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 285414#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 285469#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285941#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285942#$Ultimate##0 ~p := #in~p;~q := #in~q; 285952#L20 assume !(~p <= 0); 285950#L21 assume ~q <= 0;#res := 0; 285948#partsFINAL assume true; 285940#partsEXIT >#71#return; 285936#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285934#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285931#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285932#$Ultimate##0 ~p := #in~p;~q := #in~q; 285953#L20 assume !(~p <= 0); 285951#L21 assume !(~q <= 0); 285949#L22 assume !(~q > ~p); 285946#L23 call #t~ret1 := parts(~p - ~q, ~q);< 285947#$Ultimate##0 ~p := #in~p;~q := #in~q; 285956#L20 assume ~p <= 0;#res := 1; 285955#partsFINAL assume true; 285945#partsEXIT >#67#return; 285938#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 285939#$Ultimate##0 ~p := #in~p;~q := #in~q; 285954#L20 assume !(~p <= 0); 285944#L21 assume ~q <= 0;#res := 0; 285943#partsFINAL assume true; 285937#partsEXIT >#69#return; 285935#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 285933#partsFINAL assume true; 285930#partsEXIT >#71#return; 285929#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285928#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285923#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285927#$Ultimate##0 ~p := #in~p;~q := #in~q; 285926#L20 assume !(~p <= 0); 285925#L21 assume !(~q <= 0); 285924#L22 assume ~q > ~p; 285539#L22-1 call #t~ret0 := parts(~p, ~p);< 285595#$Ultimate##0 ~p := #in~p;~q := #in~q; 285589#L20 assume !(~p <= 0); 285583#L21 assume !(~q <= 0); 285584#L22 assume !(~q > ~p); 285568#L23 call #t~ret1 := parts(~p - ~q, ~q);< 285569#$Ultimate##0 ~p := #in~p;~q := #in~q; 285592#L20 assume ~p <= 0;#res := 1; 285581#partsFINAL assume true; 285582#partsEXIT >#67#return; 285559#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 285562#$Ultimate##0 ~p := #in~p;~q := #in~q; 285573#L20 assume !(~p <= 0); 285572#L21 assume ~q <= 0;#res := 0; 285565#partsFINAL assume true; 285558#partsEXIT >#69#return; 285557#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 285555#partsFINAL assume true; 285533#partsEXIT >#65#return; 285552#L22-2 #res := #t~ret0;havoc #t~ret0; 285982#partsFINAL assume true; 285980#partsEXIT >#71#return; 285499#L36-1 [2024-11-09 15:20:58,906 INFO L747 eck$LassoCheckResult]: Loop: 285499#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285457#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 285421#L35-3 havoc main_~q~0#1; 285422#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 285620#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 285497#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285498#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285616#$Ultimate##0 ~p := #in~p;~q := #in~q; 285627#L20 assume !(~p <= 0); 285626#L21 assume ~q <= 0;#res := 0; 285502#partsFINAL assume true; 285503#partsEXIT >#71#return; 285461#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285458#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285398#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 285399#$Ultimate##0 ~p := #in~p;~q := #in~q; 286243#L20 assume !(~p <= 0); 286242#L21 assume !(~q <= 0); 286240#L22 assume !(~q > ~p); 286237#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286238#$Ultimate##0 ~p := #in~p;~q := #in~q; 286284#L20 assume !(~p <= 0); 286283#L21 assume !(~q <= 0); 286282#L22 assume !(~q > ~p); 286261#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286281#$Ultimate##0 ~p := #in~p;~q := #in~q; 286280#L20 assume !(~p <= 0); 286279#L21 assume !(~q <= 0); 286278#L22 assume !(~q > ~p); 286262#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286281#$Ultimate##0 ~p := #in~p;~q := #in~q; 286280#L20 assume !(~p <= 0); 286279#L21 assume !(~q <= 0); 286278#L22 assume !(~q > ~p); 286275#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286276#$Ultimate##0 ~p := #in~p;~q := #in~q; 286291#L20 assume ~p <= 0;#res := 1; 286290#partsFINAL assume true; 286285#partsEXIT >#67#return; 286256#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286259#$Ultimate##0 ~p := #in~p;~q := #in~q; 286264#L20 assume !(~p <= 0); 286263#L21 assume ~q <= 0;#res := 0; 286260#partsFINAL assume true; 286255#partsEXIT >#69#return; 286258#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286292#partsFINAL assume true; 286274#partsEXIT >#67#return; 286256#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286259#$Ultimate##0 ~p := #in~p;~q := #in~q; 286264#L20 assume !(~p <= 0); 286263#L21 assume ~q <= 0;#res := 0; 286260#partsFINAL assume true; 286255#partsEXIT >#69#return; 286258#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286292#partsFINAL assume true; 286274#partsEXIT >#67#return; 286257#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286259#$Ultimate##0 ~p := #in~p;~q := #in~q; 286264#L20 assume !(~p <= 0); 286263#L21 assume ~q <= 0;#res := 0; 286260#partsFINAL assume true; 286255#partsEXIT >#69#return; 286247#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286245#partsFINAL assume true; 286236#partsEXIT >#67#return; 286233#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286234#$Ultimate##0 ~p := #in~p;~q := #in~q; 286241#L20 assume !(~p <= 0); 286239#L21 assume ~q <= 0;#res := 0; 286235#partsFINAL assume true; 286232#partsEXIT >#69#return; 286231#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286230#partsFINAL assume true; 286228#partsEXIT >#71#return; 285462#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 285463#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285508#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 286027#$Ultimate##0 ~p := #in~p;~q := #in~q; 286273#L20 assume !(~p <= 0); 286272#L21 assume !(~q <= 0); 286270#L22 assume !(~q > ~p); 286271#L23 call #t~ret1 := parts(~p - ~q, ~q);< 287184#$Ultimate##0 ~p := #in~p;~q := #in~q; 287221#L20 assume ~p <= 0;#res := 1; 287220#partsFINAL assume true; 287182#partsEXIT >#67#return; 286017#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286998#$Ultimate##0 ~p := #in~p;~q := #in~q; 286967#L20 assume !(~p <= 0); 286964#L21 assume !(~q <= 0); 286962#L22 assume !(~q > ~p); 286895#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286892#$Ultimate##0 ~p := #in~p;~q := #in~q; 286960#L20 assume ~p <= 0;#res := 1; 286893#partsFINAL assume true; 286898#partsEXIT >#67#return; 286915#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 286926#$Ultimate##0 ~p := #in~p;~q := #in~q; 286945#L20 assume !(~p <= 0); 286941#L21 assume ~q <= 0;#res := 0; 286937#partsFINAL assume true; 286911#partsEXIT >#69#return; 286917#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 287648#partsFINAL assume true; 286015#partsEXIT >#69#return; 286018#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 286475#partsFINAL assume true; 286023#partsEXIT >#71#return; 286024#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 286009#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 285509#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 286026#$Ultimate##0 ~p := #in~p;~q := #in~q; 286046#L20 assume !(~p <= 0); 286044#L21 assume !(~q <= 0); 286040#L22 assume ~q > ~p; 285548#L22-1 call #t~ret0 := parts(~p, ~p);< 285554#$Ultimate##0 ~p := #in~p;~q := #in~q; 285922#L20 assume !(~p <= 0); 286161#L21 assume !(~q <= 0); 285574#L22 assume !(~q > ~p); 285567#L23 call #t~ret1 := parts(~p - ~q, ~q);< 286155#$Ultimate##0 ~p := #in~p;~q := #in~q; 285587#L20 assume ~p <= 0;#res := 1; 285588#partsFINAL assume true; 285566#partsEXIT >#67#return; 285559#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 285562#$Ultimate##0 ~p := #in~p;~q := #in~q; 285573#L20 assume !(~p <= 0); 285572#L21 assume ~q <= 0;#res := 0; 285565#partsFINAL assume true; 285558#partsEXIT >#69#return; 285557#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 285555#partsFINAL assume true; 285533#partsEXIT >#65#return; 285519#L22-2 #res := #t~ret0;havoc #t~ret0; 285520#partsFINAL assume true; 285507#partsEXIT >#71#return; 285499#L36-1 [2024-11-09 15:20:58,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 4 times [2024-11-09 15:20:58,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:58,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46342225] [2024-11-09 15:20:58,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:58,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:58,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:58,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:58,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash 668462472, now seen corresponding path program 2 times [2024-11-09 15:20:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:58,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169994216] [2024-11-09 15:20:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:20:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:58,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:20:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:58,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:58,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:20:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:58,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:20:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 15:20:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 15:20:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 15:20:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:20:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:20:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 148 proven. 53 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2024-11-09 15:20:59,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169994216] [2024-11-09 15:20:59,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169994216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094214819] [2024-11-09 15:20:59,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:20:59,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:59,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:59,107 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:20:59,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2024-11-09 15:20:59,170 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:20:59,170 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:20:59,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 15:20:59,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 437 proven. 188 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-09 15:20:59,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 131 proven. 315 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2024-11-09 15:21:00,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094214819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:00,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:00,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 21] total 32 [2024-11-09 15:21:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263558299] [2024-11-09 15:21:00,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:00,074 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:21:00,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:00,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 15:21:00,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2024-11-09 15:21:00,075 INFO L87 Difference]: Start difference. First operand 3499 states and 5000 transitions. cyclomatic complexity: 1581 Second operand has 32 states, 30 states have (on average 3.0) internal successors, (90), 29 states have internal predecessors, (90), 21 states have call successors, (30), 2 states have call predecessors, (30), 8 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-09 15:21:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:01,267 INFO L93 Difference]: Finished difference Result 4620 states and 6712 transitions. [2024-11-09 15:21:01,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4620 states and 6712 transitions. [2024-11-09 15:21:01,295 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 94 [2024-11-09 15:21:01,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4620 states to 1998 states and 2838 transitions. [2024-11-09 15:21:01,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 455 [2024-11-09 15:21:01,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 492 [2024-11-09 15:21:01,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1998 states and 2838 transitions. [2024-11-09 15:21:01,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:01,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1998 states and 2838 transitions. [2024-11-09 15:21:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states and 2838 transitions. [2024-11-09 15:21:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1495. [2024-11-09 15:21:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 994 states have (on average 1.135814889336016) internal successors, (1129), 1061 states have internal predecessors, (1129), 325 states have call successors, (339), 180 states have call predecessors, (339), 176 states have return successors, (443), 253 states have call predecessors, (443), 303 states have call successors, (443) [2024-11-09 15:21:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1911 transitions. [2024-11-09 15:21:01,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1495 states and 1911 transitions. [2024-11-09 15:21:01,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-09 15:21:01,339 INFO L425 stractBuchiCegarLoop]: Abstraction has 1495 states and 1911 transitions. [2024-11-09 15:21:01,340 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-09 15:21:01,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1495 states and 1911 transitions. [2024-11-09 15:21:01,344 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2024-11-09 15:21:01,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:01,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:01,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 10, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:21:01,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 25, 15, 11, 11, 11, 11, 11, 11, 10, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-11-09 15:21:01,348 INFO L745 eck$LassoCheckResult]: Stem: 294802#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 294760#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 294761#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 294754#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 294755#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 294846#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 294843#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 294844#$Ultimate##0 ~p := #in~p;~q := #in~q; 294847#L20 assume ~p <= 0;#res := 1; 294845#partsFINAL assume true; 294842#partsEXIT >#71#return; 294840#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 294837#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 294832#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 294834#$Ultimate##0 ~p := #in~p;~q := #in~q; 294838#L20 assume ~p <= 0;#res := 1; 294835#partsFINAL assume true; 294831#partsEXIT >#71#return; 294828#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 294825#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 294820#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 294822#$Ultimate##0 ~p := #in~p;~q := #in~q; 294824#L20 assume ~p <= 0;#res := 1; 294823#partsFINAL assume true; 294819#partsEXIT >#71#return; 294818#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 294817#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 294775#L35-3 havoc main_~q~0#1; 294767#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 294768#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 294805#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 294806#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 294954#$Ultimate##0 ~p := #in~p;~q := #in~q; 295207#L20 assume !(~p <= 0); 295203#L21 assume ~q <= 0;#res := 0; 294968#partsFINAL assume true; 294950#partsEXIT >#71#return; 294951#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 294967#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 294758#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 294759#$Ultimate##0 ~p := #in~p;~q := #in~q; 295562#L20 assume !(~p <= 0); 295561#L21 assume !(~q <= 0); 295558#L22 assume !(~q > ~p); 295554#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295555#$Ultimate##0 ~p := #in~p;~q := #in~q; 295560#L20 assume ~p <= 0;#res := 1; 295557#partsFINAL assume true; 295553#partsEXIT >#67#return; 295550#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295551#$Ultimate##0 ~p := #in~p;~q := #in~q; 295559#L20 assume !(~p <= 0); 295556#L21 assume ~q <= 0;#res := 0; 295552#partsFINAL assume true; 295549#partsEXIT >#69#return; 295548#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295546#partsFINAL assume true; 295540#partsEXIT >#71#return; 295541#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295835#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295152#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295833#$Ultimate##0 ~p := #in~p;~q := #in~q; 295832#L20 assume !(~p <= 0); 295831#L21 assume !(~q <= 0); 295830#L22 assume ~q > ~p; 295514#L22-1 call #t~ret0 := parts(~p, ~p);< 295662#$Ultimate##0 ~p := #in~p;~q := #in~q; 295660#L20 assume !(~p <= 0); 295661#L21 assume !(~q <= 0); 295656#L22 assume !(~q > ~p); 295657#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295756#$Ultimate##0 ~p := #in~p;~q := #in~q; 295887#L20 assume ~p <= 0;#res := 1; 295751#partsFINAL assume true; 295753#partsEXIT >#67#return; 295773#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295777#$Ultimate##0 ~p := #in~p;~q := #in~q; 295778#L20 assume !(~p <= 0); 295771#L21 assume !(~q <= 0); 295774#L22 assume !(~q > ~p); 295770#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295947#$Ultimate##0 ~p := #in~p;~q := #in~q; 295976#L20 assume !(~p <= 0); 295974#L21 assume !(~q <= 0); 295972#L22 assume ~q > ~p; 295966#L22-1 call #t~ret0 := parts(~p, ~p);< 295971#$Ultimate##0 ~p := #in~p;~q := #in~q; 295999#L20 assume !(~p <= 0); 295997#L21 assume !(~q <= 0); 295995#L22 assume !(~q > ~p); 295993#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295994#$Ultimate##0 ~p := #in~p;~q := #in~q; 296004#L20 assume ~p <= 0;#res := 1; 296002#partsFINAL assume true; 295991#partsEXIT >#67#return; 295981#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295984#$Ultimate##0 ~p := #in~p;~q := #in~q; 296003#L20 assume !(~p <= 0); 296001#L21 assume ~q <= 0;#res := 0; 295990#partsFINAL assume true; 295980#partsEXIT >#69#return; 295978#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295977#partsFINAL assume true; 295961#partsEXIT >#65#return; 295960#L22-2 #res := #t~ret0;havoc #t~ret0; 295959#partsFINAL assume true; 295958#partsEXIT >#67#return; 295821#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295824#$Ultimate##0 ~p := #in~p;~q := #in~q; 295853#L20 assume !(~p <= 0); 295843#L21 assume ~q <= 0;#res := 0; 295834#partsFINAL assume true; 295818#partsEXIT >#69#return; 295823#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 296155#partsFINAL assume true; 296154#partsEXIT >#69#return; 295721#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 296146#partsFINAL assume true; 295510#partsEXIT >#65#return; 295518#L22-2 #res := #t~ret0;havoc #t~ret0; 295567#partsFINAL assume true; 295568#partsEXIT >#71#return; 294866#L36-1 [2024-11-09 15:21:01,349 INFO L747 eck$LassoCheckResult]: Loop: 294866#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 294826#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 294827#L35-3 havoc main_~q~0#1; 294765#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 294766#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 294863#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 294851#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 294852#$Ultimate##0 ~p := #in~p;~q := #in~q; 294869#L20 assume !(~p <= 0); 294868#L21 assume ~q <= 0;#res := 0; 294867#partsFINAL assume true; 294850#partsEXIT >#71#return; 294811#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 294812#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 295115#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 295117#$Ultimate##0 ~p := #in~p;~q := #in~q; 295141#L20 assume !(~p <= 0); 295140#L21 assume !(~q <= 0); 295139#L22 assume !(~q > ~p); 295137#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295138#$Ultimate##0 ~p := #in~p;~q := #in~q; 295197#L20 assume !(~p <= 0); 295192#L21 assume !(~q <= 0); 295191#L22 assume !(~q > ~p); 295176#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295182#$Ultimate##0 ~p := #in~p;~q := #in~q; 295199#L20 assume !(~p <= 0); 295198#L21 assume !(~q <= 0); 295196#L22 assume !(~q > ~p); 295181#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295189#$Ultimate##0 ~p := #in~p;~q := #in~q; 295188#L20 assume ~p <= 0;#res := 1; 295185#partsFINAL assume true; 295179#partsEXIT >#67#return; 295174#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295170#$Ultimate##0 ~p := #in~p;~q := #in~q; 295194#L20 assume !(~p <= 0); 295193#L21 assume ~q <= 0;#res := 0; 295173#partsFINAL assume true; 295175#partsEXIT >#69#return; 295186#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295187#partsFINAL assume true; 295190#partsEXIT >#67#return; 295165#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295178#$Ultimate##0 ~p := #in~p;~q := #in~q; 295195#L20 assume !(~p <= 0); 295183#L21 assume ~q <= 0;#res := 0; 295184#partsFINAL assume true; 295164#partsEXIT >#69#return; 295167#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295153#partsFINAL assume true; 295154#partsEXIT >#67#return; 295126#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295128#$Ultimate##0 ~p := #in~p;~q := #in~q; 295163#L20 assume !(~p <= 0); 295144#L21 assume ~q <= 0;#res := 0; 295145#partsFINAL assume true; 295125#partsEXIT >#69#return; 295127#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295119#partsFINAL assume true; 295120#partsEXIT >#71#return; 295077#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 295078#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 294751#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 294970#$Ultimate##0 ~p := #in~p;~q := #in~q; 295039#L20 assume !(~p <= 0); 295040#L21 assume !(~q <= 0); 295008#L22 assume !(~q > ~p); 294996#L23 call #t~ret1 := parts(~p - ~q, ~q);< 294997#$Ultimate##0 ~p := #in~p;~q := #in~q; 295007#L20 assume !(~p <= 0); 295006#L21 assume !(~q <= 0); 295005#L22 assume ~q > ~p; 295002#L22-1 call #t~ret0 := parts(~p, ~p);< 295004#$Ultimate##0 ~p := #in~p;~q := #in~q; 295015#L20 assume !(~p <= 0); 295031#L21 assume !(~q <= 0); 295028#L22 assume !(~q > ~p); 295024#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295025#$Ultimate##0 ~p := #in~p;~q := #in~q; 295030#L20 assume ~p <= 0;#res := 1; 295027#partsFINAL assume true; 295023#partsEXIT >#67#return; 295020#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295021#$Ultimate##0 ~p := #in~p;~q := #in~q; 295029#L20 assume !(~p <= 0); 295026#L21 assume ~q <= 0;#res := 0; 295022#partsFINAL assume true; 295019#partsEXIT >#69#return; 295018#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295011#partsFINAL assume true; 295000#partsEXIT >#65#return; 294999#L22-2 #res := #t~ret0;havoc #t~ret0; 294998#partsFINAL assume true; 294994#partsEXIT >#67#return; 294983#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 294989#$Ultimate##0 ~p := #in~p;~q := #in~q; 295067#L20 assume !(~p <= 0); 295066#L21 assume !(~q <= 0); 295065#L22 assume !(~q > ~p); 295056#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295058#$Ultimate##0 ~p := #in~p;~q := #in~q; 295113#L20 assume !(~p <= 0); 295076#L21 assume !(~q <= 0); 295073#L22 assume ~q > ~p; 295071#L22-1 call #t~ret0 := parts(~p, ~p);< 295072#$Ultimate##0 ~p := #in~p;~q := #in~q; 295101#L20 assume !(~p <= 0); 295106#L21 assume !(~q <= 0); 295104#L22 assume !(~q > ~p); 295093#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295094#$Ultimate##0 ~p := #in~p;~q := #in~q; 295103#L20 assume ~p <= 0;#res := 1; 295102#partsFINAL assume true; 295091#partsEXIT >#67#return; 295083#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295085#$Ultimate##0 ~p := #in~p;~q := #in~q; 295099#L20 assume !(~p <= 0); 295097#L21 assume ~q <= 0;#res := 0; 295095#partsFINAL assume true; 295081#partsEXIT >#69#return; 295079#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295075#partsFINAL assume true; 295070#partsEXIT >#65#return; 295069#L22-2 #res := #t~ret0;havoc #t~ret0; 295068#partsFINAL assume true; 295054#partsEXIT >#67#return; 294982#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 294989#$Ultimate##0 ~p := #in~p;~q := #in~q; 295067#L20 assume !(~p <= 0); 295066#L21 assume !(~q <= 0); 295065#L22 assume !(~q > ~p); 295042#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295053#$Ultimate##0 ~p := #in~p;~q := #in~q; 295304#L20 assume !(~p <= 0); 295250#L21 assume !(~q <= 0); 295251#L22 assume !(~q > ~p); 295368#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295410#$Ultimate##0 ~p := #in~p;~q := #in~q; 295407#L20 assume !(~p <= 0); 295402#L21 assume !(~q <= 0); 295398#L22 assume ~q > ~p; 295230#L22-1 call #t~ret0 := parts(~p, ~p);< 295235#$Ultimate##0 ~p := #in~p;~q := #in~q; 295297#L20 assume !(~p <= 0); 295292#L21 assume !(~q <= 0); 295288#L22 assume !(~q > ~p); 295285#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295287#$Ultimate##0 ~p := #in~p;~q := #in~q; 295295#L20 assume ~p <= 0;#res := 1; 295291#partsFINAL assume true; 295284#partsEXIT >#67#return; 295275#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295277#$Ultimate##0 ~p := #in~p;~q := #in~q; 295294#L20 assume !(~p <= 0); 295290#L21 assume ~q <= 0;#res := 0; 295283#partsFINAL assume true; 295273#partsEXIT >#69#return; 295271#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295247#partsFINAL assume true; 295229#partsEXIT >#65#return; 295233#L22-2 #res := #t~ret0;havoc #t~ret0; 295380#partsFINAL assume true; 295381#partsEXIT >#67#return; 295238#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295246#$Ultimate##0 ~p := #in~p;~q := #in~q; 295324#L20 assume !(~p <= 0); 295306#L21 assume ~q <= 0;#res := 0; 295307#partsFINAL assume true; 295237#partsEXIT >#69#return; 295242#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295364#partsFINAL assume true; 295362#partsEXIT >#67#return; 295359#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295360#$Ultimate##0 ~p := #in~p;~q := #in~q; 295365#L20 assume !(~p <= 0); 295363#L21 assume ~q <= 0;#res := 0; 295361#partsFINAL assume true; 295357#partsEXIT >#69#return; 295332#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295356#partsFINAL assume true; 295331#partsEXIT >#69#return; 295332#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295356#partsFINAL assume true; 295331#partsEXIT >#69#return; 295330#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 295329#partsFINAL assume true; 295325#partsEXIT >#71#return; 294974#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 294972#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 294750#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 294969#$Ultimate##0 ~p := #in~p;~q := #in~q; 295527#L20 assume !(~p <= 0); 295526#L21 assume !(~q <= 0); 295524#L22 assume ~q > ~p; 295512#L22-1 call #t~ret0 := parts(~p, ~p);< 295523#$Ultimate##0 ~p := #in~p;~q := #in~q; 295815#L20 assume !(~p <= 0); 295814#L21 assume !(~q <= 0); 295737#L22 assume !(~q > ~p); 295729#L23 call #t~ret1 := parts(~p - ~q, ~q);< 295809#$Ultimate##0 ~p := #in~p;~q := #in~q; 295738#L20 assume ~p <= 0;#res := 1; 295739#partsFINAL assume true; 295728#partsEXIT >#67#return; 295720#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 295725#$Ultimate##0 ~p := #in~p;~q := #in~q; 295734#L20 assume !(~p <= 0); 295733#L21 assume ~q <= 0;#res := 0; 295727#partsFINAL assume true; 295719#partsEXIT >#69#return; 295721#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 296146#partsFINAL assume true; 295510#partsEXIT >#65#return; 295498#L22-2 #res := #t~ret0;havoc #t~ret0; 295496#partsFINAL assume true; 294990#partsEXIT >#71#return; 294866#L36-1 [2024-11-09 15:21:01,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:01,349 INFO L85 PathProgramCache]: Analyzing trace with hash 448370189, now seen corresponding path program 5 times [2024-11-09 15:21:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:01,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929256643] [2024-11-09 15:21:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:21:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:21:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 15:21:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 15:21:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 15:21:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 122 proven. 80 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-11-09 15:21:01,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:01,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929256643] [2024-11-09 15:21:01,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929256643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:01,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085652078] [2024-11-09 15:21:01,626 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 15:21:01,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:01,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:01,628 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:01,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2024-11-09 15:21:01,690 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-09 15:21:01,691 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:01,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:21:01,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 173 proven. 135 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-09 15:21:01,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 170 proven. 159 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-11-09 15:21:02,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085652078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:02,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:02,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 16] total 30 [2024-11-09 15:21:02,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586315242] [2024-11-09 15:21:02,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:02,694 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:02,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:02,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1004263577, now seen corresponding path program 3 times [2024-11-09 15:21:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939201117] [2024-11-09 15:21:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:21:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:21:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:21:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 15:21:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:02,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:03,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:03,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:03,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 15:21:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-09 15:21:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:03,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:03,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:03,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2344 backedges. 252 proven. 185 refuted. 0 times theorem prover too weak. 1907 trivial. 0 not checked. [2024-11-09 15:21:03,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:03,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939201117] [2024-11-09 15:21:03,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939201117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:03,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065703814] [2024-11-09 15:21:03,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:21:03,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:03,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:03,027 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:03,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2024-11-09 15:21:03,109 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 15:21:03,110 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:03,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 15:21:03,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2344 backedges. 450 proven. 92 refuted. 0 times theorem prover too weak. 1802 trivial. 0 not checked. [2024-11-09 15:21:03,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2344 backedges. 455 proven. 89 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2024-11-09 15:21:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065703814] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:03,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:03,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 25 [2024-11-09 15:21:03,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024543108] [2024-11-09 15:21:03,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:03,764 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:21:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:03,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 15:21:03,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2024-11-09 15:21:03,766 INFO L87 Difference]: Start difference. First operand 1495 states and 1911 transitions. cyclomatic complexity: 449 Second operand has 31 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 20 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (32), 20 states have call predecessors, (32), 20 states have call successors, (32) [2024-11-09 15:21:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:05,058 INFO L93 Difference]: Finished difference Result 1879 states and 2399 transitions. [2024-11-09 15:21:05,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1879 states and 2399 transitions. [2024-11-09 15:21:05,064 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2024-11-09 15:21:05,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1879 states to 1149 states and 1396 transitions. [2024-11-09 15:21:05,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2024-11-09 15:21:05,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 282 [2024-11-09 15:21:05,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1149 states and 1396 transitions. [2024-11-09 15:21:05,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:05,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1149 states and 1396 transitions. [2024-11-09 15:21:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states and 1396 transitions. [2024-11-09 15:21:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 911. [2024-11-09 15:21:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 621 states have (on average 1.0821256038647342) internal successors, (672), 642 states have internal predecessors, (672), 168 states have call successors, (181), 115 states have call predecessors, (181), 122 states have return successors, (215), 153 states have call predecessors, (215), 150 states have call successors, (215) [2024-11-09 15:21:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1068 transitions. [2024-11-09 15:21:05,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 911 states and 1068 transitions. [2024-11-09 15:21:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-09 15:21:05,085 INFO L425 stractBuchiCegarLoop]: Abstraction has 911 states and 1068 transitions. [2024-11-09 15:21:05,085 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-09 15:21:05,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 911 states and 1068 transitions. [2024-11-09 15:21:05,087 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 89 [2024-11-09 15:21:05,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:05,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:05,088 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:21:05,088 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 15:21:05,088 INFO L745 eck$LassoCheckResult]: Stem: 301263#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 301218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 301219#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 301212#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 301213#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 301276#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 301303#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 301304#$Ultimate##0 ~p := #in~p;~q := #in~q; 301306#L20 assume ~p <= 0;#res := 1; 301305#partsFINAL assume true; 301302#partsEXIT >#71#return; 301301#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 301298#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 301293#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 301295#$Ultimate##0 ~p := #in~p;~q := #in~q; 301299#L20 assume ~p <= 0;#res := 1; 301296#partsFINAL assume true; 301292#partsEXIT >#71#return; 301291#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 301288#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 301281#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 301283#$Ultimate##0 ~p := #in~p;~q := #in~q; 301285#L20 assume ~p <= 0;#res := 1; 301284#partsFINAL assume true; 301280#partsEXIT >#71#return; 301279#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 301278#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 301244#L35-3 havoc main_~q~0#1; 301232#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 301233#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 301277#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 301517#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 301524#$Ultimate##0 ~p := #in~p;~q := #in~q; 301527#L20 assume !(~p <= 0); 301526#L21 assume ~q <= 0;#res := 0; 301525#partsFINAL assume true; 301523#partsEXIT >#71#return; 301521#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 301522#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 301216#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 301217#$Ultimate##0 ~p := #in~p;~q := #in~q; 301877#L20 assume !(~p <= 0); 301876#L21 assume !(~q <= 0); 301874#L22 assume !(~q > ~p); 301871#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301872#$Ultimate##0 ~p := #in~p;~q := #in~q; 301875#L20 assume ~p <= 0;#res := 1; 301873#partsFINAL assume true; 301870#partsEXIT >#67#return; 301828#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301829#$Ultimate##0 ~p := #in~p;~q := #in~q; 301833#L20 assume !(~p <= 0); 301832#L21 assume ~q <= 0;#res := 0; 301830#partsFINAL assume true; 301827#partsEXIT >#69#return; 301826#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301823#partsFINAL assume true; 301821#partsEXIT >#71#return; 301819#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 301817#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 301395#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 301810#$Ultimate##0 ~p := #in~p;~q := #in~q; 301808#L20 assume !(~p <= 0); 301466#L21 assume !(~q <= 0); 301467#L22 assume ~q > ~p; 301227#L22-1 call #t~ret0 := parts(~p, ~p);< 301798#$Ultimate##0 ~p := #in~p;~q := #in~q; 301797#L20 assume !(~p <= 0); 301796#L21 assume !(~q <= 0); 301795#L22 assume !(~q > ~p); 301442#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301443#$Ultimate##0 ~p := #in~p;~q := #in~q; 301450#L20 assume ~p <= 0;#res := 1; 301448#partsFINAL assume true; 301441#partsEXIT >#67#return; 301438#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301439#$Ultimate##0 ~p := #in~p;~q := #in~q; 301445#L20 assume !(~p <= 0); 301444#L21 assume ~q <= 0;#res := 0; 301440#partsFINAL assume true; 301437#partsEXIT >#69#return; 301436#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301435#partsFINAL assume true; 301433#partsEXIT >#65#return; 301431#L22-2 #res := #t~ret0;havoc #t~ret0; 301432#partsFINAL assume true; 301394#partsEXIT >#71#return; 301382#L36-1 [2024-11-09 15:21:05,089 INFO L747 eck$LassoCheckResult]: Loop: 301382#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 301375#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 301369#L35-3 havoc main_~q~0#1; 301230#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 301231#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 301286#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 301287#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 301356#$Ultimate##0 ~p := #in~p;~q := #in~q; 301366#L20 assume !(~p <= 0); 301364#L21 assume ~q <= 0;#res := 0; 301310#partsFINAL assume true; 301311#partsEXIT >#71#return; 301271#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 301272#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 301426#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 301430#$Ultimate##0 ~p := #in~p;~q := #in~q; 301429#L20 assume !(~p <= 0); 301428#L21 assume !(~q <= 0); 301427#L22 assume !(~q > ~p); 301415#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301425#$Ultimate##0 ~p := #in~p;~q := #in~q; 301424#L20 assume !(~p <= 0); 301423#L21 assume !(~q <= 0); 301422#L22 assume !(~q > ~p); 301385#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301417#$Ultimate##0 ~p := #in~p;~q := #in~q; 301421#L20 assume ~p <= 0;#res := 1; 301419#partsFINAL assume true; 301416#partsEXIT >#67#return; 301410#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301413#$Ultimate##0 ~p := #in~p;~q := #in~q; 301420#L20 assume !(~p <= 0); 301418#L21 assume ~q <= 0;#res := 0; 301414#partsFINAL assume true; 301409#partsEXIT >#69#return; 301412#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301543#partsFINAL assume true; 301541#partsEXIT >#67#return; 301537#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301539#$Ultimate##0 ~p := #in~p;~q := #in~q; 301544#L20 assume !(~p <= 0); 301542#L21 assume ~q <= 0;#res := 0; 301540#partsFINAL assume true; 301536#partsEXIT >#69#return; 301534#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301532#partsFINAL assume true; 301529#partsEXIT >#71#return; 301519#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 301520#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 301207#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 301316#$Ultimate##0 ~p := #in~p;~q := #in~q; 301513#L20 assume !(~p <= 0); 301514#L21 assume !(~q <= 0); 301652#L22 assume ~q > ~p; 301484#L22-1 call #t~ret0 := parts(~p, ~p);< 301487#$Ultimate##0 ~p := #in~p;~q := #in~q; 301510#L20 assume !(~p <= 0); 301509#L21 assume !(~q <= 0); 301506#L22 assume !(~q > ~p); 301500#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301501#$Ultimate##0 ~p := #in~p;~q := #in~q; 301508#L20 assume ~p <= 0;#res := 1; 301505#partsFINAL assume true; 301499#partsEXIT >#67#return; 301495#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301496#$Ultimate##0 ~p := #in~p;~q := #in~q; 301507#L20 assume !(~p <= 0); 301504#L21 assume ~q <= 0;#res := 0; 301498#partsFINAL assume true; 301494#partsEXIT >#69#return; 301492#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301488#partsFINAL assume true; 301483#partsEXIT >#65#return; 301482#L22-2 #res := #t~ret0;havoc #t~ret0; 301481#partsFINAL assume true; 301479#partsEXIT >#71#return; 301477#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 301475#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 301202#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 301317#$Ultimate##0 ~p := #in~p;~q := #in~q; 301463#L20 assume !(~p <= 0); 301460#L21 assume !(~q <= 0); 301458#L22 assume ~q > ~p; 301319#L22-1 call #t~ret0 := parts(~p, ~p);< 301323#$Ultimate##0 ~p := #in~p;~q := #in~q; 301451#L20 assume !(~p <= 0); 301449#L21 assume !(~q <= 0); 301446#L22 assume !(~q > ~p); 301447#L23 call #t~ret1 := parts(~p - ~q, ~q);< 301776#$Ultimate##0 ~p := #in~p;~q := #in~q; 301837#L20 assume ~p <= 0;#res := 1; 301836#partsFINAL assume true; 301799#partsEXIT >#67#return; 301438#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 301439#$Ultimate##0 ~p := #in~p;~q := #in~q; 301445#L20 assume !(~p <= 0); 301444#L21 assume ~q <= 0;#res := 0; 301440#partsFINAL assume true; 301437#partsEXIT >#69#return; 301436#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 301435#partsFINAL assume true; 301433#partsEXIT >#65#return; 301434#L22-2 #res := #t~ret0;havoc #t~ret0; 301396#partsFINAL assume true; 301397#partsEXIT >#71#return; 301382#L36-1 [2024-11-09 15:21:05,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1915060932, now seen corresponding path program 6 times [2024-11-09 15:21:05,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:05,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445987850] [2024-11-09 15:21:05,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:05,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:05,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:05,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:05,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1270465335, now seen corresponding path program 4 times [2024-11-09 15:21:05,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:05,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803425644] [2024-11-09 15:21:05,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:05,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:21:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:21:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 15:21:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 15:21:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 62 proven. 123 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-09 15:21:05,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:05,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803425644] [2024-11-09 15:21:05,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803425644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:05,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567112772] [2024-11-09 15:21:05,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:21:05,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:05,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:05,357 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:05,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2024-11-09 15:21:05,419 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:21:05,419 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:05,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 15:21:05,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 261 proven. 68 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-09 15:21:05,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 58 proven. 128 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-09 15:21:05,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567112772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:05,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 24 [2024-11-09 15:21:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178895055] [2024-11-09 15:21:05,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:05,779 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:21:05,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 15:21:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-11-09 15:21:05,779 INFO L87 Difference]: Start difference. First operand 911 states and 1068 transitions. cyclomatic complexity: 171 Second operand has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 21 states have internal predecessors, (72), 15 states have call successors, (23), 2 states have call predecessors, (23), 5 states have return successors, (24), 10 states have call predecessors, (24), 15 states have call successors, (24) [2024-11-09 15:21:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:06,052 INFO L93 Difference]: Finished difference Result 1023 states and 1225 transitions. [2024-11-09 15:21:06,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1023 states and 1225 transitions. [2024-11-09 15:21:06,056 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 75 [2024-11-09 15:21:06,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1023 states to 968 states and 1142 transitions. [2024-11-09 15:21:06,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2024-11-09 15:21:06,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2024-11-09 15:21:06,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 968 states and 1142 transitions. [2024-11-09 15:21:06,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:06,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 968 states and 1142 transitions. [2024-11-09 15:21:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states and 1142 transitions. [2024-11-09 15:21:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 935. [2024-11-09 15:21:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 640 states have (on average 1.090625) internal successors, (698), 660 states have internal predecessors, (698), 175 states have call successors, (187), 122 states have call predecessors, (187), 120 states have return successors, (212), 152 states have call predecessors, (212), 154 states have call successors, (212) [2024-11-09 15:21:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1097 transitions. [2024-11-09 15:21:06,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 935 states and 1097 transitions. [2024-11-09 15:21:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 15:21:06,075 INFO L425 stractBuchiCegarLoop]: Abstraction has 935 states and 1097 transitions. [2024-11-09 15:21:06,075 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-09 15:21:06,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 935 states and 1097 transitions. [2024-11-09 15:21:06,078 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2024-11-09 15:21:06,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:06,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:06,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 16, 13, 9, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:21:06,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:21:06,082 INFO L745 eck$LassoCheckResult]: Stem: 304024#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 303993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 303994#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 303987#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 303988#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 304066#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 304063#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 304064#$Ultimate##0 ~p := #in~p;~q := #in~q; 304067#L20 assume ~p <= 0;#res := 1; 304065#partsFINAL assume true; 304062#partsEXIT >#71#return; 304061#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 304058#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 304053#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 304055#$Ultimate##0 ~p := #in~p;~q := #in~q; 304059#L20 assume ~p <= 0;#res := 1; 304056#partsFINAL assume true; 304052#partsEXIT >#71#return; 304051#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 304049#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 304045#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 304046#$Ultimate##0 ~p := #in~p;~q := #in~q; 304050#L20 assume ~p <= 0;#res := 1; 304048#partsFINAL assume true; 304044#partsEXIT >#71#return; 304043#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 304042#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 304009#L35-3 havoc main_~q~0#1; 304002#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 304003#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 304041#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 304187#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 304188#$Ultimate##0 ~p := #in~p;~q := #in~q; 304209#L20 assume !(~p <= 0); 304208#L21 assume ~q <= 0;#res := 0; 304205#partsFINAL assume true; 304186#partsEXIT >#71#return; 304182#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 304171#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 304166#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 304167#$Ultimate##0 ~p := #in~p;~q := #in~q; 304217#L20 assume !(~p <= 0); 304216#L21 assume !(~q <= 0); 304189#L22 assume !(~q > ~p); 304184#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304185#$Ultimate##0 ~p := #in~p;~q := #in~q; 304207#L20 assume ~p <= 0;#res := 1; 304204#partsFINAL assume true; 304183#partsEXIT >#67#return; 304180#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304181#$Ultimate##0 ~p := #in~p;~q := #in~q; 304198#L20 assume !(~p <= 0); 304193#L21 assume ~q <= 0;#res := 0; 304191#partsFINAL assume true; 304179#partsEXIT >#69#return; 304170#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 304169#partsFINAL assume true; 304165#partsEXIT >#71#return; 304162#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 304159#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 304081#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 304074#$Ultimate##0 ~p := #in~p;~q := #in~q; 304458#L20 assume !(~p <= 0); 304457#L21 assume !(~q <= 0); 304455#L22 assume ~q > ~p; 304398#L22-1 call #t~ret0 := parts(~p, ~p);< 304413#$Ultimate##0 ~p := #in~p;~q := #in~q; 304414#L20 assume !(~p <= 0); 304474#L21 assume !(~q <= 0); 304473#L22 assume !(~q > ~p); 304470#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304471#$Ultimate##0 ~p := #in~p;~q := #in~q; 304476#L20 assume ~p <= 0;#res := 1; 304475#partsFINAL assume true; 304469#partsEXIT >#67#return; 304467#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304468#$Ultimate##0 ~p := #in~p;~q := #in~q; 304480#L20 assume !(~p <= 0); 304478#L21 assume ~q <= 0;#res := 0; 304477#partsFINAL assume true; 304466#partsEXIT >#69#return; 304465#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 304462#partsFINAL assume true; 304452#partsEXIT >#65#return; 304451#L22-2 #res := #t~ret0;havoc #t~ret0; 304448#partsFINAL assume true; 304445#partsEXIT >#71#return; 304442#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 304430#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 304073#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 304075#$Ultimate##0 ~p := #in~p;~q := #in~q; 304095#L20 assume !(~p <= 0); 304093#L21 assume !(~q <= 0); 304087#L22 assume ~q > ~p; 304077#L22-1 call #t~ret0 := parts(~p, ~p);< 304137#$Ultimate##0 ~p := #in~p;~q := #in~q; 304136#L20 assume !(~p <= 0); 304158#L21 assume !(~q <= 0); 304142#L22 assume !(~q > ~p); 304117#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304122#$Ultimate##0 ~p := #in~p;~q := #in~q; 304134#L20 assume ~p <= 0;#res := 1; 304124#partsFINAL assume true; 304115#partsEXIT >#67#return; 304101#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304206#$Ultimate##0 ~p := #in~p;~q := #in~q; 304203#L20 assume !(~p <= 0); 304202#L21 assume !(~q <= 0); 304199#L22 assume !(~q > ~p); 304201#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304645#$Ultimate##0 ~p := #in~p;~q := #in~q; 304662#L20 assume !(~p <= 0); 304660#L21 assume !(~q <= 0); 304658#L22 assume ~q > ~p; 304655#L22-1 call #t~ret0 := parts(~p, ~p);< 304656#$Ultimate##0 ~p := #in~p;~q := #in~q; 304711#L20 assume !(~p <= 0); 304709#L21 assume !(~q <= 0); 304706#L22 assume !(~q > ~p); 304694#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304695#$Ultimate##0 ~p := #in~p;~q := #in~q; 304708#L20 assume ~p <= 0;#res := 1; 304705#partsFINAL assume true; 304693#partsEXIT >#67#return; 304688#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304689#$Ultimate##0 ~p := #in~p;~q := #in~q; 304703#L20 assume !(~p <= 0); 304702#L21 assume ~q <= 0;#res := 0; 304692#partsFINAL assume true; 304687#partsEXIT >#69#return; 304683#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 304679#partsFINAL assume true; 304654#partsEXIT >#65#return; 304648#L22-2 #res := #t~ret0;havoc #t~ret0; 304646#partsFINAL assume true; 304642#partsEXIT >#67#return; 304016#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304603#$Ultimate##0 ~p := #in~p;~q := #in~q; 304602#L20 assume !(~p <= 0); 304601#L21 assume !(~q <= 0); 304598#L22 assume ~q > ~p; 303985#L22-1 [2024-11-09 15:21:06,082 INFO L747 eck$LassoCheckResult]: Loop: 303985#L22-1 call #t~ret0 := parts(~p, ~p);< 304019#$Ultimate##0 ~p := #in~p;~q := #in~q; 304039#L20 assume !(~p <= 0); 304013#L21 assume !(~q <= 0); 304005#L22 assume !(~q > ~p); 304006#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304868#$Ultimate##0 ~p := #in~p;~q := #in~q; 304873#L20 assume ~p <= 0;#res := 1; 304871#partsFINAL assume true; 304866#partsEXIT >#67#return; 303976#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303981#$Ultimate##0 ~p := #in~p;~q := #in~q; 304015#L20 assume !(~p <= 0); 304900#L21 assume !(~q <= 0); 304677#L22 assume !(~q > ~p); 304201#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304645#$Ultimate##0 ~p := #in~p;~q := #in~q; 304662#L20 assume !(~p <= 0); 304660#L21 assume !(~q <= 0); 304658#L22 assume ~q > ~p; 304655#L22-1 call #t~ret0 := parts(~p, ~p);< 304656#$Ultimate##0 ~p := #in~p;~q := #in~q; 304711#L20 assume !(~p <= 0); 304709#L21 assume !(~q <= 0); 304706#L22 assume !(~q > ~p); 304694#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304695#$Ultimate##0 ~p := #in~p;~q := #in~q; 304708#L20 assume ~p <= 0;#res := 1; 304705#partsFINAL assume true; 304693#partsEXIT >#67#return; 304688#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304689#$Ultimate##0 ~p := #in~p;~q := #in~q; 304703#L20 assume !(~p <= 0); 304702#L21 assume ~q <= 0;#res := 0; 304692#partsFINAL assume true; 304687#partsEXIT >#69#return; 304683#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 304679#partsFINAL assume true; 304654#partsEXIT >#65#return; 304648#L22-2 #res := #t~ret0;havoc #t~ret0; 304646#partsFINAL assume true; 304642#partsEXIT >#67#return; 304016#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304603#$Ultimate##0 ~p := #in~p;~q := #in~q; 304602#L20 assume !(~p <= 0); 304601#L21 assume !(~q <= 0); 304598#L22 assume ~q > ~p; 303985#L22-1 [2024-11-09 15:21:06,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2076130948, now seen corresponding path program 7 times [2024-11-09 15:21:06,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:06,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045322391] [2024-11-09 15:21:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:21:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:21:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 15:21:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 15:21:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 15:21:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 15:21:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 15:21:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 170 proven. 93 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2024-11-09 15:21:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045322391] [2024-11-09 15:21:06,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045322391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983252884] [2024-11-09 15:21:06,240 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 15:21:06,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:06,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,244 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2024-11-09 15:21:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:21:06,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 404 proven. 46 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-09 15:21:06,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 170 proven. 93 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2024-11-09 15:21:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983252884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:06,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:06,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2024-11-09 15:21:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263709643] [2024-11-09 15:21:06,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:06,546 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:06,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:06,547 INFO L85 PathProgramCache]: Analyzing trace with hash 851588807, now seen corresponding path program 1 times [2024-11-09 15:21:06,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:06,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722446081] [2024-11-09 15:21:06,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:06,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 15:21:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 15:21:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 15:21:06,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:06,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722446081] [2024-11-09 15:21:06,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722446081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:06,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102068960] [2024-11-09 15:21:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:06,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:06,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,637 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2024-11-09 15:21:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:21:06,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 32 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 15:21:06,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 32 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 15:21:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102068960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:06,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:06,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 15:21:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689117832] [2024-11-09 15:21:06,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:06,816 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:21:06,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:06,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 15:21:06,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 15:21:06,816 INFO L87 Difference]: Start difference. First operand 935 states and 1097 transitions. cyclomatic complexity: 177 Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-09 15:21:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:06,953 INFO L93 Difference]: Finished difference Result 1000 states and 1166 transitions. [2024-11-09 15:21:06,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1000 states and 1166 transitions. [2024-11-09 15:21:06,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-09 15:21:06,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1000 states to 789 states and 906 transitions. [2024-11-09 15:21:06,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2024-11-09 15:21:06,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2024-11-09 15:21:06,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 789 states and 906 transitions. [2024-11-09 15:21:06,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:06,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 789 states and 906 transitions. [2024-11-09 15:21:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states and 906 transitions. [2024-11-09 15:21:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 768. [2024-11-09 15:21:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 524 states have (on average 1.0419847328244274) internal successors, (546), 537 states have internal predecessors, (546), 136 states have call successors, (143), 91 states have call predecessors, (143), 108 states have return successors, (188), 139 states have call predecessors, (188), 136 states have call successors, (188) [2024-11-09 15:21:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 877 transitions. [2024-11-09 15:21:06,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 768 states and 877 transitions. [2024-11-09 15:21:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 15:21:06,970 INFO L425 stractBuchiCegarLoop]: Abstraction has 768 states and 877 transitions. [2024-11-09 15:21:06,971 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-09 15:21:06,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 768 states and 877 transitions. [2024-11-09 15:21:06,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-09 15:21:06,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:06,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:06,974 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 16, 10, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:21:06,974 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 5, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:21:06,974 INFO L745 eck$LassoCheckResult]: Stem: 307324#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 307282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 307283#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 307276#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 307277#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 307365#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307362#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307363#$Ultimate##0 ~p := #in~p;~q := #in~q; 307366#L20 assume ~p <= 0;#res := 1; 307364#partsFINAL assume true; 307361#partsEXIT >#71#return; 307360#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307357#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307352#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307354#$Ultimate##0 ~p := #in~p;~q := #in~q; 307358#L20 assume ~p <= 0;#res := 1; 307355#partsFINAL assume true; 307351#partsEXIT >#71#return; 307350#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307348#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307344#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307345#$Ultimate##0 ~p := #in~p;~q := #in~q; 307349#L20 assume ~p <= 0;#res := 1; 307347#partsFINAL assume true; 307343#partsEXIT >#71#return; 307342#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307341#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 307301#L35-3 havoc main_~q~0#1; 307291#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 307292#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 307340#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307449#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307450#$Ultimate##0 ~p := #in~p;~q := #in~q; 307459#L20 assume !(~p <= 0); 307456#L21 assume ~q <= 0;#res := 0; 307455#partsFINAL assume true; 307448#partsEXIT >#71#return; 307444#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307442#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307438#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307439#$Ultimate##0 ~p := #in~p;~q := #in~q; 307464#L20 assume !(~p <= 0); 307463#L21 assume !(~q <= 0); 307462#L22 assume !(~q > ~p); 307453#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307454#$Ultimate##0 ~p := #in~p;~q := #in~q; 307461#L20 assume ~p <= 0;#res := 1; 307458#partsFINAL assume true; 307452#partsEXIT >#67#return; 307446#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307447#$Ultimate##0 ~p := #in~p;~q := #in~q; 307460#L20 assume !(~p <= 0); 307457#L21 assume ~q <= 0;#res := 0; 307451#partsFINAL assume true; 307445#partsEXIT >#69#return; 307443#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307441#partsFINAL assume true; 307437#partsEXIT >#71#return; 307436#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307435#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307424#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307432#$Ultimate##0 ~p := #in~p;~q := #in~q; 307431#L20 assume !(~p <= 0); 307429#L21 assume !(~q <= 0); 307427#L22 assume ~q > ~p; 307390#L22-1 call #t~ret0 := parts(~p, ~p);< 307422#$Ultimate##0 ~p := #in~p;~q := #in~q; 307421#L20 assume !(~p <= 0); 307420#L21 assume !(~q <= 0); 307417#L22 assume !(~q > ~p); 307402#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307403#$Ultimate##0 ~p := #in~p;~q := #in~q; 307425#L20 assume ~p <= 0;#res := 1; 307423#partsFINAL assume true; 307401#partsEXIT >#67#return; 307393#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307397#$Ultimate##0 ~p := #in~p;~q := #in~q; 307405#L20 assume !(~p <= 0); 307404#L21 assume ~q <= 0;#res := 0; 307400#partsFINAL assume true; 307392#partsEXIT >#69#return; 307389#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307391#partsFINAL assume true; 307472#partsEXIT >#65#return; 307471#L22-2 #res := #t~ret0;havoc #t~ret0; 307470#partsFINAL assume true; 307466#partsEXIT >#71#return; 307467#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307325#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 307326#L35-3 havoc main_~q~0#1; 307289#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 307290#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 307621#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307377#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307381#$Ultimate##0 ~p := #in~p;~q := #in~q; 307380#L20 assume !(~p <= 0); 307379#L21 assume ~q <= 0;#res := 0; 307376#partsFINAL assume true; 307378#partsEXIT >#71#return; 307615#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307609#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307543#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307544#$Ultimate##0 ~p := #in~p;~q := #in~q; 307606#L20 assume !(~p <= 0); 307605#L21 assume !(~q <= 0); 307604#L22 assume !(~q > ~p); 307601#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307602#$Ultimate##0 ~p := #in~p;~q := #in~q; 307729#L20 assume !(~p <= 0); 307728#L21 assume !(~q <= 0); 307620#L22 assume !(~q > ~p); 307617#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307619#$Ultimate##0 ~p := #in~p;~q := #in~q; 307671#L20 assume ~p <= 0;#res := 1; 307670#partsFINAL assume true; 307616#partsEXIT >#67#return; 307611#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307614#$Ultimate##0 ~p := #in~p;~q := #in~q; 307675#L20 assume !(~p <= 0); 307673#L21 assume ~q <= 0;#res := 0; 307672#partsFINAL assume true; 307610#partsEXIT >#69#return; 307608#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307607#partsFINAL assume true; 307600#partsEXIT >#67#return; 307584#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307586#$Ultimate##0 ~p := #in~p;~q := #in~q; 307770#L20 assume !(~p <= 0); 307767#L21 assume ~q <= 0;#res := 0; 307766#partsFINAL assume true; 307582#partsEXIT >#69#return; 307585#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307599#partsFINAL assume true; 307542#partsEXIT >#71#return; 307532#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307527#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307479#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307480#$Ultimate##0 ~p := #in~p;~q := #in~q; 307856#L20 assume !(~p <= 0); 307851#L21 assume !(~q <= 0); 307849#L22 assume !(~q > ~p); 307677#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307817#$Ultimate##0 ~p := #in~p;~q := #in~q; 307937#L20 assume ~p <= 0;#res := 1; 307847#partsFINAL assume true; 307816#partsEXIT >#67#return; 307570#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307773#$Ultimate##0 ~p := #in~p;~q := #in~q; 307772#L20 assume !(~p <= 0); 307769#L21 assume !(~q <= 0); 307768#L22 assume !(~q > ~p); 307691#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307695#$Ultimate##0 ~p := #in~p;~q := #in~q; 307718#L20 assume !(~p <= 0); 307714#L21 assume !(~q <= 0); 307713#L22 assume !(~q > ~p); 307711#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307712#$Ultimate##0 ~p := #in~p;~q := #in~q; 307757#L20 assume ~p <= 0;#res := 1; 307716#partsFINAL assume true; 307708#partsEXIT >#67#return; 307702#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307707#$Ultimate##0 ~p := #in~p;~q := #in~q; 307763#L20 assume !(~p <= 0); 307761#L21 assume ~q <= 0;#res := 0; 307758#partsFINAL assume true; 307701#partsEXIT >#69#return; 307700#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307699#partsFINAL assume true; 307688#partsEXIT >#67#return; 307683#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307686#$Ultimate##0 ~p := #in~p;~q := #in~q; 307762#L20 assume !(~p <= 0); 307760#L21 assume ~q <= 0;#res := 0; 307759#partsFINAL assume true; 307681#partsEXIT >#69#return; 307685#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307580#partsFINAL assume true; 307568#partsEXIT >#69#return; 307564#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307560#partsFINAL assume true; 307539#partsEXIT >#71#return; 307531#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307530#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307317#L36 [2024-11-09 15:21:06,975 INFO L747 eck$LassoCheckResult]: Loop: 307317#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 307469#$Ultimate##0 ~p := #in~p;~q := #in~q; 307517#L20 assume !(~p <= 0); 307516#L21 assume !(~q <= 0); 307495#L22 assume !(~q > ~p); 307496#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307598#$Ultimate##0 ~p := #in~p;~q := #in~q; 307793#L20 assume !(~p <= 0); 307792#L21 assume !(~q <= 0); 307790#L22 assume ~q > ~p; 307787#L22-1 call #t~ret0 := parts(~p, ~p);< 307788#$Ultimate##0 ~p := #in~p;~q := #in~q; 307809#L20 assume !(~p <= 0); 307807#L21 assume !(~q <= 0); 307806#L22 assume !(~q > ~p); 307804#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307805#$Ultimate##0 ~p := #in~p;~q := #in~q; 307810#L20 assume ~p <= 0;#res := 1; 307808#partsFINAL assume true; 307803#partsEXIT >#67#return; 307801#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307802#$Ultimate##0 ~p := #in~p;~q := #in~q; 307825#L20 assume !(~p <= 0); 307813#L21 assume ~q <= 0;#res := 0; 307811#partsFINAL assume true; 307800#partsEXIT >#69#return; 307799#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307797#partsFINAL assume true; 307786#partsEXIT >#65#return; 307782#L22-2 #res := #t~ret0;havoc #t~ret0; 307779#partsFINAL assume true; 307595#partsEXIT >#67#return; 307537#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307593#$Ultimate##0 ~p := #in~p;~q := #in~q; 307698#L20 assume !(~p <= 0); 307697#L21 assume !(~q <= 0); 307696#L22 assume !(~q > ~p); 307690#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307695#$Ultimate##0 ~p := #in~p;~q := #in~q; 307718#L20 assume !(~p <= 0); 307714#L21 assume !(~q <= 0); 307713#L22 assume !(~q > ~p); 307711#L23 call #t~ret1 := parts(~p - ~q, ~q);< 307712#$Ultimate##0 ~p := #in~p;~q := #in~q; 307757#L20 assume ~p <= 0;#res := 1; 307716#partsFINAL assume true; 307708#partsEXIT >#67#return; 307702#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307707#$Ultimate##0 ~p := #in~p;~q := #in~q; 307763#L20 assume !(~p <= 0); 307761#L21 assume ~q <= 0;#res := 0; 307758#partsFINAL assume true; 307701#partsEXIT >#69#return; 307700#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307699#partsFINAL assume true; 307688#partsEXIT >#67#return; 307684#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 307686#$Ultimate##0 ~p := #in~p;~q := #in~q; 307762#L20 assume !(~p <= 0); 307760#L21 assume ~q <= 0;#res := 0; 307759#partsFINAL assume true; 307681#partsEXIT >#69#return; 307679#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307674#partsFINAL assume true; 307591#partsEXIT >#69#return; 307590#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 307588#partsFINAL assume true; 307540#partsEXIT >#71#return; 307531#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 307530#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 307317#L36 [2024-11-09 15:21:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash -377747438, now seen corresponding path program 8 times [2024-11-09 15:21:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:06,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397330615] [2024-11-09 15:21:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:21:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:21:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 15:21:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 15:21:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 15:21:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 15:21:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 15:21:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-09 15:21:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 14 proven. 114 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2024-11-09 15:21:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:07,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397330615] [2024-11-09 15:21:07,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397330615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:07,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520224260] [2024-11-09 15:21:07,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:21:07,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:07,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,216 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2024-11-09 15:21:07,309 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:21:07,309 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:07,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:21:07,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 48 proven. 80 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2024-11-09 15:21:07,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 14 proven. 114 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2024-11-09 15:21:07,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520224260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:07,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:07,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2024-11-09 15:21:07,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062974312] [2024-11-09 15:21:07,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:07,578 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2131124001, now seen corresponding path program 1 times [2024-11-09 15:21:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734593008] [2024-11-09 15:21:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 15:21:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 95 proven. 63 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 15:21:07,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:07,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734593008] [2024-11-09 15:21:07,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734593008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:07,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881434268] [2024-11-09 15:21:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:07,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:07,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,859 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2024-11-09 15:21:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 15:21:07,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 94 proven. 66 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 15:21:08,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 94 proven. 67 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-09 15:21:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881434268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:08,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:08,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 25 [2024-11-09 15:21:08,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151918660] [2024-11-09 15:21:08,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:08,571 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:21:08,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:08,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 15:21:08,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2024-11-09 15:21:08,572 INFO L87 Difference]: Start difference. First operand 768 states and 877 transitions. cyclomatic complexity: 117 Second operand has 25 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 15 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (18), 10 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-09 15:21:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:08,968 INFO L93 Difference]: Finished difference Result 885 states and 999 transitions. [2024-11-09 15:21:08,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 885 states and 999 transitions. [2024-11-09 15:21:08,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-09 15:21:08,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 885 states to 781 states and 869 transitions. [2024-11-09 15:21:08,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2024-11-09 15:21:08,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 212 [2024-11-09 15:21:08,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 781 states and 869 transitions. [2024-11-09 15:21:08,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:08,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 781 states and 869 transitions. [2024-11-09 15:21:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states and 869 transitions. [2024-11-09 15:21:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 733. [2024-11-09 15:21:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 512 states have (on average 1.029296875) internal successors, (527), 519 states have internal predecessors, (527), 120 states have call successors, (127), 93 states have call predecessors, (127), 101 states have return successors, (154), 120 states have call predecessors, (154), 120 states have call successors, (154) [2024-11-09 15:21:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 808 transitions. [2024-11-09 15:21:08,982 INFO L240 hiAutomatonCegarLoop]: Abstraction has 733 states and 808 transitions. [2024-11-09 15:21:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 15:21:08,983 INFO L425 stractBuchiCegarLoop]: Abstraction has 733 states and 808 transitions. [2024-11-09 15:21:08,983 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-09 15:21:08,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 733 states and 808 transitions. [2024-11-09 15:21:08,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-09 15:21:08,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:08,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:08,986 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 16, 10, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:21:08,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-09 15:21:08,986 INFO L745 eck$LassoCheckResult]: Stem: 311037#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 310990#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 310991#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 310988#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 310989#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 311078#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311075#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311076#$Ultimate##0 ~p := #in~p;~q := #in~q; 311079#L20 assume ~p <= 0;#res := 1; 311077#partsFINAL assume true; 311074#partsEXIT >#71#return; 311073#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311070#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311065#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311067#$Ultimate##0 ~p := #in~p;~q := #in~q; 311071#L20 assume ~p <= 0;#res := 1; 311068#partsFINAL assume true; 311064#partsEXIT >#71#return; 311063#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311061#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311057#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311058#$Ultimate##0 ~p := #in~p;~q := #in~q; 311062#L20 assume ~p <= 0;#res := 1; 311060#partsFINAL assume true; 311056#partsEXIT >#71#return; 311055#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311054#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 311009#L35-3 havoc main_~q~0#1; 311005#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 311006#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 311053#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311183#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311184#$Ultimate##0 ~p := #in~p;~q := #in~q; 311195#L20 assume !(~p <= 0); 311193#L21 assume ~q <= 0;#res := 0; 311191#partsFINAL assume true; 311182#partsEXIT >#71#return; 311178#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311176#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311173#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311174#$Ultimate##0 ~p := #in~p;~q := #in~q; 311196#L20 assume !(~p <= 0); 311194#L21 assume !(~q <= 0); 311192#L22 assume !(~q > ~p); 311189#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311190#$Ultimate##0 ~p := #in~p;~q := #in~q; 311198#L20 assume ~p <= 0;#res := 1; 311197#partsFINAL assume true; 311188#partsEXIT >#67#return; 311180#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311181#$Ultimate##0 ~p := #in~p;~q := #in~q; 311187#L20 assume !(~p <= 0); 311186#L21 assume ~q <= 0;#res := 0; 311185#partsFINAL assume true; 311179#partsEXIT >#69#return; 311177#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311175#partsFINAL assume true; 311172#partsEXIT >#71#return; 311171#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311169#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311032#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311163#$Ultimate##0 ~p := #in~p;~q := #in~q; 311154#L20 assume !(~p <= 0); 311149#L21 assume !(~q <= 0); 311143#L22 assume ~q > ~p; 311031#L22-1 call #t~ret0 := parts(~p, ~p);< 311033#$Ultimate##0 ~p := #in~p;~q := #in~q; 311280#L20 assume !(~p <= 0); 311277#L21 assume !(~q <= 0); 311275#L22 assume !(~q > ~p); 311233#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311234#$Ultimate##0 ~p := #in~p;~q := #in~q; 311267#L20 assume ~p <= 0;#res := 1; 311266#partsFINAL assume true; 311264#partsEXIT >#67#return; 311226#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311227#$Ultimate##0 ~p := #in~p;~q := #in~q; 311236#L20 assume !(~p <= 0); 311235#L21 assume ~q <= 0;#res := 0; 311230#partsFINAL assume true; 311225#partsEXIT >#69#return; 311222#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311209#partsFINAL assume true; 311207#partsEXIT >#65#return; 311205#L22-2 #res := #t~ret0;havoc #t~ret0; 311203#partsFINAL assume true; 311201#partsEXIT >#71#return; 311202#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311373#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 311372#L35-3 havoc main_~q~0#1; 311003#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 311004#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 311038#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 310992#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 310993#$Ultimate##0 ~p := #in~p;~q := #in~q; 311388#L20 assume !(~p <= 0); 311387#L21 assume ~q <= 0;#res := 0; 311386#partsFINAL assume true; 311085#partsEXIT >#71#return; 311049#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311050#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311355#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311356#$Ultimate##0 ~p := #in~p;~q := #in~q; 311382#L20 assume !(~p <= 0); 311380#L21 assume !(~q <= 0); 311379#L22 assume !(~q > ~p); 311375#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311377#$Ultimate##0 ~p := #in~p;~q := #in~q; 311614#L20 assume !(~p <= 0); 311612#L21 assume !(~q <= 0); 311399#L22 assume !(~q > ~p); 311397#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311398#$Ultimate##0 ~p := #in~p;~q := #in~q; 311410#L20 assume ~p <= 0;#res := 1; 311400#partsFINAL assume true; 311395#partsEXIT >#67#return; 311392#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311394#$Ultimate##0 ~p := #in~p;~q := #in~q; 311408#L20 assume !(~p <= 0); 311406#L21 assume ~q <= 0;#res := 0; 311403#partsFINAL assume true; 311390#partsEXIT >#69#return; 311389#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311385#partsFINAL assume true; 311374#partsEXIT >#67#return; 311363#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311365#$Ultimate##0 ~p := #in~p;~q := #in~q; 311371#L20 assume !(~p <= 0); 311370#L21 assume ~q <= 0;#res := 0; 311369#partsFINAL assume true; 311361#partsEXIT >#69#return; 311364#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311360#partsFINAL assume true; 311354#partsEXIT >#71#return; 311350#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311348#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311013#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311346#$Ultimate##0 ~p := #in~p;~q := #in~q; 311676#L20 assume !(~p <= 0); 311675#L21 assume !(~q <= 0); 311012#L22 assume !(~q > ~p); 311014#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311670#$Ultimate##0 ~p := #in~p;~q := #in~q; 311674#L20 assume ~p <= 0;#res := 1; 311672#partsFINAL assume true; 311669#partsEXIT >#67#return; 311425#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311427#$Ultimate##0 ~p := #in~p;~q := #in~q; 311679#L20 assume !(~p <= 0); 311678#L21 assume !(~q <= 0); 311631#L22 assume !(~q > ~p); 311520#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311521#$Ultimate##0 ~p := #in~p;~q := #in~q; 311533#L20 assume !(~p <= 0); 311531#L21 assume !(~q <= 0); 311530#L22 assume !(~q > ~p); 311528#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311529#$Ultimate##0 ~p := #in~p;~q := #in~q; 311537#L20 assume ~p <= 0;#res := 1; 311532#partsFINAL assume true; 311526#partsEXIT >#67#return; 311025#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311022#$Ultimate##0 ~p := #in~p;~q := #in~q; 311024#L20 assume !(~p <= 0); 311515#L21 assume ~q <= 0;#res := 0; 311512#partsFINAL assume true; 311503#partsEXIT >#69#return; 311504#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311522#partsFINAL assume true; 311519#partsEXIT >#67#return; 311517#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311518#$Ultimate##0 ~p := #in~p;~q := #in~q; 311525#L20 assume !(~p <= 0); 311524#L21 assume ~q <= 0;#res := 0; 311523#partsFINAL assume true; 311516#partsEXIT >#69#return; 311514#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311513#partsFINAL assume true; 311423#partsEXIT >#69#return; 311421#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311420#partsFINAL assume true; 311344#partsEXIT >#71#return; 311330#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311331#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311043#L36 [2024-11-09 15:21:08,986 INFO L747 eck$LassoCheckResult]: Loop: 311043#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 311084#$Ultimate##0 ~p := #in~p;~q := #in~q; 311328#L20 assume !(~p <= 0); 311325#L21 assume !(~q <= 0); 311228#L22 assume !(~q > ~p); 311229#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311670#$Ultimate##0 ~p := #in~p;~q := #in~q; 311674#L20 assume ~p <= 0;#res := 1; 311672#partsFINAL assume true; 311669#partsEXIT >#67#return; 311342#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311665#$Ultimate##0 ~p := #in~p;~q := #in~q; 311667#L20 assume !(~p <= 0); 311666#L21 assume !(~q <= 0); 311650#L22 assume !(~q > ~p); 311520#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311521#$Ultimate##0 ~p := #in~p;~q := #in~q; 311533#L20 assume !(~p <= 0); 311531#L21 assume !(~q <= 0); 311530#L22 assume !(~q > ~p); 311528#L23 call #t~ret1 := parts(~p - ~q, ~q);< 311529#$Ultimate##0 ~p := #in~p;~q := #in~q; 311537#L20 assume ~p <= 0;#res := 1; 311532#partsFINAL assume true; 311526#partsEXIT >#67#return; 311025#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311022#$Ultimate##0 ~p := #in~p;~q := #in~q; 311024#L20 assume !(~p <= 0); 311515#L21 assume ~q <= 0;#res := 0; 311512#partsFINAL assume true; 311503#partsEXIT >#69#return; 311504#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311522#partsFINAL assume true; 311519#partsEXIT >#67#return; 311517#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 311518#$Ultimate##0 ~p := #in~p;~q := #in~q; 311525#L20 assume !(~p <= 0); 311524#L21 assume ~q <= 0;#res := 0; 311523#partsFINAL assume true; 311516#partsEXIT >#69#return; 311514#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311513#partsFINAL assume true; 311423#partsEXIT >#69#return; 311421#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 311420#partsFINAL assume true; 311344#partsEXIT >#71#return; 311330#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 311331#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 311043#L36 [2024-11-09 15:21:08,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:08,987 INFO L85 PathProgramCache]: Analyzing trace with hash -377747438, now seen corresponding path program 9 times [2024-11-09 15:21:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:08,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951461435] [2024-11-09 15:21:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:21:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:21:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 15:21:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 15:21:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 15:21:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 15:21:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 15:21:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-09 15:21:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 14 proven. 114 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2024-11-09 15:21:09,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:09,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951461435] [2024-11-09 15:21:09,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951461435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:09,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920358449] [2024-11-09 15:21:09,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:21:09,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:09,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:09,177 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:09,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2024-11-09 15:21:09,269 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 15:21:09,270 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:09,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:21:09,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 123 proven. 175 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2024-11-09 15:21:09,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 123 proven. 177 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2024-11-09 15:21:09,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920358449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:09,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:09,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 19 [2024-11-09 15:21:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729826951] [2024-11-09 15:21:09,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:09,649 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:09,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:09,649 INFO L85 PathProgramCache]: Analyzing trace with hash 557552752, now seen corresponding path program 1 times [2024-11-09 15:21:09,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:09,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060750017] [2024-11-09 15:21:09,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:09,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:09,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:09,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:10,112 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:10,112 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:10,112 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:10,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:10,112 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:10,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,113 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:10,113 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:10,113 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration24_Loop [2024-11-09 15:21:10,113 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:10,113 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:10,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,137 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:10,137 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:10,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,139 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-11-09 15:21:10,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:10,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:10,158 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:10,158 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=3} Honda state: {ULTIMATE.start_main_~x~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:10,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:10,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,169 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-11-09 15:21:10,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:10,171 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:10,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-11-09 15:21:10,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,200 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-11-09 15:21:10,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:10,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:10,213 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:10,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-11-09 15:21:10,225 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:10,225 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:10,225 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:10,225 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:10,225 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:10,225 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,225 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:10,225 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:10,225 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration24_Loop [2024-11-09 15:21:10,225 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:10,226 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:10,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,253 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:10,253 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:10,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,254 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-11-09 15:21:10,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:10,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:10,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:10,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:10,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:10,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:10,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:10,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:10,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:10,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-11-09 15:21:10,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,279 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-11-09 15:21:10,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:10,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:10,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:10,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:10,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:10,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:10,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:10,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:10,292 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:10,293 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:10,294 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:10,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,295 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-11-09 15:21:10,296 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:10,296 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:10,296 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:10,296 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 5 Supporting invariants [] [2024-11-09 15:21:10,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2024-11-09 15:21:10,307 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:10,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:10,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 15:21:10,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:10,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:11,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 15:21:11,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 23 proven. 49 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 15:21:11,498 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2024-11-09 15:21:11,498 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 733 states and 808 transitions. cyclomatic complexity: 81 Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-09 15:21:11,557 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 733 states and 808 transitions. cyclomatic complexity: 81. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) Result 757 states and 833 transitions. Complement of second has 17 states. [2024-11-09 15:21:11,557 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-09 15:21:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-09 15:21:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2024-11-09 15:21:11,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 184 letters. Loop has 48 letters. [2024-11-09 15:21:11,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:11,558 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:11,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:11,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 15:21:11,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:12,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 15:21:12,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 23 proven. 49 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 15:21:12,675 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 12 loop predicates [2024-11-09 15:21:12,675 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 733 states and 808 transitions. cyclomatic complexity: 81 Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-09 15:21:12,724 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 733 states and 808 transitions. cyclomatic complexity: 81. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) Result 757 states and 833 transitions. Complement of second has 17 states. [2024-11-09 15:21:12,725 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-09 15:21:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-09 15:21:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2024-11-09 15:21:12,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 184 letters. Loop has 48 letters. [2024-11-09 15:21:12,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:12,725 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:12,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:12,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 15:21:12,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:13,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 15:21:13,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 23 proven. 49 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 15:21:13,912 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2024-11-09 15:21:13,912 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 733 states and 808 transitions. cyclomatic complexity: 81 Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-09 15:21:14,348 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 733 states and 808 transitions. cyclomatic complexity: 81. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) Result 1878 states and 2094 transitions. Complement of second has 88 states. [2024-11-09 15:21:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (11), 7 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-09 15:21:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 94 transitions. [2024-11-09 15:21:14,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 94 transitions. Stem has 184 letters. Loop has 48 letters. [2024-11-09 15:21:14,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:14,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 94 transitions. Stem has 232 letters. Loop has 48 letters. [2024-11-09 15:21:14,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:14,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 94 transitions. Stem has 184 letters. Loop has 96 letters. [2024-11-09 15:21:14,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:14,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1878 states and 2094 transitions. [2024-11-09 15:21:14,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2024-11-09 15:21:14,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1878 states to 1228 states and 1382 transitions. [2024-11-09 15:21:14,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2024-11-09 15:21:14,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2024-11-09 15:21:14,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1382 transitions. [2024-11-09 15:21:14,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:14,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1228 states and 1382 transitions. [2024-11-09 15:21:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1382 transitions. [2024-11-09 15:21:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1109. [2024-11-09 15:21:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 769 states have (on average 1.0364109232769831) internal successors, (797), 779 states have internal predecessors, (797), 186 states have call successors, (194), 141 states have call predecessors, (194), 154 states have return successors, (237), 188 states have call predecessors, (237), 186 states have call successors, (237) [2024-11-09 15:21:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1228 transitions. [2024-11-09 15:21:14,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1109 states and 1228 transitions. [2024-11-09 15:21:14,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 15:21:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-09 15:21:14,373 INFO L87 Difference]: Start difference. First operand 1109 states and 1228 transitions. Second operand has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 13 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (19), 14 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-09 15:21:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:14,566 INFO L93 Difference]: Finished difference Result 1207 states and 1379 transitions. [2024-11-09 15:21:14,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1207 states and 1379 transitions. [2024-11-09 15:21:14,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2024-11-09 15:21:14,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1207 states to 1161 states and 1322 transitions. [2024-11-09 15:21:14,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2024-11-09 15:21:14,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2024-11-09 15:21:14,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1161 states and 1322 transitions. [2024-11-09 15:21:14,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:14,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1161 states and 1322 transitions. [2024-11-09 15:21:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states and 1322 transitions. [2024-11-09 15:21:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1098. [2024-11-09 15:21:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 760 states have (on average 1.0368421052631578) internal successors, (788), 770 states have internal predecessors, (788), 185 states have call successors, (192), 138 states have call predecessors, (192), 153 states have return successors, (235), 189 states have call predecessors, (235), 185 states have call successors, (235) [2024-11-09 15:21:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1215 transitions. [2024-11-09 15:21:14,580 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1098 states and 1215 transitions. [2024-11-09 15:21:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 15:21:14,581 INFO L425 stractBuchiCegarLoop]: Abstraction has 1098 states and 1215 transitions. [2024-11-09 15:21:14,581 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-09 15:21:14,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1098 states and 1215 transitions. [2024-11-09 15:21:14,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2024-11-09 15:21:14,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:14,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:14,584 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [29, 29, 19, 12, 11, 11, 11, 10, 10, 9, 8, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 15:21:14,584 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:21:14,584 INFO L745 eck$LassoCheckResult]: Stem: 321168#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 321128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 321129#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 321126#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 321127#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 321182#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321219#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321220#$Ultimate##0 ~p := #in~p;~q := #in~q; 321222#L20 assume ~p <= 0;#res := 1; 321221#partsFINAL assume true; 321218#partsEXIT >#71#return; 321217#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321215#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321212#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321213#$Ultimate##0 ~p := #in~p;~q := #in~q; 321216#L20 assume ~p <= 0;#res := 1; 321214#partsFINAL assume true; 321211#partsEXIT >#71#return; 321210#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321208#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321206#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321189#$Ultimate##0 ~p := #in~p;~q := #in~q; 321209#L20 assume ~p <= 0;#res := 1; 321207#partsFINAL assume true; 321205#partsEXIT >#71#return; 321197#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321192#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321187#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321188#$Ultimate##0 ~p := #in~p;~q := #in~q; 321191#L20 assume ~p <= 0;#res := 1; 321190#partsFINAL assume true; 321186#partsEXIT >#71#return; 321185#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321184#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 321148#L35-3 havoc main_~q~0#1; 321142#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 321143#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 321183#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321453#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321454#$Ultimate##0 ~p := #in~p;~q := #in~q; 321475#L20 assume !(~p <= 0); 321473#L21 assume ~q <= 0;#res := 0; 321455#partsFINAL assume true; 321452#partsEXIT >#71#return; 321450#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321448#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321445#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321446#$Ultimate##0 ~p := #in~p;~q := #in~q; 321553#L20 assume !(~p <= 0); 321545#L21 assume !(~q <= 0); 321541#L22 assume !(~q > ~p); 321516#L23 call #t~ret1 := parts(~p - ~q, ~q);< 321517#$Ultimate##0 ~p := #in~p;~q := #in~q; 321539#L20 assume ~p <= 0;#res := 1; 321535#partsFINAL assume true; 321515#partsEXIT >#67#return; 321478#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 321479#$Ultimate##0 ~p := #in~p;~q := #in~q; 321485#L20 assume !(~p <= 0); 321484#L21 assume ~q <= 0;#res := 0; 321483#partsFINAL assume true; 321477#partsEXIT >#69#return; 321476#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 321458#partsFINAL assume true; 321444#partsEXIT >#71#return; 321435#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321429#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321398#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321399#$Ultimate##0 ~p := #in~p;~q := #in~q; 321957#L20 assume !(~p <= 0); 321956#L21 assume !(~q <= 0); 321955#L22 assume ~q > ~p; 321388#L22-1 call #t~ret0 := parts(~p, ~p);< 321952#$Ultimate##0 ~p := #in~p;~q := #in~q; 321953#L20 assume !(~p <= 0); 322020#L21 assume !(~q <= 0); 322017#L22 assume !(~q > ~p); 322012#L23 call #t~ret1 := parts(~p - ~q, ~q);< 322014#$Ultimate##0 ~p := #in~p;~q := #in~q; 322170#L20 assume ~p <= 0;#res := 1; 322165#partsFINAL assume true; 322162#partsEXIT >#67#return; 322156#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 322159#$Ultimate##0 ~p := #in~p;~q := #in~q; 322166#L20 assume !(~p <= 0); 322163#L21 assume ~q <= 0;#res := 0; 322160#partsFINAL assume true; 322155#partsEXIT >#69#return; 322157#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 322147#partsFINAL assume true; 322148#partsEXIT >#65#return; 322204#L22-2 #res := #t~ret0;havoc #t~ret0; 322206#partsFINAL assume true; 322205#partsEXIT >#71#return; 321939#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321382#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321194#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321671#$Ultimate##0 ~p := #in~p;~q := #in~q; 321200#L20 assume !(~p <= 0); 321201#L21 assume !(~q <= 0); 321193#L22 assume ~q > ~p; 321195#L22-1 call #t~ret0 := parts(~p, ~p);< 321164#$Ultimate##0 ~p := #in~p;~q := #in~q; 321252#L20 assume !(~p <= 0); 321299#L21 assume !(~q <= 0); 321298#L22 assume !(~q > ~p); 321295#L23 call #t~ret1 := parts(~p - ~q, ~q);< 321296#$Ultimate##0 ~p := #in~p;~q := #in~q; 321325#L20 assume ~p <= 0;#res := 1; 321324#partsFINAL assume true; 321316#partsEXIT >#67#return; 321292#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 321311#$Ultimate##0 ~p := #in~p;~q := #in~q; 321307#L20 assume !(~p <= 0); 321303#L21 assume ~q <= 0;#res := 0; 321291#partsFINAL assume true; 321293#partsEXIT >#69#return; 321381#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 321675#partsFINAL assume true; 321674#partsEXIT >#65#return; 321673#L22-2 #res := #t~ret0;havoc #t~ret0; 321672#partsFINAL assume true; 321670#partsEXIT >#71#return; 321178#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321169#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 321147#L35-3 havoc main_~q~0#1; 321140#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 321141#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 321196#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321130#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321131#$Ultimate##0 ~p := #in~p;~q := #in~q; 321660#L20 assume !(~p <= 0); 321659#L21 assume ~q <= 0;#res := 0; 321658#partsFINAL assume true; 321657#partsEXIT >#71#return; 321656#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321655#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321584#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321652#$Ultimate##0 ~p := #in~p;~q := #in~q; 321663#L20 assume !(~p <= 0); 321662#L21 assume !(~q <= 0); 321661#L22 assume !(~q > ~p); 321587#L23 call #t~ret1 := parts(~p - ~q, ~q);< 321588#$Ultimate##0 ~p := #in~p;~q := #in~q; 321596#L20 assume !(~p <= 0); 321595#L21 assume !(~q <= 0); 321594#L22 assume !(~q > ~p); 321559#L23 call #t~ret1 := parts(~p - ~q, ~q);< 321574#$Ultimate##0 ~p := #in~p;~q := #in~q; 321593#L20 assume ~p <= 0;#res := 1; 321592#partsFINAL assume true; 321573#partsEXIT >#67#return; 321570#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 321572#$Ultimate##0 ~p := #in~p;~q := #in~q; 321613#L20 assume !(~p <= 0); 321609#L21 assume ~q <= 0;#res := 0; 321600#partsFINAL assume true; 321568#partsEXIT >#69#return; 321571#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 321589#partsFINAL assume true; 321586#partsEXIT >#67#return; 321576#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 321579#$Ultimate##0 ~p := #in~p;~q := #in~q; 321591#L20 assume !(~p <= 0); 321590#L21 assume ~q <= 0;#res := 0; 321583#partsFINAL assume true; 321575#partsEXIT >#69#return; 321578#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 321654#partsFINAL assume true; 321651#partsEXIT >#71#return; 321649#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321647#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321418#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321420#$Ultimate##0 ~p := #in~p;~q := #in~q; 321519#L20 assume !(~p <= 0); 321512#L21 assume !(~q <= 0); 321503#L22 assume !(~q > ~p); 321471#L23 call #t~ret1 := parts(~p - ~q, ~q);< 321472#$Ultimate##0 ~p := #in~p;~q := #in~q; 321482#L20 assume ~p <= 0;#res := 1; 321481#partsFINAL assume true; 321469#partsEXIT >#67#return; 321425#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 321427#$Ultimate##0 ~p := #in~p;~q := #in~q; 321467#L20 assume !(~p <= 0); 321465#L21 assume !(~q <= 0); 321462#L22 assume !(~q > ~p); 321460#L23 call #t~ret1 := parts(~p - ~q, ~q);< 321461#$Ultimate##0 ~p := #in~p;~q := #in~q; 321642#L20 assume !(~p <= 0); 321640#L21 assume !(~q <= 0); 321636#L22 assume !(~q > ~p); 321628#L23 call #t~ret1 := parts(~p - ~q, ~q);< 321630#$Ultimate##0 ~p := #in~p;~q := #in~q; 321638#L20 assume ~p <= 0;#res := 1; 321633#partsFINAL assume true; 321627#partsEXIT >#67#return; 321603#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 321607#$Ultimate##0 ~p := #in~p;~q := #in~q; 321637#L20 assume !(~p <= 0); 321632#L21 assume ~q <= 0;#res := 0; 321624#partsFINAL assume true; 321601#partsEXIT >#69#return; 321597#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 321480#partsFINAL assume true; 321459#partsEXIT >#67#return; 321437#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 321438#$Ultimate##0 ~p := #in~p;~q := #in~q; 321451#L20 assume !(~p <= 0); 321449#L21 assume ~q <= 0;#res := 0; 321447#partsFINAL assume true; 321436#partsEXIT >#69#return; 321430#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 321428#partsFINAL assume true; 321423#partsEXIT >#69#return; 321422#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 321419#partsFINAL assume true; 321415#partsEXIT >#71#return; 321384#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321385#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321113#L36 [2024-11-09 15:21:14,588 INFO L747 eck$LassoCheckResult]: Loop: 321113#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 321204#$Ultimate##0 ~p := #in~p;~q := #in~q; 321951#L20 assume !(~p <= 0); 321949#L21 assume !(~q <= 0); 321947#L22 assume ~q > ~p; 321387#L22-1 call #t~ret0 := parts(~p, ~p);< 321952#$Ultimate##0 ~p := #in~p;~q := #in~q; 321953#L20 assume !(~p <= 0); 322020#L21 assume !(~q <= 0); 322017#L22 assume !(~q > ~p); 322012#L23 call #t~ret1 := parts(~p - ~q, ~q);< 322014#$Ultimate##0 ~p := #in~p;~q := #in~q; 322170#L20 assume ~p <= 0;#res := 1; 322165#partsFINAL assume true; 322162#partsEXIT >#67#return; 322156#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 322159#$Ultimate##0 ~p := #in~p;~q := #in~q; 322166#L20 assume !(~p <= 0); 322163#L21 assume ~q <= 0;#res := 0; 322160#partsFINAL assume true; 322155#partsEXIT >#69#return; 322157#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 322147#partsFINAL assume true; 322148#partsEXIT >#65#return; 322145#L22-2 #res := #t~ret0;havoc #t~ret0; 322144#partsFINAL assume true; 322143#partsEXIT >#71#return; 322142#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 321712#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 321113#L36 [2024-11-09 15:21:14,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash 207798287, now seen corresponding path program 10 times [2024-11-09 15:21:14,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:14,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670726851] [2024-11-09 15:21:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:14,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:14,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:14,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash -759624439, now seen corresponding path program 2 times [2024-11-09 15:21:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:14,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398538878] [2024-11-09 15:21:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:14,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:14,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:14,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:14,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:14,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2084589637, now seen corresponding path program 11 times [2024-11-09 15:21:14,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:14,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301030835] [2024-11-09 15:21:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:21:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 15:21:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 15:21:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 15:21:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 15:21:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 15:21:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 15:21:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 15:21:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 15:21:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 15:21:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 15:21:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-09 15:21:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 24 proven. 193 refuted. 0 times theorem prover too weak. 2548 trivial. 0 not checked. [2024-11-09 15:21:14,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:14,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301030835] [2024-11-09 15:21:14,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301030835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:14,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39269554] [2024-11-09 15:21:14,881 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 15:21:14,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:14,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:14,883 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:14,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2024-11-09 15:21:15,001 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-09 15:21:15,001 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:15,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:21:15,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 590 proven. 144 refuted. 0 times theorem prover too weak. 2031 trivial. 0 not checked. [2024-11-09 15:21:15,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 590 proven. 147 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2024-11-09 15:21:15,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39269554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:15,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:15,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 29 [2024-11-09 15:21:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943463715] [2024-11-09 15:21:15,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:15,802 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:15,802 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:15,802 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:15,802 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:15,802 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:15,803 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:15,803 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:15,803 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:15,803 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration25_Loop [2024-11-09 15:21:15,803 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:15,803 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:15,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:15,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:15,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:15,826 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:15,826 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:15,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:15,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:15,827 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:15,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-11-09 15:21:15,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:15,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:15,841 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:15,841 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:15,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2024-11-09 15:21:15,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:15,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:15,852 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:15,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-11-09 15:21:15,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:15,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:15,865 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:15,865 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=1} Honda state: {ULTIMATE.start_main_~p~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:15,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2024-11-09 15:21:15,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:15,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:15,877 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:15,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-11-09 15:21:15,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:15,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:15,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:15,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:15,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:15,901 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:15,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-11-09 15:21:15,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:15,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:15,942 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:15,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-11-09 15:21:15,947 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:15,947 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:15,947 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:15,947 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:15,947 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:15,947 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:15,947 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:15,947 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:15,947 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration25_Loop [2024-11-09 15:21:15,947 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:15,947 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:15,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:15,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:15,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:15,971 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:15,971 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:15,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:15,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:15,973 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:15,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-11-09 15:21:15,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:15,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:15,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:15,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:15,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:15,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:15,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:15,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:15,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:15,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2024-11-09 15:21:15,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:15,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:15,996 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:15,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-11-09 15:21:15,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:16,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:16,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:16,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:16,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:16,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:16,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:16,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:16,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:16,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-11-09 15:21:16,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:16,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:16,022 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:16,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-11-09 15:21:16,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:16,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:16,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:16,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:16,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:16,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:16,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:16,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:16,035 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:16,038 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-09 15:21:16,038 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:21:16,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:16,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:16,040 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:16,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-11-09 15:21:16,041 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:16,041 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:16,041 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:16,041 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~q~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2024-11-09 15:21:16,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2024-11-09 15:21:16,052 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:16,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:16,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 1353 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 15:21:16,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:16,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2024-11-09 15:21:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:17,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:21:17,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 15:21:17,382 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 15:21:17,382 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1098 states and 1215 transitions. cyclomatic complexity: 125 Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 15:21:17,400 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1098 states and 1215 transitions. cyclomatic complexity: 125. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 1122 states and 1241 transitions. Complement of second has 9 states. [2024-11-09 15:21:17,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 15:21:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-09 15:21:17,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 220 letters. Loop has 29 letters. [2024-11-09 15:21:17,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:17,401 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:17,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 1353 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 15:21:17,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:18,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:21:18,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 15:21:18,603 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 15:21:18,603 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1098 states and 1215 transitions. cyclomatic complexity: 125 Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 15:21:18,618 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1098 states and 1215 transitions. cyclomatic complexity: 125. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 1122 states and 1241 transitions. Complement of second has 9 states. [2024-11-09 15:21:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 15:21:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-09 15:21:18,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 220 letters. Loop has 29 letters. [2024-11-09 15:21:18,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:18,619 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:18,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:18,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 1353 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 15:21:18,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:19,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:21:19,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 15:21:19,934 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 15:21:19,935 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1098 states and 1215 transitions. cyclomatic complexity: 125 Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 15:21:19,995 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1098 states and 1215 transitions. cyclomatic complexity: 125. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 2352 states and 2594 transitions. Complement of second has 10 states. [2024-11-09 15:21:19,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 15:21:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2024-11-09 15:21:19,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 49 transitions. Stem has 220 letters. Loop has 29 letters. [2024-11-09 15:21:19,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:19,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 49 transitions. Stem has 249 letters. Loop has 29 letters. [2024-11-09 15:21:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 49 transitions. Stem has 220 letters. Loop has 58 letters. [2024-11-09 15:21:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:19,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2352 states and 2594 transitions. [2024-11-09 15:21:20,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2024-11-09 15:21:20,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2352 states to 1116 states and 1232 transitions. [2024-11-09 15:21:20,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2024-11-09 15:21:20,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2024-11-09 15:21:20,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1116 states and 1232 transitions. [2024-11-09 15:21:20,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:20,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1116 states and 1232 transitions. [2024-11-09 15:21:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states and 1232 transitions. [2024-11-09 15:21:20,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1113. [2024-11-09 15:21:20,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 771 states have (on average 1.0363164721141376) internal successors, (799), 781 states have internal predecessors, (799), 187 states have call successors, (194), 141 states have call predecessors, (194), 155 states have return successors, (236), 190 states have call predecessors, (236), 187 states have call successors, (236) [2024-11-09 15:21:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1229 transitions. [2024-11-09 15:21:20,017 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1113 states and 1229 transitions. [2024-11-09 15:21:20,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:20,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 15:21:20,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2024-11-09 15:21:20,017 INFO L87 Difference]: Start difference. First operand 1113 states and 1229 transitions. Second operand has 29 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 29 states have internal predecessors, (92), 19 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (27), 18 states have call predecessors, (27), 19 states have call successors, (27) [2024-11-09 15:21:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:21,024 INFO L93 Difference]: Finished difference Result 1326 states and 1561 transitions. [2024-11-09 15:21:21,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1326 states and 1561 transitions. [2024-11-09 15:21:21,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 104 [2024-11-09 15:21:21,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1326 states to 1242 states and 1442 transitions. [2024-11-09 15:21:21,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 200 [2024-11-09 15:21:21,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2024-11-09 15:21:21,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1242 states and 1442 transitions. [2024-11-09 15:21:21,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:21,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1242 states and 1442 transitions. [2024-11-09 15:21:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states and 1442 transitions. [2024-11-09 15:21:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1162. [2024-11-09 15:21:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 807 states have (on average 1.037174721189591) internal successors, (837), 818 states have internal predecessors, (837), 204 states have call successors, (212), 138 states have call predecessors, (212), 151 states have return successors, (258), 205 states have call predecessors, (258), 204 states have call successors, (258) [2024-11-09 15:21:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1307 transitions. [2024-11-09 15:21:21,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1162 states and 1307 transitions. [2024-11-09 15:21:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-09 15:21:21,057 INFO L425 stractBuchiCegarLoop]: Abstraction has 1162 states and 1307 transitions. [2024-11-09 15:21:21,057 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-09 15:21:21,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1162 states and 1307 transitions. [2024-11-09 15:21:21,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2024-11-09 15:21:21,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:21,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:21,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [29, 29, 19, 11, 11, 11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 15:21:21,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 16, 9, 8, 8, 8, 8, 8, 8, 7, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:21:21,062 INFO L745 eck$LassoCheckResult]: Stem: 333583#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 333545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 333546#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 333539#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 333540#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 333731#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333728#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333729#$Ultimate##0 ~p := #in~p;~q := #in~q; 333732#L20 assume ~p <= 0;#res := 1; 333730#partsFINAL assume true; 333727#partsEXIT >#71#return; 333726#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333724#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333721#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333722#$Ultimate##0 ~p := #in~p;~q := #in~q; 333725#L20 assume ~p <= 0;#res := 1; 333723#partsFINAL assume true; 333720#partsEXIT >#71#return; 333719#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333718#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333710#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333620#$Ultimate##0 ~p := #in~p;~q := #in~q; 333713#L20 assume ~p <= 0;#res := 1; 333712#partsFINAL assume true; 333709#partsEXIT >#71#return; 333707#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333706#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333617#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333621#$Ultimate##0 ~p := #in~p;~q := #in~q; 333623#L20 assume ~p <= 0;#res := 1; 333622#partsFINAL assume true; 333616#partsEXIT >#71#return; 333619#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333700#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 333699#L35-3 havoc main_~q~0#1; 333698#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 333697#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 333695#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333690#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333692#$Ultimate##0 ~p := #in~p;~q := #in~q; 333714#L20 assume !(~p <= 0); 333705#L21 assume ~q <= 0;#res := 0; 333704#partsFINAL assume true; 333689#partsEXIT >#71#return; 333685#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333682#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333678#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333679#$Ultimate##0 ~p := #in~p;~q := #in~q; 333717#L20 assume !(~p <= 0); 333716#L21 assume !(~q <= 0); 333715#L22 assume !(~q > ~p); 333702#L23 call #t~ret1 := parts(~p - ~q, ~q);< 333703#$Ultimate##0 ~p := #in~p;~q := #in~q; 333711#L20 assume ~p <= 0;#res := 1; 333708#partsFINAL assume true; 333701#partsEXIT >#67#return; 333687#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333688#$Ultimate##0 ~p := #in~p;~q := #in~q; 333696#L20 assume !(~p <= 0); 333694#L21 assume ~q <= 0;#res := 0; 333693#partsFINAL assume true; 333686#partsEXIT >#69#return; 333683#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333680#partsFINAL assume true; 333676#partsEXIT >#71#return; 333675#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333672#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333647#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333664#$Ultimate##0 ~p := #in~p;~q := #in~q; 333659#L20 assume !(~p <= 0); 333655#L21 assume !(~q <= 0); 333653#L22 assume ~q > ~p; 333650#L22-1 call #t~ret0 := parts(~p, ~p);< 333651#$Ultimate##0 ~p := #in~p;~q := #in~q; 333673#L20 assume !(~p <= 0); 333670#L21 assume !(~q <= 0); 333667#L22 assume !(~q > ~p); 333662#L23 call #t~ret1 := parts(~p - ~q, ~q);< 333663#$Ultimate##0 ~p := #in~p;~q := #in~q; 333669#L20 assume ~p <= 0;#res := 1; 333666#partsFINAL assume true; 333661#partsEXIT >#67#return; 333657#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333658#$Ultimate##0 ~p := #in~p;~q := #in~q; 333668#L20 assume !(~p <= 0); 333665#L21 assume ~q <= 0;#res := 0; 333660#partsFINAL assume true; 333656#partsEXIT >#69#return; 333654#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333652#partsFINAL assume true; 333649#partsEXIT >#65#return; 333645#L22-2 #res := #t~ret0;havoc #t~ret0; 333648#partsFINAL assume true; 334119#partsEXIT >#71#return; 333626#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333624#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333575#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333612#$Ultimate##0 ~p := #in~p;~q := #in~q; 333613#L20 assume !(~p <= 0); 333606#L21 assume !(~q <= 0); 333607#L22 assume ~q > ~p; 333533#L22-1 call #t~ret0 := parts(~p, ~p);< 333578#$Ultimate##0 ~p := #in~p;~q := #in~q; 334402#L20 assume !(~p <= 0); 334493#L21 assume !(~q <= 0); 334491#L22 assume !(~q > ~p); 333568#L23 call #t~ret1 := parts(~p - ~q, ~q);< 333567#$Ultimate##0 ~p := #in~p;~q := #in~q; 333569#L20 assume ~p <= 0;#res := 1; 333598#partsFINAL assume true; 334489#partsEXIT >#67#return; 333526#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333534#$Ultimate##0 ~p := #in~p;~q := #in~q; 334387#L20 assume !(~p <= 0); 333563#L21 assume ~q <= 0;#res := 0; 333564#partsFINAL assume true; 333525#partsEXIT >#69#return; 333527#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333642#partsFINAL assume true; 333643#partsEXIT >#65#return; 334202#L22-2 #res := #t~ret0;havoc #t~ret0; 334197#partsFINAL assume true; 334194#partsEXIT >#71#return; 333596#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333597#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 333559#L35-3 havoc main_~q~0#1; 333555#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 333556#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 333584#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333541#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333542#$Ultimate##0 ~p := #in~p;~q := #in~q; 334071#L20 assume !(~p <= 0); 334069#L21 assume ~q <= 0;#res := 0; 334067#partsFINAL assume true; 334062#partsEXIT >#71#return; 334064#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 334154#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333903#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333913#$Ultimate##0 ~p := #in~p;~q := #in~q; 333911#L20 assume !(~p <= 0); 333909#L21 assume !(~q <= 0); 333908#L22 assume !(~q > ~p); 333893#L23 call #t~ret1 := parts(~p - ~q, ~q);< 333906#$Ultimate##0 ~p := #in~p;~q := #in~q; 334632#L20 assume !(~p <= 0); 334625#L21 assume !(~q <= 0); 333929#L22 assume !(~q > ~p); 333925#L23 call #t~ret1 := parts(~p - ~q, ~q);< 333927#$Ultimate##0 ~p := #in~p;~q := #in~q; 333942#L20 assume ~p <= 0;#res := 1; 333933#partsFINAL assume true; 333924#partsEXIT >#67#return; 333919#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333922#$Ultimate##0 ~p := #in~p;~q := #in~q; 333950#L20 assume !(~p <= 0); 333948#L21 assume ~q <= 0;#res := 0; 333946#partsFINAL assume true; 333918#partsEXIT >#69#return; 333916#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333914#partsFINAL assume true; 333891#partsEXIT >#67#return; 333886#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333889#$Ultimate##0 ~p := #in~p;~q := #in~q; 333912#L20 assume !(~p <= 0); 333910#L21 assume ~q <= 0;#res := 0; 333902#partsFINAL assume true; 333885#partsEXIT >#69#return; 333888#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 334037#partsFINAL assume true; 333989#partsEXIT >#71#return; 333990#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 334544#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333630#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333638#$Ultimate##0 ~p := #in~p;~q := #in~q; 334401#L20 assume !(~p <= 0); 334352#L21 assume !(~q <= 0); 334306#L22 assume !(~q > ~p); 334300#L23 call #t~ret1 := parts(~p - ~q, ~q);< 334301#$Ultimate##0 ~p := #in~p;~q := #in~q; 334308#L20 assume ~p <= 0;#res := 1; 334305#partsFINAL assume true; 334299#partsEXIT >#67#return; 333734#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333738#$Ultimate##0 ~p := #in~p;~q := #in~q; 334550#L20 assume !(~p <= 0); 334549#L21 assume !(~q <= 0); 334006#L22 assume !(~q > ~p); 334004#L23 call #t~ret1 := parts(~p - ~q, ~q);< 334005#$Ultimate##0 ~p := #in~p;~q := #in~q; 334124#L20 assume !(~p <= 0); 334123#L21 assume !(~q <= 0); 334122#L22 assume !(~q > ~p); 334020#L23 call #t~ret1 := parts(~p - ~q, ~q);< 334022#$Ultimate##0 ~p := #in~p;~q := #in~q; 334047#L20 assume ~p <= 0;#res := 1; 334041#partsFINAL assume true; 334019#partsEXIT >#67#return; 334012#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 334017#$Ultimate##0 ~p := #in~p;~q := #in~q; 334060#L20 assume !(~p <= 0); 334058#L21 assume ~q <= 0;#res := 0; 334054#partsFINAL assume true; 334011#partsEXIT >#69#return; 334009#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 334007#partsFINAL assume true; 334003#partsEXIT >#67#return; 334001#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 334002#$Ultimate##0 ~p := #in~p;~q := #in~q; 334018#L20 assume !(~p <= 0); 334010#L21 assume ~q <= 0;#res := 0; 334008#partsFINAL assume true; 334000#partsEXIT >#69#return; 333999#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333998#partsFINAL assume true; 333733#partsEXIT >#69#return; 333644#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333640#partsFINAL assume true; 333628#partsEXIT >#71#return; 333636#L36-1 [2024-11-09 15:21:21,062 INFO L747 eck$LassoCheckResult]: Loop: 333636#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333960#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333591#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333615#$Ultimate##0 ~p := #in~p;~q := #in~q; 333609#L20 assume !(~p <= 0); 333610#L21 assume !(~q <= 0); 333604#L22 assume ~q > ~p; 333605#L22-1 call #t~ret0 := parts(~p, ~p);< 333965#$Ultimate##0 ~p := #in~p;~q := #in~q; 334105#L20 assume !(~p <= 0); 334095#L21 assume !(~q <= 0); 333997#L22 assume !(~q > ~p); 333995#L23 call #t~ret1 := parts(~p - ~q, ~q);< 333996#$Ultimate##0 ~p := #in~p;~q := #in~q; 334081#L20 assume ~p <= 0;#res := 1; 334076#partsFINAL assume true; 333994#partsEXIT >#67#return; 333977#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333978#$Ultimate##0 ~p := #in~p;~q := #in~q; 334118#L20 assume !(~p <= 0); 334106#L21 assume !(~q <= 0); 334096#L22 assume !(~q > ~p); 334078#L23 call #t~ret1 := parts(~p - ~q, ~q);< 334079#$Ultimate##0 ~p := #in~p;~q := #in~q; 334113#L20 assume !(~p <= 0); 334111#L21 assume !(~q <= 0); 334107#L22 assume !(~q > ~p); 334092#L23 call #t~ret1 := parts(~p - ~q, ~q);< 334093#$Ultimate##0 ~p := #in~p;~q := #in~q; 334108#L20 assume ~p <= 0;#res := 1; 334097#partsFINAL assume true; 334090#partsEXIT >#67#return; 334087#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 334089#$Ultimate##0 ~p := #in~p;~q := #in~q; 334101#L20 assume !(~p <= 0); 334099#L21 assume ~q <= 0;#res := 0; 334094#partsFINAL assume true; 334084#partsEXIT >#69#return; 334083#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 334082#partsFINAL assume true; 334077#partsEXIT >#67#return; 333992#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333993#$Ultimate##0 ~p := #in~p;~q := #in~q; 334080#L20 assume !(~p <= 0); 334075#L21 assume ~q <= 0;#res := 0; 334074#partsFINAL assume true; 333991#partsEXIT >#69#return; 333988#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333986#partsFINAL assume true; 333976#partsEXIT >#69#return; 333973#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333972#partsFINAL assume true; 333964#partsEXIT >#65#return; 333961#L22-2 #res := #t~ret0;havoc #t~ret0; 333956#partsFINAL assume true; 333955#partsEXIT >#71#return; 333953#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333952#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 333951#L35-3 havoc main_~q~0#1; 333949#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 333947#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 333899#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333897#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333898#$Ultimate##0 ~p := #in~p;~q := #in~q; 333945#L20 assume !(~p <= 0); 333944#L21 assume ~q <= 0;#res := 0; 333943#partsFINAL assume true; 333895#partsEXIT >#71#return; 333890#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 333877#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333868#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333870#$Ultimate##0 ~p := #in~p;~q := #in~q; 333938#L20 assume !(~p <= 0); 333936#L21 assume !(~q <= 0); 333932#L22 assume !(~q > ~p); 333892#L23 call #t~ret1 := parts(~p - ~q, ~q);< 333894#$Ultimate##0 ~p := #in~p;~q := #in~q; 334629#L20 assume !(~p <= 0); 334628#L21 assume !(~q <= 0); 334627#L22 assume !(~q > ~p); 333925#L23 call #t~ret1 := parts(~p - ~q, ~q);< 333927#$Ultimate##0 ~p := #in~p;~q := #in~q; 333942#L20 assume ~p <= 0;#res := 1; 333933#partsFINAL assume true; 333924#partsEXIT >#67#return; 333919#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333922#$Ultimate##0 ~p := #in~p;~q := #in~q; 333950#L20 assume !(~p <= 0); 333948#L21 assume ~q <= 0;#res := 0; 333946#partsFINAL assume true; 333918#partsEXIT >#69#return; 333916#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333914#partsFINAL assume true; 333891#partsEXIT >#67#return; 333887#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333889#$Ultimate##0 ~p := #in~p;~q := #in~q; 333912#L20 assume !(~p <= 0); 333910#L21 assume ~q <= 0;#res := 0; 333902#partsFINAL assume true; 333885#partsEXIT >#69#return; 333876#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333872#partsFINAL assume true; 333866#partsEXIT >#71#return; 333869#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 334529#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 333631#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 333857#$Ultimate##0 ~p := #in~p;~q := #in~q; 334528#L20 assume !(~p <= 0); 334526#L21 assume !(~q <= 0); 334518#L22 assume !(~q > ~p); 334300#L23 call #t~ret1 := parts(~p - ~q, ~q);< 334301#$Ultimate##0 ~p := #in~p;~q := #in~q; 334308#L20 assume ~p <= 0;#res := 1; 334305#partsFINAL assume true; 334299#partsEXIT >#67#return; 333734#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 333738#$Ultimate##0 ~p := #in~p;~q := #in~q; 334550#L20 assume !(~p <= 0); 334549#L21 assume !(~q <= 0); 334006#L22 assume !(~q > ~p); 334004#L23 call #t~ret1 := parts(~p - ~q, ~q);< 334005#$Ultimate##0 ~p := #in~p;~q := #in~q; 334124#L20 assume !(~p <= 0); 334123#L21 assume !(~q <= 0); 334122#L22 assume !(~q > ~p); 334020#L23 call #t~ret1 := parts(~p - ~q, ~q);< 334022#$Ultimate##0 ~p := #in~p;~q := #in~q; 334047#L20 assume ~p <= 0;#res := 1; 334041#partsFINAL assume true; 334019#partsEXIT >#67#return; 334012#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 334017#$Ultimate##0 ~p := #in~p;~q := #in~q; 334060#L20 assume !(~p <= 0); 334058#L21 assume ~q <= 0;#res := 0; 334054#partsFINAL assume true; 334011#partsEXIT >#69#return; 334009#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 334007#partsFINAL assume true; 334003#partsEXIT >#67#return; 334001#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 334002#$Ultimate##0 ~p := #in~p;~q := #in~q; 334018#L20 assume !(~p <= 0); 334010#L21 assume ~q <= 0;#res := 0; 334008#partsFINAL assume true; 334000#partsEXIT >#69#return; 333999#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333998#partsFINAL assume true; 333733#partsEXIT >#69#return; 333644#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 333640#partsFINAL assume true; 333628#partsEXIT >#71#return; 333636#L36-1 [2024-11-09 15:21:21,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1559558574, now seen corresponding path program 12 times [2024-11-09 15:21:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:21,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254822458] [2024-11-09 15:21:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:21,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:21,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:21,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:21,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1884130984, now seen corresponding path program 5 times [2024-11-09 15:21:21,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695064280] [2024-11-09 15:21:21,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:21,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:21:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 15:21:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 15:21:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 15:21:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 155 proven. 379 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-11-09 15:21:21,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:21,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695064280] [2024-11-09 15:21:21,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695064280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:21,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838437137] [2024-11-09 15:21:21,464 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 15:21:21,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:21,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:21,466 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:21,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2024-11-09 15:21:21,549 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-09 15:21:21,549 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:21,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:21:21,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 665 proven. 162 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-09 15:21:21,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 151 proven. 397 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-11-09 15:21:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838437137] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:22,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 19] total 38 [2024-11-09 15:21:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565552642] [2024-11-09 15:21:22,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:22,368 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:21:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 15:21:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 15:21:22,369 INFO L87 Difference]: Start difference. First operand 1162 states and 1307 transitions. cyclomatic complexity: 154 Second operand has 38 states, 33 states have (on average 3.393939393939394) internal successors, (112), 34 states have internal predecessors, (112), 23 states have call successors, (34), 2 states have call predecessors, (34), 12 states have return successors, (35), 21 states have call predecessors, (35), 23 states have call successors, (35) [2024-11-09 15:21:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:23,375 INFO L93 Difference]: Finished difference Result 1259 states and 1398 transitions. [2024-11-09 15:21:23,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1259 states and 1398 transitions. [2024-11-09 15:21:23,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2024-11-09 15:21:23,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1259 states to 832 states and 912 transitions. [2024-11-09 15:21:23,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2024-11-09 15:21:23,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2024-11-09 15:21:23,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 832 states and 912 transitions. [2024-11-09 15:21:23,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:23,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 832 states and 912 transitions. [2024-11-09 15:21:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states and 912 transitions. [2024-11-09 15:21:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 794. [2024-11-09 15:21:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 565 states have (on average 1.0212389380530973) internal successors, (577), 567 states have internal predecessors, (577), 127 states have call successors, (135), 95 states have call predecessors, (135), 102 states have return successors, (154), 131 states have call predecessors, (154), 127 states have call successors, (154) [2024-11-09 15:21:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 866 transitions. [2024-11-09 15:21:23,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 794 states and 866 transitions. [2024-11-09 15:21:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-09 15:21:23,392 INFO L425 stractBuchiCegarLoop]: Abstraction has 794 states and 866 transitions. [2024-11-09 15:21:23,393 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-09 15:21:23,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 794 states and 866 transitions. [2024-11-09 15:21:23,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2024-11-09 15:21:23,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:23,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:23,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 15:21:23,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [35, 35, 29, 17, 14, 14, 14, 14, 14, 14, 12, 6, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2024-11-09 15:21:23,397 INFO L745 eck$LassoCheckResult]: Stem: 337372#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 337329#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 337330#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 337323#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 337324#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 337430#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337427#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337428#$Ultimate##0 ~p := #in~p;~q := #in~q; 337431#L20 assume ~p <= 0;#res := 1; 337429#partsFINAL assume true; 337426#partsEXIT >#71#return; 337425#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337423#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337420#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337421#$Ultimate##0 ~p := #in~p;~q := #in~q; 337424#L20 assume ~p <= 0;#res := 1; 337422#partsFINAL assume true; 337419#partsEXIT >#71#return; 337418#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337416#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337413#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337405#$Ultimate##0 ~p := #in~p;~q := #in~q; 337417#L20 assume ~p <= 0;#res := 1; 337415#partsFINAL assume true; 337412#partsEXIT >#71#return; 337411#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337410#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337401#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337404#$Ultimate##0 ~p := #in~p;~q := #in~q; 337407#L20 assume ~p <= 0;#res := 1; 337406#partsFINAL assume true; 337400#partsEXIT >#71#return; 337396#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337397#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 337563#L35-3 havoc main_~q~0#1; 337561#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 337559#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 337558#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337551#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337553#$Ultimate##0 ~p := #in~p;~q := #in~q; 337579#L20 assume !(~p <= 0); 337578#L21 assume ~q <= 0;#res := 0; 337576#partsFINAL assume true; 337549#partsEXIT >#71#return; 337552#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337544#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337531#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337533#$Ultimate##0 ~p := #in~p;~q := #in~q; 337575#L20 assume !(~p <= 0); 337573#L21 assume !(~q <= 0); 337571#L22 assume !(~q > ~p); 337569#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337570#$Ultimate##0 ~p := #in~p;~q := #in~q; 337574#L20 assume ~p <= 0;#res := 1; 337572#partsFINAL assume true; 337568#partsEXIT >#67#return; 337547#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337548#$Ultimate##0 ~p := #in~p;~q := #in~q; 337567#L20 assume !(~p <= 0); 337566#L21 assume ~q <= 0;#res := 0; 337565#partsFINAL assume true; 337546#partsEXIT >#69#return; 337541#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337537#partsFINAL assume true; 337529#partsEXIT >#71#return; 337532#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337580#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337514#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337448#$Ultimate##0 ~p := #in~p;~q := #in~q; 337557#L20 assume !(~p <= 0); 337545#L21 assume !(~q <= 0); 337540#L22 assume ~q > ~p; 337535#L22-1 call #t~ret0 := parts(~p, ~p);< 337536#$Ultimate##0 ~p := #in~p;~q := #in~q; 337587#L20 assume !(~p <= 0); 337585#L21 assume !(~q <= 0); 337584#L22 assume !(~q > ~p); 337582#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337583#$Ultimate##0 ~p := #in~p;~q := #in~q; 337588#L20 assume ~p <= 0;#res := 1; 337586#partsFINAL assume true; 337581#partsEXIT >#67#return; 337555#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337556#$Ultimate##0 ~p := #in~p;~q := #in~q; 337564#L20 assume !(~p <= 0); 337562#L21 assume ~q <= 0;#res := 0; 337560#partsFINAL assume true; 337554#partsEXIT >#69#return; 337543#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337539#partsFINAL assume true; 337534#partsEXIT >#65#return; 337528#L22-2 #res := #t~ret0;havoc #t~ret0; 337523#partsFINAL assume true; 337512#partsEXIT >#71#return; 337510#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337509#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337366#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337398#$Ultimate##0 ~p := #in~p;~q := #in~q; 337399#L20 assume !(~p <= 0); 337392#L21 assume !(~q <= 0); 337391#L22 assume ~q > ~p; 337365#L22-1 call #t~ret0 := parts(~p, ~p);< 337369#$Ultimate##0 ~p := #in~p;~q := #in~q; 337636#L20 assume !(~p <= 0); 337631#L21 assume !(~q <= 0); 337629#L22 assume !(~q > ~p); 337617#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337618#$Ultimate##0 ~p := #in~p;~q := #in~q; 337628#L20 assume ~p <= 0;#res := 1; 337627#partsFINAL assume true; 337616#partsEXIT >#67#return; 337600#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337609#$Ultimate##0 ~p := #in~p;~q := #in~q; 337605#L20 assume !(~p <= 0); 337599#L21 assume ~q <= 0;#res := 0; 337601#partsFINAL assume true; 337720#partsEXIT >#69#return; 337718#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337717#partsFINAL assume true; 337716#partsEXIT >#65#return; 337714#L22-2 #res := #t~ret0;havoc #t~ret0; 337712#partsFINAL assume true; 337707#partsEXIT >#71#return; 337708#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337709#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 337706#L35-3 havoc main_~q~0#1; 337704#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 337702#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 337700#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337692#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337695#$Ultimate##0 ~p := #in~p;~q := #in~q; 337715#L20 assume !(~p <= 0); 337713#L21 assume ~q <= 0;#res := 0; 337698#partsFINAL assume true; 337691#partsEXIT >#71#return; 337694#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337950#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337681#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337683#$Ultimate##0 ~p := #in~p;~q := #in~q; 337918#L20 assume !(~p <= 0); 337917#L21 assume !(~q <= 0); 337916#L22 assume !(~q > ~p); 337914#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337915#$Ultimate##0 ~p := #in~p;~q := #in~q; 337930#L20 assume !(~p <= 0); 337928#L21 assume !(~q <= 0); 337927#L22 assume !(~q > ~p); 337925#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337926#$Ultimate##0 ~p := #in~p;~q := #in~q; 337931#L20 assume ~p <= 0;#res := 1; 337929#partsFINAL assume true; 337924#partsEXIT >#67#return; 337922#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337923#$Ultimate##0 ~p := #in~p;~q := #in~q; 337936#L20 assume !(~p <= 0); 337934#L21 assume ~q <= 0;#res := 0; 337932#partsFINAL assume true; 337921#partsEXIT >#69#return; 337920#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337919#partsFINAL assume true; 337913#partsEXIT >#67#return; 337910#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337911#$Ultimate##0 ~p := #in~p;~q := #in~q; 337937#L20 assume !(~p <= 0); 337935#L21 assume ~q <= 0;#res := 0; 337933#partsFINAL assume true; 337909#partsEXIT >#69#return; 337907#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337685#partsFINAL assume true; 337679#partsEXIT >#71#return; 337678#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337676#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337336#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337447#$Ultimate##0 ~p := #in~p;~q := #in~q; 338086#L20 assume !(~p <= 0); 338085#L21 assume !(~q <= 0); 338084#L22 assume !(~q > ~p); 337316#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337335#$Ultimate##0 ~p := #in~p;~q := #in~q; 338083#L20 assume ~p <= 0;#res := 1; 338082#partsFINAL assume true; 337315#partsEXIT >#67#return; 337317#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 338010#$Ultimate##0 ~p := #in~p;~q := #in~q; 338090#L20 assume !(~p <= 0); 338087#L21 assume !(~q <= 0); 337346#L22 assume !(~q > ~p); 337348#L23 call #t~ret1 := parts(~p - ~q, ~q);< 338024#$Ultimate##0 ~p := #in~p;~q := #in~q; 338045#L20 assume !(~p <= 0); 338043#L21 assume !(~q <= 0); 338039#L22 assume !(~q > ~p); 338036#L23 call #t~ret1 := parts(~p - ~q, ~q);< 338037#$Ultimate##0 ~p := #in~p;~q := #in~q; 338051#L20 assume ~p <= 0;#res := 1; 338049#partsFINAL assume true; 338035#partsEXIT >#67#return; 338032#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 338033#$Ultimate##0 ~p := #in~p;~q := #in~q; 338055#L20 assume !(~p <= 0); 338053#L21 assume ~q <= 0;#res := 0; 338052#partsFINAL assume true; 338031#partsEXIT >#69#return; 338030#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 338028#partsFINAL assume true; 338023#partsEXIT >#67#return; 338020#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 338021#$Ultimate##0 ~p := #in~p;~q := #in~q; 338057#L20 assume !(~p <= 0); 338056#L21 assume ~q <= 0;#res := 0; 338054#partsFINAL assume true; 338019#partsEXIT >#69#return; 338017#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 338013#partsFINAL assume true; 338008#partsEXIT >#69#return; 337592#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337593#partsFINAL assume true; 337438#partsEXIT >#71#return; 337440#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 338099#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337378#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337408#$Ultimate##0 ~p := #in~p;~q := #in~q; 337394#L20 assume !(~p <= 0); 337395#L21 assume !(~q <= 0); 337495#L22 assume ~q > ~p; 337434#L22-1 call #t~ret0 := parts(~p, ~p);< 337479#$Ultimate##0 ~p := #in~p;~q := #in~q; 337480#L20 assume !(~p <= 0); 337624#L21 assume !(~q <= 0); 337619#L22 assume !(~q > ~p); 337596#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337597#$Ultimate##0 ~p := #in~p;~q := #in~q; 337992#L20 assume ~p <= 0;#res := 1; 337711#partsFINAL assume true; 337595#partsEXIT >#67#return; 337451#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337455#$Ultimate##0 ~p := #in~p;~q := #in~q; 337625#L20 assume !(~p <= 0); 337615#L21 assume !(~q <= 0); 337612#L22 assume !(~q > ~p); 337332#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337608#$Ultimate##0 ~p := #in~p;~q := #in~q; 337993#L20 assume !(~p <= 0); 337991#L21 assume !(~q <= 0); 337345#L22 assume !(~q > ~p); 337331#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337333#$Ultimate##0 ~p := #in~p;~q := #in~q; 337644#L20 assume ~p <= 0;#res := 1; 337641#partsFINAL assume true; 337639#partsEXIT >#67#return; 337622#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337623#$Ultimate##0 ~p := #in~p;~q := #in~q; 337632#L20 assume !(~p <= 0); 337630#L21 assume ~q <= 0;#res := 0; 337626#partsFINAL assume true; 337620#partsEXIT >#69#return; 337614#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337611#partsFINAL assume true; 337607#partsEXIT >#67#return; 337603#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337604#$Ultimate##0 ~p := #in~p;~q := #in~q; 337613#L20 assume !(~p <= 0); 337610#L21 assume ~q <= 0;#res := 0; 337606#partsFINAL assume true; 337602#partsEXIT >#69#return; 337598#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337589#partsFINAL assume true; 337450#partsEXIT >#69#return; 337443#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337437#partsFINAL assume true; 337433#partsEXIT >#65#return; 337435#L22-2 #res := #t~ret0;havoc #t~ret0; 338098#partsFINAL assume true; 338096#partsEXIT >#71#return; 338093#L36-1 [2024-11-09 15:21:23,398 INFO L747 eck$LassoCheckResult]: Loop: 338093#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 338092#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 338091#L35-3 havoc main_~q~0#1; 337338#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 337339#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 337389#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337325#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337326#$Ultimate##0 ~p := #in~p;~q := #in~q; 337769#L20 assume !(~p <= 0); 337765#L21 assume ~q <= 0;#res := 0; 337761#partsFINAL assume true; 337747#partsEXIT >#71#return; 337674#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337670#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337662#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337664#$Ultimate##0 ~p := #in~p;~q := #in~q; 337959#L20 assume !(~p <= 0); 337957#L21 assume !(~q <= 0); 337955#L22 assume !(~q > ~p); 337952#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337953#$Ultimate##0 ~p := #in~p;~q := #in~q; 337976#L20 assume !(~p <= 0); 337972#L21 assume !(~q <= 0); 337970#L22 assume !(~q > ~p); 337320#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337967#$Ultimate##0 ~p := #in~p;~q := #in~q; 337985#L20 assume !(~p <= 0); 337982#L21 assume !(~q <= 0); 337974#L22 assume !(~q > ~p); 337975#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337984#$Ultimate##0 ~p := #in~p;~q := #in~q; 337988#L20 assume ~p <= 0;#res := 1; 337986#partsFINAL assume true; 337983#partsEXIT >#67#return; 337980#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337981#$Ultimate##0 ~p := #in~p;~q := #in~q; 338089#L20 assume !(~p <= 0); 338088#L21 assume ~q <= 0;#res := 0; 337987#partsFINAL assume true; 337979#partsEXIT >#69#return; 337978#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337977#partsFINAL assume true; 337966#partsEXIT >#67#return; 337961#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337964#$Ultimate##0 ~p := #in~p;~q := #in~q; 337973#L20 assume !(~p <= 0); 337971#L21 assume ~q <= 0;#res := 0; 337968#partsFINAL assume true; 337960#partsEXIT >#69#return; 337958#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337956#partsFINAL assume true; 337951#partsEXIT >#67#return; 337687#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337688#$Ultimate##0 ~p := #in~p;~q := #in~q; 337912#L20 assume !(~p <= 0); 337908#L21 assume ~q <= 0;#res := 0; 337906#partsFINAL assume true; 337686#partsEXIT >#69#return; 337684#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337665#partsFINAL assume true; 337661#partsEXIT >#71#return; 337591#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337449#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337441#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337442#$Ultimate##0 ~p := #in~p;~q := #in~q; 337806#L20 assume !(~p <= 0); 337805#L21 assume !(~q <= 0); 337797#L22 assume !(~q > ~p); 337793#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337794#$Ultimate##0 ~p := #in~p;~q := #in~q; 337888#L20 assume !(~p <= 0); 337887#L21 assume !(~q <= 0); 337886#L22 assume ~q > ~p; 337884#L22-1 call #t~ret0 := parts(~p, ~p);< 337885#$Ultimate##0 ~p := #in~p;~q := #in~q; 337900#L20 assume !(~p <= 0); 337898#L21 assume !(~q <= 0); 337897#L22 assume !(~q > ~p); 337895#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337896#$Ultimate##0 ~p := #in~p;~q := #in~q; 337901#L20 assume ~p <= 0;#res := 1; 337899#partsFINAL assume true; 337894#partsEXIT >#67#return; 337892#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337893#$Ultimate##0 ~p := #in~p;~q := #in~q; 337905#L20 assume !(~p <= 0); 337904#L21 assume ~q <= 0;#res := 0; 337902#partsFINAL assume true; 337891#partsEXIT >#69#return; 337890#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337889#partsFINAL assume true; 337883#partsEXIT >#65#return; 337881#L22-2 #res := #t~ret0;havoc #t~ret0; 337878#partsFINAL assume true; 337791#partsEXIT >#67#return; 337723#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337788#$Ultimate##0 ~p := #in~p;~q := #in~q; 337949#L20 assume !(~p <= 0); 337943#L21 assume !(~q <= 0); 337940#L22 assume !(~q > ~p); 337800#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337803#$Ultimate##0 ~p := #in~p;~q := #in~q; 337828#L20 assume !(~p <= 0); 337827#L21 assume !(~q <= 0); 337826#L22 assume !(~q > ~p); 337363#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337824#$Ultimate##0 ~p := #in~p;~q := #in~q; 337839#L20 assume !(~p <= 0); 337832#L21 assume !(~q <= 0); 337833#L22 assume !(~q > ~p); 337841#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337842#$Ultimate##0 ~p := #in~p;~q := #in~q; 337844#L20 assume ~p <= 0;#res := 1; 337843#partsFINAL assume true; 337840#partsEXIT >#67#return; 337835#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337838#$Ultimate##0 ~p := #in~p;~q := #in~q; 337861#L20 assume !(~p <= 0); 337859#L21 assume ~q <= 0;#res := 0; 337845#partsFINAL assume true; 337834#partsEXIT >#69#return; 337831#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337829#partsFINAL assume true; 337823#partsEXIT >#67#return; 337819#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337821#$Ultimate##0 ~p := #in~p;~q := #in~q; 337877#L20 assume !(~p <= 0); 337876#L21 assume ~q <= 0;#res := 0; 337875#partsFINAL assume true; 337818#partsEXIT >#69#return; 337816#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337815#partsFINAL assume true; 337808#partsEXIT >#67#return; 337781#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337807#$Ultimate##0 ~p := #in~p;~q := #in~q; 337944#L20 assume !(~p <= 0); 337941#L21 assume ~q <= 0;#res := 0; 337938#partsFINAL assume true; 337780#partsEXIT >#69#return; 337783#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337903#partsFINAL assume true; 337787#partsEXIT >#69#return; 337786#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337444#partsFINAL assume true; 337446#partsEXIT >#71#return; 337436#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 337432#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 337377#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 337408#$Ultimate##0 ~p := #in~p;~q := #in~q; 337394#L20 assume !(~p <= 0); 337395#L21 assume !(~q <= 0); 337495#L22 assume ~q > ~p; 337434#L22-1 call #t~ret0 := parts(~p, ~p);< 337479#$Ultimate##0 ~p := #in~p;~q := #in~q; 337475#L20 assume !(~p <= 0); 337468#L21 assume !(~q <= 0); 337463#L22 assume !(~q > ~p); 337459#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337460#$Ultimate##0 ~p := #in~p;~q := #in~q; 337467#L20 assume ~p <= 0;#res := 1; 337462#partsFINAL assume true; 337458#partsEXIT >#67#return; 337453#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337456#$Ultimate##0 ~p := #in~p;~q := #in~q; 337478#L20 assume !(~p <= 0); 337474#L21 assume !(~q <= 0); 337473#L22 assume !(~q > ~p); 337471#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337472#$Ultimate##0 ~p := #in~p;~q := #in~q; 337493#L20 assume !(~p <= 0); 337492#L21 assume !(~q <= 0); 337491#L22 assume ~q > ~p; 337489#L22-1 call #t~ret0 := parts(~p, ~p);< 337490#$Ultimate##0 ~p := #in~p;~q := #in~q; 337526#L20 assume !(~p <= 0); 337521#L21 assume !(~q <= 0); 337507#L22 assume !(~q > ~p); 337504#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337505#$Ultimate##0 ~p := #in~p;~q := #in~q; 337520#L20 assume ~p <= 0;#res := 1; 337519#partsFINAL assume true; 337503#partsEXIT >#67#return; 337501#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337502#$Ultimate##0 ~p := #in~p;~q := #in~q; 337527#L20 assume !(~p <= 0); 337522#L21 assume ~q <= 0;#res := 0; 337508#partsFINAL assume true; 337500#partsEXIT >#69#return; 337499#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337498#partsFINAL assume true; 337488#partsEXIT >#65#return; 337484#L22-2 #res := #t~ret0;havoc #t~ret0; 337477#partsFINAL assume true; 337470#partsEXIT >#67#return; 337465#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337466#$Ultimate##0 ~p := #in~p;~q := #in~q; 337518#L20 assume !(~p <= 0); 337497#L21 assume !(~q <= 0); 337496#L22 assume !(~q > ~p); 337486#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337487#$Ultimate##0 ~p := #in~p;~q := #in~q; 337677#L20 assume !(~p <= 0); 337655#L21 assume !(~q <= 0); 337654#L22 assume !(~q > ~p); 337311#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337648#$Ultimate##0 ~p := #in~p;~q := #in~q; 337645#L20 assume !(~p <= 0); 337642#L21 assume !(~q <= 0); 337640#L22 assume !(~q > ~p); 337634#L23 call #t~ret1 := parts(~p - ~q, ~q);< 337635#$Ultimate##0 ~p := #in~p;~q := #in~q; 337638#L20 assume ~p <= 0;#res := 1; 337637#partsFINAL assume true; 337633#partsEXIT >#67#return; 337621#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337623#$Ultimate##0 ~p := #in~p;~q := #in~q; 337632#L20 assume !(~p <= 0); 337630#L21 assume ~q <= 0;#res := 0; 337626#partsFINAL assume true; 337620#partsEXIT >#69#return; 337359#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337360#partsFINAL assume true; 337310#partsEXIT >#67#return; 337314#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337318#$Ultimate##0 ~p := #in~p;~q := #in~q; 337355#L20 assume !(~p <= 0); 337349#L21 assume ~q <= 0;#res := 0; 337350#partsFINAL assume true; 338103#partsEXIT >#69#return; 338102#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 338094#partsFINAL assume true; 337485#partsEXIT >#67#return; 337482#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 337483#$Ultimate##0 ~p := #in~p;~q := #in~q; 337517#L20 assume !(~p <= 0); 337511#L21 assume ~q <= 0;#res := 0; 337494#partsFINAL assume true; 337481#partsEXIT >#69#return; 337476#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337469#partsFINAL assume true; 337464#partsEXIT >#69#return; 337461#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 337457#partsFINAL assume true; 337452#partsEXIT >#69#return; 337454#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 338101#partsFINAL assume true; 338100#partsEXIT >#65#return; 337375#L22-2 #res := #t~ret0;havoc #t~ret0; 337380#partsFINAL assume true; 338097#partsEXIT >#71#return; 338093#L36-1 [2024-11-09 15:21:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash -878819278, now seen corresponding path program 13 times [2024-11-09 15:21:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:23,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097657602] [2024-11-09 15:21:23,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:23,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:23,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:23,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:23,461 INFO L85 PathProgramCache]: Analyzing trace with hash 546628104, now seen corresponding path program 6 times [2024-11-09 15:21:23,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:23,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484437180] [2024-11-09 15:21:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:21:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:21:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:21:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 15:21:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:21:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-09 15:21:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:21:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 158 proven. 524 refuted. 0 times theorem prover too weak. 2541 trivial. 0 not checked. [2024-11-09 15:21:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:23,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484437180] [2024-11-09 15:21:23,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484437180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:23,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434584009] [2024-11-09 15:21:23,889 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:21:23,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:23,890 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:23,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2024-11-09 15:21:23,986 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-11-09 15:21:23,986 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:23,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 15:21:23,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 261 proven. 384 refuted. 0 times theorem prover too weak. 2578 trivial. 0 not checked. [2024-11-09 15:21:24,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 259 proven. 386 refuted. 0 times theorem prover too weak. 2578 trivial. 0 not checked. [2024-11-09 15:21:24,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434584009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:24,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:24,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 27 [2024-11-09 15:21:24,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841517922] [2024-11-09 15:21:24,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:24,482 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:21:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 15:21:24,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2024-11-09 15:21:24,482 INFO L87 Difference]: Start difference. First operand 794 states and 866 transitions. cyclomatic complexity: 81 Second operand has 28 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 17 states have call successors, (22), 1 states have call predecessors, (22), 7 states have return successors, (24), 14 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-09 15:21:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:25,209 INFO L93 Difference]: Finished difference Result 825 states and 905 transitions. [2024-11-09 15:21:25,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 905 transitions. [2024-11-09 15:21:25,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-09 15:21:25,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 777 states and 838 transitions. [2024-11-09 15:21:25,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2024-11-09 15:21:25,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2024-11-09 15:21:25,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 777 states and 838 transitions. [2024-11-09 15:21:25,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:25,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 777 states and 838 transitions. [2024-11-09 15:21:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states and 838 transitions. [2024-11-09 15:21:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 748. [2024-11-09 15:21:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 530 states have (on average 1.0226415094339623) internal successors, (542), 533 states have internal predecessors, (542), 115 states have call successors, (119), 95 states have call predecessors, (119), 103 states have return successors, (139), 119 states have call predecessors, (139), 115 states have call successors, (139) [2024-11-09 15:21:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 800 transitions. [2024-11-09 15:21:25,218 INFO L240 hiAutomatonCegarLoop]: Abstraction has 748 states and 800 transitions. [2024-11-09 15:21:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 15:21:25,219 INFO L425 stractBuchiCegarLoop]: Abstraction has 748 states and 800 transitions. [2024-11-09 15:21:25,219 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-11-09 15:21:25,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 748 states and 800 transitions. [2024-11-09 15:21:25,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-09 15:21:25,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:25,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:25,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 34, 20, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 15:21:25,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [49, 49, 40, 24, 20, 20, 20, 20, 20, 20, 16, 9, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2024-11-09 15:21:25,286 INFO L745 eck$LassoCheckResult]: Stem: 341378#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 341344#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 341345#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 341338#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 341339#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 341426#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341423#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341424#$Ultimate##0 ~p := #in~p;~q := #in~q; 341427#L20 assume ~p <= 0;#res := 1; 341425#partsFINAL assume true; 341422#partsEXIT >#71#return; 341421#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341419#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341416#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341417#$Ultimate##0 ~p := #in~p;~q := #in~q; 341420#L20 assume ~p <= 0;#res := 1; 341418#partsFINAL assume true; 341415#partsEXIT >#71#return; 341414#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341413#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341407#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341400#$Ultimate##0 ~p := #in~p;~q := #in~q; 341412#L20 assume ~p <= 0;#res := 1; 341410#partsFINAL assume true; 341406#partsEXIT >#71#return; 341409#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341411#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341408#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341400#$Ultimate##0 ~p := #in~p;~q := #in~q; 341412#L20 assume ~p <= 0;#res := 1; 341410#partsFINAL assume true; 341406#partsEXIT >#71#return; 341405#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341403#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341399#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341401#$Ultimate##0 ~p := #in~p;~q := #in~q; 341404#L20 assume ~p <= 0;#res := 1; 341402#partsFINAL assume true; 341398#partsEXIT >#71#return; 341397#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341396#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 341361#L35-3 havoc main_~q~0#1; 341352#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 341353#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 341395#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341534#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341535#$Ultimate##0 ~p := #in~p;~q := #in~q; 341547#L20 assume !(~p <= 0); 341542#L21 assume ~q <= 0;#res := 0; 341539#partsFINAL assume true; 341533#partsEXIT >#71#return; 341531#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341530#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341528#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341529#$Ultimate##0 ~p := #in~p;~q := #in~q; 341568#L20 assume !(~p <= 0); 341564#L21 assume !(~q <= 0); 341559#L22 assume !(~q > ~p); 341550#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341551#$Ultimate##0 ~p := #in~p;~q := #in~q; 341555#L20 assume ~p <= 0;#res := 1; 341553#partsFINAL assume true; 341549#partsEXIT >#67#return; 341545#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341546#$Ultimate##0 ~p := #in~p;~q := #in~q; 341554#L20 assume !(~p <= 0); 341552#L21 assume ~q <= 0;#res := 0; 341548#partsFINAL assume true; 341544#partsEXIT >#69#return; 341541#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341538#partsFINAL assume true; 341527#partsEXIT >#71#return; 341526#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341521#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341514#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341429#$Ultimate##0 ~p := #in~p;~q := #in~q; 341543#L20 assume !(~p <= 0); 341540#L21 assume !(~q <= 0); 341537#L22 assume ~q > ~p; 341524#L22-1 call #t~ret0 := parts(~p, ~p);< 341525#$Ultimate##0 ~p := #in~p;~q := #in~q; 341572#L20 assume !(~p <= 0); 341571#L21 assume !(~q <= 0); 341567#L22 assume !(~q > ~p); 341562#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341563#$Ultimate##0 ~p := #in~p;~q := #in~q; 341570#L20 assume ~p <= 0;#res := 1; 341566#partsFINAL assume true; 341561#partsEXIT >#67#return; 341557#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341558#$Ultimate##0 ~p := #in~p;~q := #in~q; 341569#L20 assume !(~p <= 0); 341565#L21 assume ~q <= 0;#res := 0; 341560#partsFINAL assume true; 341556#partsEXIT >#69#return; 341536#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341532#partsFINAL assume true; 341523#partsEXIT >#65#return; 341520#L22-2 #res := #t~ret0;havoc #t~ret0; 341517#partsFINAL assume true; 341512#partsEXIT >#71#return; 341515#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341518#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341513#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341429#$Ultimate##0 ~p := #in~p;~q := #in~q; 341543#L20 assume !(~p <= 0); 341540#L21 assume !(~q <= 0); 341537#L22 assume ~q > ~p; 341524#L22-1 call #t~ret0 := parts(~p, ~p);< 341525#$Ultimate##0 ~p := #in~p;~q := #in~q; 341572#L20 assume !(~p <= 0); 341571#L21 assume !(~q <= 0); 341567#L22 assume !(~q > ~p); 341562#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341563#$Ultimate##0 ~p := #in~p;~q := #in~q; 341570#L20 assume ~p <= 0;#res := 1; 341566#partsFINAL assume true; 341561#partsEXIT >#67#return; 341557#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341558#$Ultimate##0 ~p := #in~p;~q := #in~q; 341569#L20 assume !(~p <= 0); 341565#L21 assume ~q <= 0;#res := 0; 341560#partsFINAL assume true; 341556#partsEXIT >#69#return; 341536#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341532#partsFINAL assume true; 341523#partsEXIT >#65#return; 341520#L22-2 #res := #t~ret0;havoc #t~ret0; 341517#partsFINAL assume true; 341512#partsEXIT >#71#return; 341508#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341507#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341374#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341430#$Ultimate##0 ~p := #in~p;~q := #in~q; 341435#L20 assume !(~p <= 0); 341436#L21 assume !(~q <= 0); 341431#L22 assume ~q > ~p; 341373#L22-1 call #t~ret0 := parts(~p, ~p);< 341375#$Ultimate##0 ~p := #in~p;~q := #in~q; 341592#L20 assume !(~p <= 0); 341591#L21 assume !(~q <= 0); 341588#L22 assume !(~q > ~p); 341584#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341585#$Ultimate##0 ~p := #in~p;~q := #in~q; 341590#L20 assume ~p <= 0;#res := 1; 341587#partsFINAL assume true; 341583#partsEXIT >#67#return; 341580#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341581#$Ultimate##0 ~p := #in~p;~q := #in~q; 341589#L20 assume !(~p <= 0); 341586#L21 assume ~q <= 0;#res := 0; 341582#partsFINAL assume true; 341579#partsEXIT >#69#return; 341578#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341577#partsFINAL assume true; 341576#partsEXIT >#65#return; 341575#L22-2 #res := #t~ret0;havoc #t~ret0; 341574#partsFINAL assume true; 341428#partsEXIT >#71#return; 341388#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341379#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 341380#L35-3 havoc main_~q~0#1; 341350#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 341351#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 341394#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341432#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341794#$Ultimate##0 ~p := #in~p;~q := #in~q; 341808#L20 assume !(~p <= 0); 341806#L21 assume ~q <= 0;#res := 0; 341804#partsFINAL assume true; 341793#partsEXIT >#71#return; 341789#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341782#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341778#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341779#$Ultimate##0 ~p := #in~p;~q := #in~q; 341807#L20 assume !(~p <= 0); 341805#L21 assume !(~q <= 0); 341803#L22 assume !(~q > ~p); 341801#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341802#$Ultimate##0 ~p := #in~p;~q := #in~q; 341837#L20 assume !(~p <= 0); 341834#L21 assume !(~q <= 0); 341831#L22 assume !(~q > ~p); 341818#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341819#$Ultimate##0 ~p := #in~p;~q := #in~q; 341822#L20 assume ~p <= 0;#res := 1; 341820#partsFINAL assume true; 341817#partsEXIT >#67#return; 341815#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341816#$Ultimate##0 ~p := #in~p;~q := #in~q; 341826#L20 assume !(~p <= 0); 341825#L21 assume ~q <= 0;#res := 0; 341824#partsFINAL assume true; 341814#partsEXIT >#69#return; 341812#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341811#partsFINAL assume true; 341800#partsEXIT >#67#return; 341791#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341792#$Ultimate##0 ~p := #in~p;~q := #in~q; 341798#L20 assume !(~p <= 0); 341796#L21 assume ~q <= 0;#res := 0; 341795#partsFINAL assume true; 341790#partsEXIT >#69#return; 341783#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341781#partsFINAL assume true; 341777#partsEXIT >#71#return; 341775#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341670#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341648#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341657#$Ultimate##0 ~p := #in~p;~q := #in~q; 341734#L20 assume !(~p <= 0); 341732#L21 assume !(~q <= 0); 341720#L22 assume !(~q > ~p); 341668#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341669#$Ultimate##0 ~p := #in~p;~q := #in~q; 341715#L20 assume ~p <= 0;#res := 1; 341713#partsFINAL assume true; 341667#partsEXIT >#67#return; 341663#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341666#$Ultimate##0 ~p := #in~p;~q := #in~q; 341695#L20 assume !(~p <= 0); 341693#L21 assume !(~q <= 0); 341690#L22 assume !(~q > ~p); 341686#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341687#$Ultimate##0 ~p := #in~p;~q := #in~q; 341717#L20 assume !(~p <= 0); 341716#L21 assume !(~q <= 0); 341714#L22 assume !(~q > ~p); 341711#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341712#$Ultimate##0 ~p := #in~p;~q := #in~q; 341726#L20 assume ~p <= 0;#res := 1; 341719#partsFINAL assume true; 341710#partsEXIT >#67#return; 341702#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341703#$Ultimate##0 ~p := #in~p;~q := #in~q; 341708#L20 assume !(~p <= 0); 341706#L21 assume ~q <= 0;#res := 0; 341704#partsFINAL assume true; 341701#partsEXIT >#69#return; 341700#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341698#partsFINAL assume true; 341685#partsEXIT >#67#return; 341682#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341683#$Ultimate##0 ~p := #in~p;~q := #in~q; 341694#L20 assume !(~p <= 0); 341691#L21 assume ~q <= 0;#res := 0; 341688#partsFINAL assume true; 341681#partsEXIT >#69#return; 341679#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341674#partsFINAL assume true; 341662#partsEXIT >#69#return; 341661#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341656#partsFINAL assume true; 341647#partsEXIT >#71#return; 341651#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341830#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341645#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341506#$Ultimate##0 ~p := #in~p;~q := #in~q; 341949#L20 assume !(~p <= 0); 341950#L21 assume !(~q <= 0); 341744#L22 assume ~q > ~p; 341672#L22-1 call #t~ret0 := parts(~p, ~p);< 341673#$Ultimate##0 ~p := #in~p;~q := #in~q; 341735#L20 assume !(~p <= 0); 341879#L21 assume !(~q <= 0); 341876#L22 assume !(~q > ~p); 341866#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341867#$Ultimate##0 ~p := #in~p;~q := #in~q; 341878#L20 assume ~p <= 0;#res := 1; 341875#partsFINAL assume true; 341865#partsEXIT >#67#return; 341851#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341852#$Ultimate##0 ~p := #in~p;~q := #in~q; 341898#L20 assume !(~p <= 0); 341891#L21 assume !(~q <= 0); 341887#L22 assume !(~q > ~p); 341883#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341884#$Ultimate##0 ~p := #in~p;~q := #in~q; 341913#L20 assume !(~p <= 0); 341912#L21 assume !(~q <= 0); 341911#L22 assume !(~q > ~p); 341909#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341910#$Ultimate##0 ~p := #in~p;~q := #in~q; 341916#L20 assume ~p <= 0;#res := 1; 341915#partsFINAL assume true; 341908#partsEXIT >#67#return; 341895#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341897#$Ultimate##0 ~p := #in~p;~q := #in~q; 341907#L20 assume !(~p <= 0); 341906#L21 assume ~q <= 0;#res := 0; 341900#partsFINAL assume true; 341893#partsEXIT >#69#return; 341890#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341886#partsFINAL assume true; 341882#partsEXIT >#67#return; 341871#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341872#$Ultimate##0 ~p := #in~p;~q := #in~q; 341880#L20 assume !(~p <= 0); 341877#L21 assume ~q <= 0;#res := 0; 341874#partsFINAL assume true; 341870#partsEXIT >#69#return; 341868#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341862#partsFINAL assume true; 341850#partsEXIT >#69#return; 341849#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341847#partsFINAL assume true; 341846#partsEXIT >#65#return; 341843#L22-2 #res := #t~ret0;havoc #t~ret0; 341841#partsFINAL assume true; 341829#partsEXIT >#71#return; 341642#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341643#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341383#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341437#$Ultimate##0 ~p := #in~p;~q := #in~q; 341438#L20 assume !(~p <= 0); 341433#L21 assume !(~q <= 0); 341434#L22 assume ~q > ~p; 341441#L22-1 call #t~ret0 := parts(~p, ~p);< 341498#$Ultimate##0 ~p := #in~p;~q := #in~q; 341499#L20 assume !(~p <= 0); 341605#L21 assume !(~q <= 0); 341601#L22 assume !(~q > ~p); 341598#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341599#$Ultimate##0 ~p := #in~p;~q := #in~q; 341636#L20 assume ~p <= 0;#res := 1; 341634#partsFINAL assume true; 341597#partsEXIT >#67#return; 341447#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341451#$Ultimate##0 ~p := #in~p;~q := #in~q; 341619#L20 assume !(~p <= 0); 341614#L21 assume !(~q <= 0); 341611#L22 assume !(~q > ~p); 341355#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341608#$Ultimate##0 ~p := #in~p;~q := #in~q; 341641#L20 assume !(~p <= 0); 341362#L21 assume !(~q <= 0); 341354#L22 assume !(~q > ~p); 341356#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341622#$Ultimate##0 ~p := #in~p;~q := #in~q; 341630#L20 assume ~p <= 0;#res := 1; 341628#partsFINAL assume true; 341621#partsEXIT >#67#return; 341616#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341618#$Ultimate##0 ~p := #in~p;~q := #in~q; 341625#L20 assume !(~p <= 0); 341623#L21 assume ~q <= 0;#res := 0; 341620#partsFINAL assume true; 341615#partsEXIT >#69#return; 341613#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341610#partsFINAL assume true; 341607#partsEXIT >#67#return; 341603#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341604#$Ultimate##0 ~p := #in~p;~q := #in~q; 341612#L20 assume !(~p <= 0); 341609#L21 assume ~q <= 0;#res := 0; 341606#partsFINAL assume true; 341602#partsEXIT >#69#return; 341600#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341596#partsFINAL assume true; 341446#partsEXIT >#69#return; 341445#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341444#partsFINAL assume true; 341440#partsEXIT >#65#return; 341442#L22-2 #res := #t~ret0;havoc #t~ret0; 341813#partsFINAL assume true; 341810#partsEXIT >#71#return; 341573#L36-1 [2024-11-09 15:21:25,287 INFO L747 eck$LassoCheckResult]: Loop: 341573#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341809#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 341359#L35-3 havoc main_~q~0#1; 341360#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 341799#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 341797#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341340#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341341#$Ultimate##0 ~p := #in~p;~q := #in~q; 342013#L20 assume !(~p <= 0); 342012#L21 assume ~q <= 0;#res := 0; 342010#partsFINAL assume true; 342008#partsEXIT >#71#return; 341389#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341390#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341342#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341343#$Ultimate##0 ~p := #in~p;~q := #in~q; 342032#L20 assume !(~p <= 0); 342023#L21 assume !(~q <= 0); 342020#L22 assume !(~q > ~p); 342016#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342017#$Ultimate##0 ~p := #in~p;~q := #in~q; 342041#L20 assume !(~p <= 0); 342040#L21 assume !(~q <= 0); 342038#L22 assume !(~q > ~p); 341336#L23 call #t~ret1 := parts(~p - ~q, ~q);< 342035#$Ultimate##0 ~p := #in~p;~q := #in~q; 342063#L20 assume !(~p <= 0); 342062#L21 assume !(~q <= 0); 342060#L22 assume !(~q > ~p); 341348#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341349#$Ultimate##0 ~p := #in~p;~q := #in~q; 341392#L20 assume ~p <= 0;#res := 1; 341393#partsFINAL assume true; 342065#partsEXIT >#67#return; 341334#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341337#$Ultimate##0 ~p := #in~p;~q := #in~q; 342061#L20 assume !(~p <= 0); 342059#L21 assume ~q <= 0;#res := 0; 342058#partsFINAL assume true; 342057#partsEXIT >#69#return; 342056#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342054#partsFINAL assume true; 342052#partsEXIT >#67#return; 342048#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342050#$Ultimate##0 ~p := #in~p;~q := #in~q; 342055#L20 assume !(~p <= 0); 342053#L21 assume ~q <= 0;#res := 0; 342051#partsFINAL assume true; 342047#partsEXIT >#69#return; 342046#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342044#partsFINAL assume true; 342042#partsEXIT >#67#return; 342030#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 342031#$Ultimate##0 ~p := #in~p;~q := #in~q; 342039#L20 assume !(~p <= 0); 342037#L21 assume ~q <= 0;#res := 0; 342036#partsFINAL assume true; 342029#partsEXIT >#69#return; 342022#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342018#partsFINAL assume true; 342014#partsEXIT >#71#return; 342001#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341381#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341329#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341964#$Ultimate##0 ~p := #in~p;~q := #in~q; 342064#L20 assume !(~p <= 0); 341363#L21 assume !(~q <= 0); 341357#L22 assume !(~q > ~p); 341358#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341365#$Ultimate##0 ~p := #in~p;~q := #in~q; 341367#L20 assume !(~p <= 0); 341832#L21 assume !(~q <= 0); 341827#L22 assume ~q > ~p; 341376#L22-1 call #t~ret0 := parts(~p, ~p);< 341377#$Ultimate##0 ~p := #in~p;~q := #in~q; 341889#L20 assume !(~p <= 0); 341885#L21 assume !(~q <= 0); 341881#L22 assume !(~q > ~p); 341859#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341860#$Ultimate##0 ~p := #in~p;~q := #in~q; 341864#L20 assume ~p <= 0;#res := 1; 341861#partsFINAL assume true; 341858#partsEXIT >#67#return; 341856#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341857#$Ultimate##0 ~p := #in~p;~q := #in~q; 341873#L20 assume !(~p <= 0); 341869#L21 assume ~q <= 0;#res := 0; 341863#partsFINAL assume true; 341855#partsEXIT >#69#return; 341854#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341853#partsFINAL assume true; 341848#partsEXIT >#65#return; 341385#L22-2 #res := #t~ret0;havoc #t~ret0; 341386#partsFINAL assume true; 341984#partsEXIT >#67#return; 341371#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341983#$Ultimate##0 ~p := #in~p;~q := #in~q; 341982#L20 assume !(~p <= 0); 341980#L21 assume !(~q <= 0); 341979#L22 assume !(~q > ~p); 341927#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341930#$Ultimate##0 ~p := #in~p;~q := #in~q; 341939#L20 assume !(~p <= 0); 341938#L21 assume !(~q <= 0); 341937#L22 assume !(~q > ~p); 341901#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341924#$Ultimate##0 ~p := #in~p;~q := #in~q; 341923#L20 assume !(~p <= 0); 341921#L21 assume !(~q <= 0); 341920#L22 assume !(~q > ~p); 341904#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341905#$Ultimate##0 ~p := #in~p;~q := #in~q; 341919#L20 assume ~p <= 0;#res := 1; 341914#partsFINAL assume true; 341903#partsEXIT >#67#return; 341894#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341897#$Ultimate##0 ~p := #in~p;~q := #in~q; 341907#L20 assume !(~p <= 0); 341906#L21 assume ~q <= 0;#res := 0; 341900#partsFINAL assume true; 341893#partsEXIT >#69#return; 341896#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341993#partsFINAL assume true; 341951#partsEXIT >#67#return; 341953#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341976#$Ultimate##0 ~p := #in~p;~q := #in~q; 341989#L20 assume !(~p <= 0); 341987#L21 assume ~q <= 0;#res := 0; 341985#partsFINAL assume true; 341975#partsEXIT >#69#return; 341974#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341973#partsFINAL assume true; 341972#partsEXIT >#67#return; 341785#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341956#$Ultimate##0 ~p := #in~p;~q := #in~q; 341978#L20 assume !(~p <= 0); 341977#L21 assume ~q <= 0;#res := 0; 341971#partsFINAL assume true; 341784#partsEXIT >#69#return; 341370#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341372#partsFINAL assume true; 341387#partsEXIT >#69#return; 342068#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 342069#partsFINAL assume true; 341327#partsEXIT >#71#return; 341332#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341934#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341331#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341653#$Ultimate##0 ~p := #in~p;~q := #in~q; 341958#L20 assume !(~p <= 0); 341941#L21 assume !(~q <= 0); 341942#L22 assume !(~q > ~p); 341741#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341742#$Ultimate##0 ~p := #in~p;~q := #in~q; 341754#L20 assume ~p <= 0;#res := 1; 341752#partsFINAL assume true; 341740#partsEXIT >#67#return; 341723#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341737#$Ultimate##0 ~p := #in~p;~q := #in~q; 341899#L20 assume !(~p <= 0); 341892#L21 assume !(~q <= 0); 341888#L22 assume !(~q > ~p); 341749#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341750#$Ultimate##0 ~p := #in~p;~q := #in~q; 341762#L20 assume !(~p <= 0); 341760#L21 assume !(~q <= 0); 341759#L22 assume ~q > ~p; 341757#L22-1 call #t~ret0 := parts(~p, ~p);< 341758#$Ultimate##0 ~p := #in~p;~q := #in~q; 341836#L20 assume !(~p <= 0); 341833#L21 assume !(~q <= 0); 341828#L22 assume !(~q > ~p); 341768#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341769#$Ultimate##0 ~p := #in~p;~q := #in~q; 341772#L20 assume ~p <= 0;#res := 1; 341770#partsFINAL assume true; 341767#partsEXIT >#67#return; 341765#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341766#$Ultimate##0 ~p := #in~p;~q := #in~q; 341774#L20 assume !(~p <= 0); 341773#L21 assume ~q <= 0;#res := 0; 341771#partsFINAL assume true; 341764#partsEXIT >#69#return; 341763#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341761#partsFINAL assume true; 341756#partsEXIT >#65#return; 341755#L22-2 #res := #t~ret0;havoc #t~ret0; 341753#partsFINAL assume true; 341748#partsEXIT >#67#return; 341746#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341747#$Ultimate##0 ~p := #in~p;~q := #in~q; 341933#L20 assume !(~p <= 0); 341932#L21 assume !(~q <= 0); 341931#L22 assume !(~q > ~p); 341928#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341930#$Ultimate##0 ~p := #in~p;~q := #in~q; 341939#L20 assume !(~p <= 0); 341938#L21 assume !(~q <= 0); 341937#L22 assume !(~q > ~p); 341901#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341924#$Ultimate##0 ~p := #in~p;~q := #in~q; 341923#L20 assume !(~p <= 0); 341921#L21 assume !(~q <= 0); 341920#L22 assume !(~q > ~p); 341904#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341905#$Ultimate##0 ~p := #in~p;~q := #in~q; 341919#L20 assume ~p <= 0;#res := 1; 341914#partsFINAL assume true; 341903#partsEXIT >#67#return; 341894#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341897#$Ultimate##0 ~p := #in~p;~q := #in~q; 341907#L20 assume !(~p <= 0); 341906#L21 assume ~q <= 0;#res := 0; 341900#partsFINAL assume true; 341893#partsEXIT >#69#return; 341896#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341993#partsFINAL assume true; 341951#partsEXIT >#67#return; 341953#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341976#$Ultimate##0 ~p := #in~p;~q := #in~q; 341989#L20 assume !(~p <= 0); 341987#L21 assume ~q <= 0;#res := 0; 341985#partsFINAL assume true; 341975#partsEXIT >#69#return; 341974#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341973#partsFINAL assume true; 341972#partsEXIT >#67#return; 341786#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341956#$Ultimate##0 ~p := #in~p;~q := #in~q; 341978#L20 assume !(~p <= 0); 341977#L21 assume ~q <= 0;#res := 0; 341971#partsFINAL assume true; 341784#partsEXIT >#69#return; 341780#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341776#partsFINAL assume true; 341745#partsEXIT >#69#return; 341739#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341736#partsFINAL assume true; 341721#partsEXIT >#69#return; 341724#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341845#partsFINAL assume true; 341652#partsEXIT >#71#return; 341646#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 341439#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 341328#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 341437#$Ultimate##0 ~p := #in~p;~q := #in~q; 341438#L20 assume !(~p <= 0); 341433#L21 assume !(~q <= 0); 341434#L22 assume ~q > ~p; 341441#L22-1 call #t~ret0 := parts(~p, ~p);< 341498#$Ultimate##0 ~p := #in~p;~q := #in~q; 341496#L20 assume !(~p <= 0); 341494#L21 assume !(~q <= 0); 341459#L22 assume !(~q > ~p); 341455#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341456#$Ultimate##0 ~p := #in~p;~q := #in~q; 341463#L20 assume ~p <= 0;#res := 1; 341458#partsFINAL assume true; 341454#partsEXIT >#67#return; 341449#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341452#$Ultimate##0 ~p := #in~p;~q := #in~q; 341474#L20 assume !(~p <= 0); 341470#L21 assume !(~q <= 0); 341468#L22 assume !(~q > ~p); 341465#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341466#$Ultimate##0 ~p := #in~p;~q := #in~q; 341482#L20 assume !(~p <= 0); 341478#L21 assume !(~q <= 0); 341476#L22 assume ~q > ~p; 341472#L22-1 call #t~ret0 := parts(~p, ~p);< 341473#$Ultimate##0 ~p := #in~p;~q := #in~q; 341493#L20 assume !(~p <= 0); 341492#L21 assume !(~q <= 0); 341489#L22 assume !(~q > ~p); 341485#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341486#$Ultimate##0 ~p := #in~p;~q := #in~q; 341491#L20 assume ~p <= 0;#res := 1; 341488#partsFINAL assume true; 341484#partsEXIT >#67#return; 341480#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341481#$Ultimate##0 ~p := #in~p;~q := #in~q; 341490#L20 assume !(~p <= 0); 341487#L21 assume ~q <= 0;#res := 0; 341483#partsFINAL assume true; 341479#partsEXIT >#69#return; 341477#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341475#partsFINAL assume true; 341471#partsEXIT >#65#return; 341469#L22-2 #res := #t~ret0;havoc #t~ret0; 341467#partsFINAL assume true; 341464#partsEXIT >#67#return; 341461#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341462#$Ultimate##0 ~p := #in~p;~q := #in~q; 341522#L20 assume !(~p <= 0); 341519#L21 assume !(~q <= 0); 341516#L22 assume !(~q > ~p); 341510#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341511#$Ultimate##0 ~p := #in~p;~q := #in~q; 341640#L20 assume !(~p <= 0); 341639#L21 assume !(~q <= 0); 341637#L22 assume !(~q > ~p); 341323#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341635#$Ultimate##0 ~p := #in~p;~q := #in~q; 341633#L20 assume !(~p <= 0); 341631#L21 assume !(~q <= 0); 341629#L22 assume !(~q > ~p); 341346#L23 call #t~ret1 := parts(~p - ~q, ~q);< 341347#$Ultimate##0 ~p := #in~p;~q := #in~q; 341627#L20 assume ~p <= 0;#res := 1; 341626#partsFINAL assume true; 341624#partsEXIT >#67#return; 341617#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341618#$Ultimate##0 ~p := #in~p;~q := #in~q; 341625#L20 assume !(~p <= 0); 341623#L21 assume ~q <= 0;#res := 0; 341620#partsFINAL assume true; 341615#partsEXIT >#69#return; 341368#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341369#partsFINAL assume true; 341322#partsEXIT >#67#return; 341325#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341333#$Ultimate##0 ~p := #in~p;~q := #in~q; 341364#L20 assume !(~p <= 0); 341391#L21 assume ~q <= 0;#res := 0; 341638#partsFINAL assume true; 341595#partsEXIT >#69#return; 341594#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341593#partsFINAL assume true; 341509#partsEXIT >#67#return; 341501#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 341502#$Ultimate##0 ~p := #in~p;~q := #in~q; 341505#L20 assume !(~p <= 0); 341504#L21 assume ~q <= 0;#res := 0; 341503#partsFINAL assume true; 341500#partsEXIT >#69#return; 341497#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341495#partsFINAL assume true; 341460#partsEXIT >#69#return; 341457#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341453#partsFINAL assume true; 341448#partsEXIT >#69#return; 341450#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 341823#partsFINAL assume true; 341821#partsEXIT >#65#return; 341382#L22-2 #res := #t~ret0;havoc #t~ret0; 341384#partsFINAL assume true; 341443#partsEXIT >#71#return; 341573#L36-1 [2024-11-09 15:21:25,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash -259255435, now seen corresponding path program 14 times [2024-11-09 15:21:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:25,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441400807] [2024-11-09 15:21:25,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:25,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:25,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:25,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:25,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash -193613692, now seen corresponding path program 7 times [2024-11-09 15:21:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:25,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939181784] [2024-11-09 15:21:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:25,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:25,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:25,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1544735600, now seen corresponding path program 15 times [2024-11-09 15:21:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:25,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391319827] [2024-11-09 15:21:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:25,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:25,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:28,181 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:28,182 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:28,182 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:28,182 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:28,182 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:28,182 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,182 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:28,182 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:28,182 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration28_Loop [2024-11-09 15:21:28,182 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:28,182 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:28,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:28,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:28,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:28,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:28,214 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:28,215 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:28,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:28,216 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:28,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-11-09 15:21:28,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:28,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:28,228 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:28,228 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:28,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-11-09 15:21:28,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:28,240 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:28,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-11-09 15:21:28,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:28,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:28,252 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:28,252 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:28,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-11-09 15:21:28,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:28,263 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:28,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-11-09 15:21:28,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:28,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:28,283 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:28,284 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=4, ULTIMATE.start_main_~q~0#1=4} Honda state: {ULTIMATE.start_main_~x~0#1=4, ULTIMATE.start_main_~q~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:28,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:28,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:28,295 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:28,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2024-11-09 15:21:28,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:28,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:28,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2024-11-09 15:21:28,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:28,324 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:28,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2024-11-09 15:21:28,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:28,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:28,337 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:28,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2024-11-09 15:21:28,348 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:28,348 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:28,348 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:28,348 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:28,348 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:28,348 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,348 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:28,348 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:28,348 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration28_Loop [2024-11-09 15:21:28,348 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:28,348 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:28,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:28,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:28,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:28,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:28,377 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:28,377 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:28,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:28,378 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:28,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-11-09 15:21:28,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:28,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:28,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:28,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:28,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:28,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:28,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:28,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:28,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:28,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:28,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:28,403 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:28,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-11-09 15:21:28,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:28,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:28,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:28,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:28,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:28,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:28,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:28,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:28,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:28,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:28,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:28,428 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:28,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-11-09 15:21:28,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:28,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:28,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:28,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:28,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:28,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:28,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:28,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:28,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:28,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-11-09 15:21:28,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:28,452 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:28,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-11-09 15:21:28,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:28,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:28,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:28,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:28,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:28,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:28,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:28,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:28,465 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:28,467 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:28,467 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:28,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:28,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:28,468 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:28,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-11-09 15:21:28,469 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:28,469 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:28,469 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:28,469 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 5 Supporting invariants [] [2024-11-09 15:21:28,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:28,480 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:28,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:28,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 2307 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-09 15:21:28,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:30,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 2239 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-09 15:21:30,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6377 backedges. 36 proven. 878 refuted. 0 times theorem prover too weak. 5463 trivial. 0 not checked. [2024-11-09 15:21:31,030 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2024-11-09 15:21:31,030 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 748 states and 800 transitions. cyclomatic complexity: 60 Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 15:21:31,502 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 748 states and 800 transitions. cyclomatic complexity: 60. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Result 1815 states and 1990 transitions. Complement of second has 119 states. [2024-11-09 15:21:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 2 stem states 16 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 15:21:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 103 transitions. [2024-11-09 15:21:31,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 103 transitions. Stem has 366 letters. Loop has 347 letters. [2024-11-09 15:21:31,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:31,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 103 transitions. Stem has 713 letters. Loop has 347 letters. [2024-11-09 15:21:31,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:31,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 103 transitions. Stem has 366 letters. Loop has 694 letters. [2024-11-09 15:21:31,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:31,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1815 states and 1990 transitions. [2024-11-09 15:21:31,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2024-11-09 15:21:31,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1815 states to 1617 states and 1781 transitions. [2024-11-09 15:21:31,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2024-11-09 15:21:31,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2024-11-09 15:21:31,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1617 states and 1781 transitions. [2024-11-09 15:21:31,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:31,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1617 states and 1781 transitions. [2024-11-09 15:21:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states and 1781 transitions. [2024-11-09 15:21:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1433. [2024-11-09 15:21:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1000 states have (on average 1.028) internal successors, (1028), 1014 states have internal predecessors, (1028), 232 states have call successors, (240), 175 states have call predecessors, (240), 201 states have return successors, (295), 243 states have call predecessors, (295), 232 states have call successors, (295) [2024-11-09 15:21:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1563 transitions. [2024-11-09 15:21:31,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1433 states and 1563 transitions. [2024-11-09 15:21:31,530 INFO L425 stractBuchiCegarLoop]: Abstraction has 1433 states and 1563 transitions. [2024-11-09 15:21:31,530 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-11-09 15:21:31,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1433 states and 1563 transitions. [2024-11-09 15:21:31,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2024-11-09 15:21:31,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:31,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:31,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 34, 20, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 15:21:31,534 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [67, 67, 56, 33, 28, 28, 28, 28, 28, 28, 23, 11, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1] [2024-11-09 15:21:31,535 INFO L745 eck$LassoCheckResult]: Stem: 346254#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 346211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_#t~post7#1, main_~q~0#1, main_#t~post8#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet3#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 346212#L28 assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 346205#L31 assume !(main_~y~0#1 < 0);havoc main_#t~nondet5#1;main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 346206#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 346266#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346415#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346416#$Ultimate##0 ~p := #in~p;~q := #in~q; 346418#L20 assume ~p <= 0;#res := 1; 346417#partsFINAL assume true; 346414#partsEXIT >#71#return; 346413#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346411#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346408#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346409#$Ultimate##0 ~p := #in~p;~q := #in~q; 346412#L20 assume ~p <= 0;#res := 1; 346410#partsFINAL assume true; 346407#partsEXIT >#71#return; 346406#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346405#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346399#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346395#$Ultimate##0 ~p := #in~p;~q := #in~q; 346404#L20 assume ~p <= 0;#res := 1; 346402#partsFINAL assume true; 346398#partsEXIT >#71#return; 346401#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346403#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346400#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346395#$Ultimate##0 ~p := #in~p;~q := #in~q; 346404#L20 assume ~p <= 0;#res := 1; 346402#partsFINAL assume true; 346398#partsEXIT >#71#return; 346397#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346396#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346238#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346237#$Ultimate##0 ~p := #in~p;~q := #in~q; 346239#L20 assume ~p <= 0;#res := 1; 346428#partsFINAL assume true; 346424#partsEXIT >#71#return; 346425#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346652#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 346651#L35-3 havoc main_~q~0#1; 346650#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 346649#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 346647#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346644#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346645#$Ultimate##0 ~p := #in~p;~q := #in~q; 346655#L20 assume !(~p <= 0); 346654#L21 assume ~q <= 0;#res := 0; 346653#partsFINAL assume true; 346643#partsEXIT >#71#return; 346641#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346629#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346624#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346625#$Ultimate##0 ~p := #in~p;~q := #in~q; 346671#L20 assume !(~p <= 0); 346670#L21 assume !(~q <= 0); 346668#L22 assume !(~q > ~p); 346663#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346664#$Ultimate##0 ~p := #in~p;~q := #in~q; 346669#L20 assume ~p <= 0;#res := 1; 346667#partsFINAL assume true; 346662#partsEXIT >#67#return; 346639#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346640#$Ultimate##0 ~p := #in~p;~q := #in~q; 346659#L20 assume !(~p <= 0); 346657#L21 assume ~q <= 0;#res := 0; 346656#partsFINAL assume true; 346638#partsEXIT >#69#return; 346637#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346628#partsFINAL assume true; 346623#partsEXIT >#71#return; 346620#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346616#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346610#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346565#$Ultimate##0 ~p := #in~p;~q := #in~q; 346633#L20 assume !(~p <= 0); 346627#L21 assume !(~q <= 0); 346622#L22 assume ~q > ~p; 346618#L22-1 call #t~ret0 := parts(~p, ~p);< 346619#$Ultimate##0 ~p := #in~p;~q := #in~q; 346666#L20 assume !(~p <= 0); 346665#L21 assume !(~q <= 0); 346660#L22 assume !(~q > ~p); 346635#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346636#$Ultimate##0 ~p := #in~p;~q := #in~q; 346661#L20 assume ~p <= 0;#res := 1; 346658#partsFINAL assume true; 346634#partsEXIT >#67#return; 346631#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346632#$Ultimate##0 ~p := #in~p;~q := #in~q; 346648#L20 assume !(~p <= 0); 346646#L21 assume ~q <= 0;#res := 0; 346642#partsFINAL assume true; 346630#partsEXIT >#69#return; 346626#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346621#partsFINAL assume true; 346617#partsEXIT >#65#return; 346615#L22-2 #res := #t~ret0;havoc #t~ret0; 346613#partsFINAL assume true; 346609#partsEXIT >#71#return; 346612#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346614#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346611#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346565#$Ultimate##0 ~p := #in~p;~q := #in~q; 346633#L20 assume !(~p <= 0); 346627#L21 assume !(~q <= 0); 346622#L22 assume ~q > ~p; 346618#L22-1 call #t~ret0 := parts(~p, ~p);< 346619#$Ultimate##0 ~p := #in~p;~q := #in~q; 346666#L20 assume !(~p <= 0); 346665#L21 assume !(~q <= 0); 346660#L22 assume !(~q > ~p); 346635#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346636#$Ultimate##0 ~p := #in~p;~q := #in~q; 346661#L20 assume ~p <= 0;#res := 1; 346658#partsFINAL assume true; 346634#partsEXIT >#67#return; 346631#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346632#$Ultimate##0 ~p := #in~p;~q := #in~q; 346648#L20 assume !(~p <= 0); 346646#L21 assume ~q <= 0;#res := 0; 346642#partsFINAL assume true; 346630#partsEXIT >#69#return; 346626#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346621#partsFINAL assume true; 346617#partsEXIT >#65#return; 346615#L22-2 #res := #t~ret0;havoc #t~ret0; 346613#partsFINAL assume true; 346609#partsEXIT >#71#return; 346608#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346606#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346563#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346564#$Ultimate##0 ~p := #in~p;~q := #in~q; 346580#L20 assume !(~p <= 0); 346579#L21 assume !(~q <= 0); 346578#L22 assume ~q > ~p; 346576#L22-1 call #t~ret0 := parts(~p, ~p);< 346577#$Ultimate##0 ~p := #in~p;~q := #in~q; 346683#L20 assume !(~p <= 0); 346678#L21 assume !(~q <= 0); 346674#L22 assume !(~q > ~p); 346590#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346591#$Ultimate##0 ~p := #in~p;~q := #in~q; 346598#L20 assume ~p <= 0;#res := 1; 346596#partsFINAL assume true; 346589#partsEXIT >#67#return; 346584#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346585#$Ultimate##0 ~p := #in~p;~q := #in~q; 346605#L20 assume !(~p <= 0); 346603#L21 assume ~q <= 0;#res := 0; 346600#partsFINAL assume true; 346583#partsEXIT >#69#return; 346582#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346581#partsFINAL assume true; 346575#partsEXIT >#65#return; 346573#L22-2 #res := #t~ret0;havoc #t~ret0; 346572#partsFINAL assume true; 346562#partsEXIT >#71#return; 346556#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346554#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 346551#L35-3 havoc main_~q~0#1; 346549#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 346511#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 346505#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346502#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346503#$Ultimate##0 ~p := #in~p;~q := #in~q; 346538#L20 assume !(~p <= 0); 346536#L21 assume ~q <= 0;#res := 0; 346535#partsFINAL assume true; 346501#partsEXIT >#71#return; 346490#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346489#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346478#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346479#$Ultimate##0 ~p := #in~p;~q := #in~q; 346527#L20 assume !(~p <= 0); 346525#L21 assume !(~q <= 0); 346524#L22 assume !(~q > ~p); 346522#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346523#$Ultimate##0 ~p := #in~p;~q := #in~q; 346607#L20 assume !(~p <= 0); 346604#L21 assume !(~q <= 0); 346601#L22 assume !(~q > ~p); 346533#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346534#$Ultimate##0 ~p := #in~p;~q := #in~q; 346539#L20 assume ~p <= 0;#res := 1; 346537#partsFINAL assume true; 346532#partsEXIT >#67#return; 346530#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346531#$Ultimate##0 ~p := #in~p;~q := #in~q; 346544#L20 assume !(~p <= 0); 346541#L21 assume ~q <= 0;#res := 0; 346540#partsFINAL assume true; 346529#partsEXIT >#69#return; 346528#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346526#partsFINAL assume true; 346521#partsEXIT >#67#return; 346487#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346488#$Ultimate##0 ~p := #in~p;~q := #in~q; 346499#L20 assume !(~p <= 0); 346497#L21 assume ~q <= 0;#res := 0; 346495#partsFINAL assume true; 346486#partsEXIT >#69#return; 346485#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346484#partsFINAL assume true; 346477#partsEXIT >#71#return; 346473#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346469#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346432#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346465#$Ultimate##0 ~p := #in~p;~q := #in~q; 346597#L20 assume !(~p <= 0); 346595#L21 assume !(~q <= 0); 346594#L22 assume !(~q > ~p); 346472#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346561#$Ultimate##0 ~p := #in~p;~q := #in~q; 346882#L20 assume ~p <= 0;#res := 1; 346593#partsFINAL assume true; 346560#partsEXIT >#67#return; 346543#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346553#$Ultimate##0 ~p := #in~p;~q := #in~q; 346550#L20 assume !(~p <= 0); 346548#L21 assume !(~q <= 0); 346547#L22 assume !(~q > ~p); 346514#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346515#$Ultimate##0 ~p := #in~p;~q := #in~q; 346876#L20 assume !(~p <= 0); 346875#L21 assume !(~q <= 0); 346592#L22 assume !(~q > ~p); 346587#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346588#$Ultimate##0 ~p := #in~p;~q := #in~q; 346602#L20 assume ~p <= 0;#res := 1; 346599#partsFINAL assume true; 346586#partsEXIT >#67#return; 346558#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346559#$Ultimate##0 ~p := #in~p;~q := #in~q; 346568#L20 assume !(~p <= 0); 346567#L21 assume ~q <= 0;#res := 0; 346566#partsFINAL assume true; 346557#partsEXIT >#69#return; 346555#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346552#partsFINAL assume true; 346512#partsEXIT >#67#return; 346507#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346510#$Ultimate##0 ~p := #in~p;~q := #in~q; 346546#L20 assume !(~p <= 0); 346545#L21 assume ~q <= 0;#res := 0; 346542#partsFINAL assume true; 346506#partsEXIT >#69#return; 346509#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346574#partsFINAL assume true; 346571#partsEXIT >#69#return; 346570#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346569#partsFINAL assume true; 346431#partsEXIT >#71#return; 346434#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346453#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346450#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346270#$Ultimate##0 ~p := #in~p;~q := #in~q; 346867#L20 assume !(~p <= 0); 346865#L21 assume !(~q <= 0); 346461#L22 assume ~q > ~p; 346457#L22-1 call #t~ret0 := parts(~p, ~p);< 346459#$Ultimate##0 ~p := #in~p;~q := #in~q; 346699#L20 assume !(~p <= 0); 346691#L21 assume !(~q <= 0); 346686#L22 assume !(~q > ~p); 346681#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346682#$Ultimate##0 ~p := #in~p;~q := #in~q; 346690#L20 assume ~p <= 0;#res := 1; 346685#partsFINAL assume true; 346680#partsEXIT >#67#return; 346676#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346677#$Ultimate##0 ~p := #in~p;~q := #in~q; 346737#L20 assume !(~p <= 0); 346735#L21 assume !(~q <= 0); 346705#L22 assume !(~q > ~p); 346694#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346695#$Ultimate##0 ~p := #in~p;~q := #in~q; 346738#L20 assume !(~p <= 0); 346736#L21 assume !(~q <= 0); 346734#L22 assume !(~q > ~p); 346732#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346733#$Ultimate##0 ~p := #in~p;~q := #in~q; 346741#L20 assume ~p <= 0;#res := 1; 346739#partsFINAL assume true; 346731#partsEXIT >#67#return; 346701#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346704#$Ultimate##0 ~p := #in~p;~q := #in~q; 346742#L20 assume !(~p <= 0); 346740#L21 assume ~q <= 0;#res := 0; 346707#partsFINAL assume true; 346700#partsEXIT >#69#return; 346698#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346697#partsFINAL assume true; 346693#partsEXIT >#67#return; 346688#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346689#$Ultimate##0 ~p := #in~p;~q := #in~q; 346726#L20 assume !(~p <= 0); 346696#L21 assume ~q <= 0;#res := 0; 346692#partsFINAL assume true; 346687#partsEXIT >#69#return; 346684#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346679#partsFINAL assume true; 346675#partsEXIT >#69#return; 346673#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346672#partsFINAL assume true; 346456#partsEXIT >#65#return; 346454#L22-2 #res := #t~ret0;havoc #t~ret0; 346452#partsFINAL assume true; 346449#partsEXIT >#71#return; 346448#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346447#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346249#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346271#$Ultimate##0 ~p := #in~p;~q := #in~q; 346274#L20 assume !(~p <= 0); 346273#L21 assume !(~q <= 0); 346272#L22 assume ~q > ~p; 346247#L22-1 call #t~ret0 := parts(~p, ~p);< 346250#$Ultimate##0 ~p := #in~p;~q := #in~q; 346305#L20 assume !(~p <= 0); 346303#L21 assume !(~q <= 0); 346301#L22 assume !(~q > ~p); 346288#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346289#$Ultimate##0 ~p := #in~p;~q := #in~q; 346298#L20 assume ~p <= 0;#res := 1; 346294#partsFINAL assume true; 346287#partsEXIT >#67#return; 346228#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346284#$Ultimate##0 ~p := #in~p;~q := #in~q; 346337#L20 assume !(~p <= 0); 346334#L21 assume !(~q <= 0); 346227#L22 assume !(~q > ~p); 346214#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346300#$Ultimate##0 ~p := #in~p;~q := #in~q; 346338#L20 assume !(~p <= 0); 346335#L21 assume !(~q <= 0); 346331#L22 assume !(~q > ~p); 346213#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346215#$Ultimate##0 ~p := #in~p;~q := #in~q; 346328#L20 assume ~p <= 0;#res := 1; 346326#partsFINAL assume true; 346322#partsEXIT >#67#return; 346314#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346316#$Ultimate##0 ~p := #in~p;~q := #in~q; 346333#L20 assume !(~p <= 0); 346330#L21 assume ~q <= 0;#res := 0; 346318#partsFINAL assume true; 346313#partsEXIT >#69#return; 346310#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346307#partsFINAL assume true; 346299#partsEXIT >#67#return; 346296#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346297#$Ultimate##0 ~p := #in~p;~q := #in~q; 346317#L20 assume !(~p <= 0); 346312#L21 assume ~q <= 0;#res := 0; 346309#partsFINAL assume true; 346295#partsEXIT >#69#return; 346293#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346286#partsFINAL assume true; 346280#partsEXIT >#69#return; 346279#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346278#partsFINAL assume true; 346276#partsEXIT >#65#return; 346257#L22-2 #res := #t~ret0;havoc #t~ret0; 346258#partsFINAL assume true; 346269#partsEXIT >#71#return; 346262#L36-1 [2024-11-09 15:21:31,535 INFO L747 eck$LassoCheckResult]: Loop: 346262#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346255#L35-2 assume !(main_~q~0#1 <= main_~x~0#1); 346225#L35-3 havoc main_~q~0#1; 346221#L34-2 main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 346222#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 346268#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346207#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346208#$Ultimate##0 ~p := #in~p;~q := #in~q; 346844#L20 assume !(~p <= 0); 346843#L21 assume ~q <= 0;#res := 0; 346841#partsFINAL assume true; 346781#partsEXIT >#71#return; 346777#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346773#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346770#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346771#$Ultimate##0 ~p := #in~p;~q := #in~q; 346893#L20 assume !(~p <= 0); 346890#L21 assume !(~q <= 0); 346888#L22 assume !(~q > ~p); 346800#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346801#$Ultimate##0 ~p := #in~p;~q := #in~q; 347068#L20 assume !(~p <= 0); 347067#L21 assume !(~q <= 0); 347066#L22 assume !(~q > ~p); 347057#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347061#$Ultimate##0 ~p := #in~p;~q := #in~q; 347065#L20 assume !(~p <= 0); 347064#L21 assume !(~q <= 0); 347062#L22 assume !(~q > ~p); 347058#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347061#$Ultimate##0 ~p := #in~p;~q := #in~q; 347065#L20 assume !(~p <= 0); 347064#L21 assume !(~q <= 0); 347062#L22 assume !(~q > ~p); 347063#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347119#$Ultimate##0 ~p := #in~p;~q := #in~q; 347123#L20 assume ~p <= 0;#res := 1; 347121#partsFINAL assume true; 347118#partsEXIT >#67#return; 347115#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347116#$Ultimate##0 ~p := #in~p;~q := #in~q; 347122#L20 assume !(~p <= 0); 347120#L21 assume ~q <= 0;#res := 0; 347117#partsFINAL assume true; 347114#partsEXIT >#69#return; 347113#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347111#partsFINAL assume true; 347109#partsEXIT >#67#return; 347106#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347107#$Ultimate##0 ~p := #in~p;~q := #in~q; 347112#L20 assume !(~p <= 0); 347110#L21 assume ~q <= 0;#res := 0; 347108#partsFINAL assume true; 347105#partsEXIT >#69#return; 347042#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347104#partsFINAL assume true; 347060#partsEXIT >#67#return; 347041#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347043#$Ultimate##0 ~p := #in~p;~q := #in~q; 347072#L20 assume !(~p <= 0); 347069#L21 assume ~q <= 0;#res := 0; 347056#partsFINAL assume true; 347039#partsEXIT >#69#return; 347032#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347028#partsFINAL assume true; 346799#partsEXIT >#67#return; 346797#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346798#$Ultimate##0 ~p := #in~p;~q := #in~q; 346809#L20 assume !(~p <= 0); 346807#L21 assume ~q <= 0;#res := 0; 346805#partsFINAL assume true; 346796#partsEXIT >#69#return; 346795#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346794#partsFINAL assume true; 346769#partsEXIT >#71#return; 346764#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346759#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346756#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346758#$Ultimate##0 ~p := #in~p;~q := #in~q; 346886#L20 assume !(~p <= 0); 346885#L21 assume !(~q <= 0); 346884#L22 assume !(~q > ~p); 346784#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346787#$Ultimate##0 ~p := #in~p;~q := #in~q; 346951#L20 assume !(~p <= 0); 346950#L21 assume !(~q <= 0); 346949#L22 assume ~q > ~p; 346946#L22-1 call #t~ret0 := parts(~p, ~p);< 346947#$Ultimate##0 ~p := #in~p;~q := #in~q; 346967#L20 assume !(~p <= 0); 346965#L21 assume !(~q <= 0); 346962#L22 assume !(~q > ~p); 346959#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346960#$Ultimate##0 ~p := #in~p;~q := #in~q; 347012#L20 assume ~p <= 0;#res := 1; 346980#partsFINAL assume true; 346958#partsEXIT >#67#return; 346955#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346956#$Ultimate##0 ~p := #in~p;~q := #in~q; 346964#L20 assume !(~p <= 0); 346961#L21 assume ~q <= 0;#res := 0; 346957#partsFINAL assume true; 346954#partsEXIT >#69#return; 346953#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346952#partsFINAL assume true; 346945#partsEXIT >#65#return; 346943#L22-2 #res := #t~ret0;havoc #t~ret0; 346883#partsFINAL assume true; 346782#partsEXIT >#67#return; 346779#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346780#$Ultimate##0 ~p := #in~p;~q := #in~q; 346842#L20 assume !(~p <= 0); 346840#L21 assume !(~q <= 0); 346838#L22 assume !(~q > ~p); 346826#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346827#$Ultimate##0 ~p := #in~p;~q := #in~q; 346866#L20 assume !(~p <= 0); 346864#L21 assume !(~q <= 0); 346861#L22 assume !(~q > ~p); 346709#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346723#$Ultimate##0 ~p := #in~p;~q := #in~q; 346721#L20 assume !(~p <= 0); 346718#L21 assume !(~q <= 0); 346719#L22 assume !(~q > ~p); 346708#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346723#$Ultimate##0 ~p := #in~p;~q := #in~q; 346721#L20 assume !(~p <= 0); 346718#L21 assume !(~q <= 0); 346716#L22 assume !(~q > ~p); 346711#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346712#$Ultimate##0 ~p := #in~p;~q := #in~q; 346746#L20 assume ~p <= 0;#res := 1; 346743#partsFINAL assume true; 346710#partsEXIT >#67#return; 346702#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346704#$Ultimate##0 ~p := #in~p;~q := #in~q; 346742#L20 assume !(~p <= 0); 346740#L21 assume ~q <= 0;#res := 0; 346707#partsFINAL assume true; 346700#partsEXIT >#69#return; 346703#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346868#partsFINAL assume true; 346859#partsEXIT >#67#return; 346855#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346857#$Ultimate##0 ~p := #in~p;~q := #in~q; 346871#L20 assume !(~p <= 0); 346870#L21 assume ~q <= 0;#res := 0; 346869#partsFINAL assume true; 346853#partsEXIT >#69#return; 346856#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347103#partsFINAL assume true; 347071#partsEXIT >#67#return; 347053#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347055#$Ultimate##0 ~p := #in~p;~q := #in~q; 347073#L20 assume !(~p <= 0); 347070#L21 assume ~q <= 0;#res := 0; 347059#partsFINAL assume true; 347052#partsEXIT >#69#return; 347051#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347050#partsFINAL assume true; 346823#partsEXIT >#67#return; 346819#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346821#$Ultimate##0 ~p := #in~p;~q := #in~q; 346880#L20 assume !(~p <= 0); 346878#L21 assume ~q <= 0;#res := 0; 346877#partsFINAL assume true; 346817#partsEXIT >#69#return; 346815#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346811#partsFINAL assume true; 346789#partsEXIT >#69#return; 346768#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346763#partsFINAL assume true; 346757#partsEXIT >#71#return; 346749#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346747#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346437#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346722#$Ultimate##0 ~p := #in~p;~q := #in~q; 346720#L20 assume !(~p <= 0); 346717#L21 assume !(~q <= 0); 346713#L22 assume !(~q > ~p); 346715#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346787#$Ultimate##0 ~p := #in~p;~q := #in~q; 346951#L20 assume !(~p <= 0); 346950#L21 assume !(~q <= 0); 346949#L22 assume ~q > ~p; 346946#L22-1 call #t~ret0 := parts(~p, ~p);< 346947#$Ultimate##0 ~p := #in~p;~q := #in~q; 346967#L20 assume !(~p <= 0); 346965#L21 assume !(~q <= 0); 346962#L22 assume !(~q > ~p); 346959#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346960#$Ultimate##0 ~p := #in~p;~q := #in~q; 347012#L20 assume ~p <= 0;#res := 1; 346980#partsFINAL assume true; 346958#partsEXIT >#67#return; 346955#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346956#$Ultimate##0 ~p := #in~p;~q := #in~q; 346964#L20 assume !(~p <= 0); 346961#L21 assume ~q <= 0;#res := 0; 346957#partsFINAL assume true; 346954#partsEXIT >#69#return; 346953#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346952#partsFINAL assume true; 346945#partsEXIT >#65#return; 346943#L22-2 #res := #t~ret0;havoc #t~ret0; 346883#partsFINAL assume true; 346782#partsEXIT >#67#return; 346786#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346791#$Ultimate##0 ~p := #in~p;~q := #in~q; 346948#L20 assume !(~p <= 0); 346944#L21 assume !(~q <= 0); 346942#L22 assume !(~q > ~p); 346825#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346827#$Ultimate##0 ~p := #in~p;~q := #in~q; 346866#L20 assume !(~p <= 0); 346864#L21 assume !(~q <= 0); 346861#L22 assume !(~q > ~p); 346709#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346723#$Ultimate##0 ~p := #in~p;~q := #in~q; 346721#L20 assume !(~p <= 0); 346718#L21 assume !(~q <= 0); 346719#L22 assume !(~q > ~p); 346708#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346723#$Ultimate##0 ~p := #in~p;~q := #in~q; 346721#L20 assume !(~p <= 0); 346718#L21 assume !(~q <= 0); 346716#L22 assume !(~q > ~p); 346711#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346712#$Ultimate##0 ~p := #in~p;~q := #in~q; 346746#L20 assume ~p <= 0;#res := 1; 346743#partsFINAL assume true; 346710#partsEXIT >#67#return; 346702#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346704#$Ultimate##0 ~p := #in~p;~q := #in~q; 346742#L20 assume !(~p <= 0); 346740#L21 assume ~q <= 0;#res := 0; 346707#partsFINAL assume true; 346700#partsEXIT >#69#return; 346703#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346868#partsFINAL assume true; 346859#partsEXIT >#67#return; 346855#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346857#$Ultimate##0 ~p := #in~p;~q := #in~q; 346871#L20 assume !(~p <= 0); 346870#L21 assume ~q <= 0;#res := 0; 346869#partsFINAL assume true; 346853#partsEXIT >#69#return; 346856#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347103#partsFINAL assume true; 347071#partsEXIT >#67#return; 347053#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347055#$Ultimate##0 ~p := #in~p;~q := #in~q; 347073#L20 assume !(~p <= 0); 347070#L21 assume ~q <= 0;#res := 0; 347059#partsFINAL assume true; 347052#partsEXIT >#69#return; 347051#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347050#partsFINAL assume true; 346823#partsEXIT >#67#return; 346819#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346821#$Ultimate##0 ~p := #in~p;~q := #in~q; 346880#L20 assume !(~p <= 0); 346878#L21 assume ~q <= 0;#res := 0; 346877#partsFINAL assume true; 346817#partsEXIT >#69#return; 346815#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346811#partsFINAL assume true; 346789#partsEXIT >#69#return; 346768#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346763#partsFINAL assume true; 346757#partsEXIT >#71#return; 346748#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346744#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346439#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346722#$Ultimate##0 ~p := #in~p;~q := #in~q; 346720#L20 assume !(~p <= 0); 346717#L21 assume !(~q <= 0); 346713#L22 assume !(~q > ~p); 346714#L23 call #t~ret1 := parts(~p - ~q, ~q);< 347035#$Ultimate##0 ~p := #in~p;~q := #in~q; 347037#L20 assume ~p <= 0;#res := 1; 347036#partsFINAL assume true; 347034#partsEXIT >#67#return; 346863#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 347030#$Ultimate##0 ~p := #in~p;~q := #in~q; 346940#L20 assume !(~p <= 0); 346941#L21 assume !(~q <= 0); 346926#L22 assume !(~q > ~p); 346899#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346901#$Ultimate##0 ~p := #in~p;~q := #in~q; 346914#L20 assume !(~p <= 0); 346910#L21 assume !(~q <= 0); 346908#L22 assume ~q > ~p; 346905#L22-1 call #t~ret0 := parts(~p, ~p);< 346906#$Ultimate##0 ~p := #in~p;~q := #in~q; 346920#L20 assume !(~p <= 0); 346919#L21 assume !(~q <= 0); 346918#L22 assume !(~q > ~p); 346916#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346917#$Ultimate##0 ~p := #in~p;~q := #in~q; 346922#L20 assume ~p <= 0;#res := 1; 346921#partsFINAL assume true; 346915#partsEXIT >#67#return; 346912#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346913#$Ultimate##0 ~p := #in~p;~q := #in~q; 346925#L20 assume !(~p <= 0); 346924#L21 assume ~q <= 0;#res := 0; 346923#partsFINAL assume true; 346911#partsEXIT >#69#return; 346909#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346907#partsFINAL assume true; 346904#partsEXIT >#65#return; 346903#L22-2 #res := #t~ret0;havoc #t~ret0; 346902#partsFINAL assume true; 346898#partsEXIT >#67#return; 346849#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346860#$Ultimate##0 ~p := #in~p;~q := #in~q; 346858#L20 assume !(~p <= 0); 346852#L21 assume !(~q <= 0); 346850#L22 assume !(~q > ~p); 346824#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346827#$Ultimate##0 ~p := #in~p;~q := #in~q; 346866#L20 assume !(~p <= 0); 346864#L21 assume !(~q <= 0); 346861#L22 assume !(~q > ~p); 346709#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346723#$Ultimate##0 ~p := #in~p;~q := #in~q; 346721#L20 assume !(~p <= 0); 346718#L21 assume !(~q <= 0); 346716#L22 assume !(~q > ~p); 346711#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346712#$Ultimate##0 ~p := #in~p;~q := #in~q; 346746#L20 assume ~p <= 0;#res := 1; 346743#partsFINAL assume true; 346710#partsEXIT >#67#return; 346702#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346704#$Ultimate##0 ~p := #in~p;~q := #in~q; 346742#L20 assume !(~p <= 0); 346740#L21 assume ~q <= 0;#res := 0; 346707#partsFINAL assume true; 346700#partsEXIT >#69#return; 346703#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346868#partsFINAL assume true; 346859#partsEXIT >#67#return; 346854#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346857#$Ultimate##0 ~p := #in~p;~q := #in~q; 346871#L20 assume !(~p <= 0); 346870#L21 assume ~q <= 0;#res := 0; 346869#partsFINAL assume true; 346853#partsEXIT >#69#return; 346851#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346847#partsFINAL assume true; 346834#partsEXIT >#67#return; 346836#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346892#$Ultimate##0 ~p := #in~p;~q := #in~q; 346897#L20 assume !(~p <= 0); 346895#L21 assume ~q <= 0;#res := 0; 346894#partsFINAL assume true; 346891#partsEXIT >#69#return; 346820#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347049#partsFINAL assume true; 347047#partsEXIT >#69#return; 347048#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347046#partsFINAL assume true; 347038#partsEXIT >#69#return; 347033#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 347029#partsFINAL assume true; 346436#partsEXIT >#71#return; 346440#L36-1 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 346745#L35-2 assume !!(main_~q~0#1 <= main_~x~0#1); 346438#L36 call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);< 346724#$Ultimate##0 ~p := #in~p;~q := #in~q; 346936#L20 assume !(~p <= 0); 346935#L21 assume !(~q <= 0); 346934#L22 assume ~q > ~p; 346277#L22-1 call #t~ret0 := parts(~p, ~p);< 346250#$Ultimate##0 ~p := #in~p;~q := #in~q; 346306#L20 assume !(~p <= 0); 346311#L21 assume !(~q <= 0); 346308#L22 assume !(~q > ~p); 346291#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346292#$Ultimate##0 ~p := #in~p;~q := #in~q; 346304#L20 assume ~p <= 0;#res := 1; 346302#partsFINAL assume true; 346290#partsEXIT >#67#return; 346282#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346285#$Ultimate##0 ~p := #in~p;~q := #in~q; 346360#L20 assume !(~p <= 0); 346356#L21 assume !(~q <= 0); 346354#L22 assume !(~q > ~p); 346351#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346352#$Ultimate##0 ~p := #in~p;~q := #in~q; 346368#L20 assume !(~p <= 0); 346364#L21 assume !(~q <= 0); 346362#L22 assume ~q > ~p; 346358#L22-1 call #t~ret0 := parts(~p, ~p);< 346359#$Ultimate##0 ~p := #in~p;~q := #in~q; 346377#L20 assume !(~p <= 0); 346374#L21 assume !(~q <= 0); 346373#L22 assume !(~q > ~p); 346371#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346372#$Ultimate##0 ~p := #in~p;~q := #in~q; 346379#L20 assume ~p <= 0;#res := 1; 346376#partsFINAL assume true; 346370#partsEXIT >#67#return; 346366#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346367#$Ultimate##0 ~p := #in~p;~q := #in~q; 346378#L20 assume !(~p <= 0); 346375#L21 assume ~q <= 0;#res := 0; 346369#partsFINAL assume true; 346365#partsEXIT >#69#return; 346363#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346361#partsFINAL assume true; 346357#partsEXIT >#65#return; 346355#L22-2 #res := #t~ret0;havoc #t~ret0; 346353#partsFINAL assume true; 346350#partsEXIT >#67#return; 346345#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346349#$Ultimate##0 ~p := #in~p;~q := #in~q; 346348#L20 assume !(~p <= 0); 346347#L21 assume !(~q <= 0); 346346#L22 assume !(~q > ~p); 346340#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346344#$Ultimate##0 ~p := #in~p;~q := #in~q; 346343#L20 assume !(~p <= 0); 346342#L21 assume !(~q <= 0); 346339#L22 assume !(~q > ~p); 346195#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346329#$Ultimate##0 ~p := #in~p;~q := #in~q; 346327#L20 assume !(~p <= 0); 346324#L21 assume !(~q <= 0); 346323#L22 assume !(~q > ~p); 346320#L23 call #t~ret1 := parts(~p - ~q, ~q);< 346321#$Ultimate##0 ~p := #in~p;~q := #in~q; 346336#L20 assume ~p <= 0;#res := 1; 346332#partsFINAL assume true; 346319#partsEXIT >#67#return; 346315#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346316#$Ultimate##0 ~p := #in~p;~q := #in~q; 346333#L20 assume !(~p <= 0); 346330#L21 assume ~q <= 0;#res := 0; 346318#partsFINAL assume true; 346313#partsEXIT >#69#return; 346241#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346242#partsFINAL assume true; 346193#partsEXIT >#67#return; 346196#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346203#$Ultimate##0 ~p := #in~p;~q := #in~q; 346265#L20 assume !(~p <= 0); 346233#L21 assume ~q <= 0;#res := 0; 346234#partsFINAL assume true; 346393#partsEXIT >#69#return; 346392#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346391#partsFINAL assume true; 346388#partsEXIT >#67#return; 346385#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 346386#$Ultimate##0 ~p := #in~p;~q := #in~q; 346390#L20 assume !(~p <= 0); 346389#L21 assume ~q <= 0;#res := 0; 346387#partsFINAL assume true; 346384#partsEXIT >#69#return; 346383#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346382#partsFINAL assume true; 346381#partsEXIT >#69#return; 346380#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346341#partsFINAL assume true; 346281#partsEXIT >#69#return; 346283#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 346937#partsFINAL assume true; 346933#partsEXIT >#65#return; 346931#L22-2 #res := #t~ret0;havoc #t~ret0; 346929#partsFINAL assume true; 346927#partsEXIT >#71#return; 346262#L36-1 [2024-11-09 15:21:31,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash -259255435, now seen corresponding path program 16 times [2024-11-09 15:21:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:31,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124583217] [2024-11-09 15:21:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:31,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:31,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:31,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:31,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1523428258, now seen corresponding path program 8 times [2024-11-09 15:21:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:31,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503505551] [2024-11-09 15:21:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:31,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 15:21:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:31,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:21:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:21:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 15:21:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 15:21:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:32,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:21:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 15:21:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-09 15:21:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:21:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 15:21:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-09 15:21:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:21:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-11-09 15:21:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 15:21:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 15:21:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 15:21:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 15:21:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 15:21:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12117 backedges. 202 proven. 1840 refuted. 0 times theorem prover too weak. 10075 trivial. 0 not checked. [2024-11-09 15:21:32,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:32,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503505551] [2024-11-09 15:21:32,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503505551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:32,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883339272] [2024-11-09 15:21:32,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:21:32,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:32,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:32,504 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:32,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2024-11-09 15:21:32,678 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:21:32,679 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:32,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 1182 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:21:32,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12117 backedges. 5838 proven. 463 refuted. 0 times theorem prover too weak. 5816 trivial. 0 not checked. [2024-11-09 15:21:32,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12117 backedges. 185 proven. 1875 refuted. 0 times theorem prover too weak. 10057 trivial. 0 not checked. [2024-11-09 15:21:33,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883339272] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:33,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:33,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 21] total 35 [2024-11-09 15:21:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804105286] [2024-11-09 15:21:33,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:33,731 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:21:33,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:33,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 15:21:33,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 15:21:33,732 INFO L87 Difference]: Start difference. First operand 1433 states and 1563 transitions. cyclomatic complexity: 145 Second operand has 35 states, 30 states have (on average 3.066666666666667) internal successors, (92), 29 states have internal predecessors, (92), 26 states have call successors, (34), 2 states have call predecessors, (34), 8 states have return successors, (39), 16 states have call predecessors, (39), 26 states have call successors, (39)