./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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.3.0-?-e2fb8be-m [2025-03-09 06:49:15,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:49:15,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:49:15,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:49:15,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:49:15,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:49:15,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:49:15,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:49:15,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:49:15,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:49:15,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:49:15,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:49:15,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:49:15,917 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:49:15,917 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:49:15,918 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:49:15,918 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:49:15,918 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:49:15,918 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:49:15,918 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:49:15,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:49:15,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:49:15,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:49:15,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:49:15,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:49:15,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:49:15,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:49:15,919 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:49:15,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:49:15,919 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:49:15,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:49:15,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:49:15,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:49:15,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:49:15,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:49:15,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:49:15,919 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:49:15,919 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 [2025-03-09 06:49:16,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:49:16,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:49:16,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:49:16,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:49:16,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:49:16,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Parts.c [2025-03-09 06:49:17,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc60b8f40/23d1eb9b00064fb8974d4718bd8d39cc/FLAG21789fa75 [2025-03-09 06:49:17,519 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:49:17,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2025-03-09 06:49:17,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc60b8f40/23d1eb9b00064fb8974d4718bd8d39cc/FLAG21789fa75 [2025-03-09 06:49:17,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc60b8f40/23d1eb9b00064fb8974d4718bd8d39cc [2025-03-09 06:49:17,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:49:17,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:49:17,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:17,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:49:17,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:49:17,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:17" (1/1) ... [2025-03-09 06:49:17,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6a1aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:17, skipping insertion in model container [2025-03-09 06:49:17,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:17" (1/1) ... [2025-03-09 06:49:17,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:49:17,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:18,000 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:49:18,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:18,020 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:49:18,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18 WrapperNode [2025-03-09 06:49:18,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:18,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:18,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:49:18,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:49:18,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,040 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2025-03-09 06:49:18,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:18,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:49:18,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:49:18,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:49:18,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,052 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 06:49:18,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:49:18,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:49:18,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:49:18,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:49:18,061 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (1/1) ... [2025-03-09 06:49:18,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:18,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:18,092 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) [2025-03-09 06:49:18,095 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 [2025-03-09 06:49:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2025-03-09 06:49:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2025-03-09 06:49:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:49:18,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:49:18,155 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:49:18,156 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:49:18,259 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-09 06:49:18,259 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:49:18,266 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:49:18,266 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:49:18,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:18 BoogieIcfgContainer [2025-03-09 06:49:18,267 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:49:18,267 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:49:18,267 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:49:18,272 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:49:18,273 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:18,273 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:49:17" (1/3) ... [2025-03-09 06:49:18,274 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10ea569c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:18, skipping insertion in model container [2025-03-09 06:49:18,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:18,274 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:18" (2/3) ... [2025-03-09 06:49:18,275 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10ea569c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:18, skipping insertion in model container [2025-03-09 06:49:18,275 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:18,275 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:18" (3/3) ... [2025-03-09 06:49:18,276 INFO L363 chiAutomizerObserver]: Analyzing ICFG Parts.c [2025-03-09 06:49:18,318 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:49:18,318 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:49:18,318 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:49:18,319 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:49:18,319 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:49:18,319 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:49:18,319 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:49:18,319 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:49:18,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) [2025-03-09 06:49:18,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:49:18,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:18,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:18,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:49:18,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:18,341 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:49:18,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) [2025-03-09 06:49:18,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:49:18,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:18,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:18,344 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:49:18,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:18,349 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" [2025-03-09 06:49:18,349 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2025-03-09 06:49:18,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1876795, now seen corresponding path program 1 times [2025-03-09 06:49:18,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:18,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599254751] [2025-03-09 06:49:18,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:18,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:18,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:18,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:18,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:18,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:18,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:18,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:18,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:18,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:18,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:18,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1565, now seen corresponding path program 1 times [2025-03-09 06:49:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:18,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161204935] [2025-03-09 06:49:18,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:18,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:18,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:18,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:18,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:18,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:18,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:18,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:18,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:18,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:18,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:18,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1803600599, now seen corresponding path program 1 times [2025-03-09 06:49:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:18,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595123234] [2025-03-09 06:49:18,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:18,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:49:18,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:49:18,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:18,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:18,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:18,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595123234] [2025-03-09 06:49:18,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595123234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:18,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:18,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:49:18,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904701019] [2025-03-09 06:49:18,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:18,577 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:18,577 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:18,578 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:18,578 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:18,578 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:18,578 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:18,578 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:18,578 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:18,578 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration1_Loop [2025-03-09 06:49:18,578 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:18,578 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:18,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:18,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:18,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:18,640 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:18,641 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:18,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:18,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:18,645 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) [2025-03-09 06:49:18,647 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 [2025-03-09 06:49:18,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:18,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:18,670 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 [2025-03-09 06:49:18,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:18,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:18,674 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) [2025-03-09 06:49:18,676 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 [2025-03-09 06:49:18,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:18,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:18,753 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:18,758 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 [2025-03-09 06:49:18,758 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:18,758 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:18,758 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:18,758 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:18,758 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:18,758 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:18,758 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:18,758 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:18,758 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration1_Loop [2025-03-09 06:49:18,758 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:18,758 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:18,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:18,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:18,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:18,803 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:18,808 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:18,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:18,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:18,812 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) [2025-03-09 06:49:18,813 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 [2025-03-09 06:49:18,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:18,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:18,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:18,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:18,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:18,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:18,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:18,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:18,837 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:18,843 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:49:18,845 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-09 06:49:18,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:18,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:18,848 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) [2025-03-09 06:49:18,850 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 [2025-03-09 06:49:18,851 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:18,851 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:18,852 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:18,852 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 [] [2025-03-09 06:49:18,858 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 [2025-03-09 06:49:18,862 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:18,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:18,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:18,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:18,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:18,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:18,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:18,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:18,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:18,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:18,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:18,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:18,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:18,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:18,953 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:49:18,955 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-09 06:49:18,990 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 32 states and 45 transitions. Complement of second has 5 states. [2025-03-09 06:49:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-09 06:49:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-09 06:49:19,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-09 06:49:19,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:19,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-09 06:49:19,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:19,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-09 06:49:19,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:19,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2025-03-09 06:49:19,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 06:49:19,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 34 transitions. [2025-03-09 06:49:19,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-09 06:49:19,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-09 06:49:19,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2025-03-09 06:49:19,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:19,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-09 06:49:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2025-03-09 06:49:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-09 06:49:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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) [2025-03-09 06:49:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-03-09 06:49:19,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-09 06:49:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:19,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:49:19,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:49:19,031 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2025-03-09 06:49:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:19,056 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2025-03-09 06:49:19,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2025-03-09 06:49:19,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-09 06:49:19,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 29 transitions. [2025-03-09 06:49:19,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-09 06:49:19,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-09 06:49:19,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2025-03-09 06:49:19,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:19,058 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-09 06:49:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2025-03-09 06:49:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-09 06:49:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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) [2025-03-09 06:49:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2025-03-09 06:49:19,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-09 06:49:19,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:49:19,061 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-09 06:49:19,061 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:49:19,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2025-03-09 06:49:19,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-09 06:49:19,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:19,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:19,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:49:19,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:19,063 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" [2025-03-09 06:49:19,063 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2025-03-09 06:49:19,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1876795, now seen corresponding path program 2 times [2025-03-09 06:49:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:19,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120250765] [2025-03-09 06:49:19,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:19,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:19,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:19,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:19,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:19,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:19,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:19,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:19,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1695627319, now seen corresponding path program 1 times [2025-03-09 06:49:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602373033] [2025-03-09 06:49:19,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:19,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:49:19,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:49:19,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:19,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:49:19,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:49:19,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:19,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash -534800835, now seen corresponding path program 1 times [2025-03-09 06:49:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:19,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309036332] [2025-03-09 06:49:19,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:19,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:19,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:49:19,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:49:19,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:19,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:49:19,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:49:19,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:19,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:19,238 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:19,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:19,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:19,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:19,238 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:19,238 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:19,238 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:19,238 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:19,238 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2025-03-09 06:49:19,238 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:19,238 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:19,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:19,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:19,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:19,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:19,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:19,282 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:19,282 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:19,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:19,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:19,284 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) [2025-03-09 06:49:19,286 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 [2025-03-09 06:49:19,287 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:19,287 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:19,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:19,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:19,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:19,306 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) [2025-03-09 06:49:19,309 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 [2025-03-09 06:49:19,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:19,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:19,336 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:19,340 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 [2025-03-09 06:49:19,341 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:19,341 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:19,341 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:19,341 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:19,341 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:19,341 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:19,341 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:19,341 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:19,341 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2025-03-09 06:49:19,341 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:19,341 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:19,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:19,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:19,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:19,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:19,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:19,387 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:19,387 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:19,390 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) [2025-03-09 06:49:19,392 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 [2025-03-09 06:49:19,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:19,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:19,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:19,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:19,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:19,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:19,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:19,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:19,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:19,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-09 06:49:19,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:19,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:19,413 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) [2025-03-09 06:49:19,414 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 [2025-03-09 06:49:19,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:19,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:19,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:19,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:19,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:19,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:19,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:19,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:19,427 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:19,429 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:19,429 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:19,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:19,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:19,431 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) [2025-03-09 06:49:19,433 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 [2025-03-09 06:49:19,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:19,433 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:19,434 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:19,434 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 [] [2025-03-09 06:49:19,439 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 [2025-03-09 06:49:19,441 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:19,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:19,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:19,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:19,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:19,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:19,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:19,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:49:19,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:49:19,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:19,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:19,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:19,552 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 [2025-03-09 06:49:19,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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) [2025-03-09 06:49:19,766 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 151 states and 240 transitions. Complement of second has 34 states. [2025-03-09 06:49:19,767 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 [2025-03-09 06:49:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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) [2025-03-09 06:49:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-03-09 06:49:19,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 4 letters. Loop has 9 letters. [2025-03-09 06:49:19,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:19,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 13 letters. Loop has 9 letters. [2025-03-09 06:49:19,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:19,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 4 letters. Loop has 18 letters. [2025-03-09 06:49:19,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:19,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 240 transitions. [2025-03-09 06:49:19,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-09 06:49:19,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 240 transitions. [2025-03-09 06:49:19,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-03-09 06:49:19,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2025-03-09 06:49:19,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 240 transitions. [2025-03-09 06:49:19,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:19,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 240 transitions. [2025-03-09 06:49:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 240 transitions. [2025-03-09 06:49:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2025-03-09 06:49:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 81 states have internal predecessors, (115), 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) [2025-03-09 06:49:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 191 transitions. [2025-03-09 06:49:19,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 191 transitions. [2025-03-09 06:49:19,802 INFO L432 stractBuchiCegarLoop]: Abstraction has 126 states and 191 transitions. [2025-03-09 06:49:19,802 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:49:19,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 191 transitions. [2025-03-09 06:49:19,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-09 06:49:19,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:19,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:19,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:19,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:19,805 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-03-09 06:49:19,805 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-03-09 06:49:19,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash 58180664, now seen corresponding path program 1 times [2025-03-09 06:49:19,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:19,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759727981] [2025-03-09 06:49:19,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:19,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:19,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:19,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:19,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:19,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:19,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:19,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:19,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:19,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash -493408852, now seen corresponding path program 1 times [2025-03-09 06:49:19,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:19,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747640492] [2025-03-09 06:49:19,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:19,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:19,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:19,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:19,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:19,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:19,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:19,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747640492] [2025-03-09 06:49:19,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747640492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:49:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530984530] [2025-03-09 06:49:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:19,947 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:19,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:49:19,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:49:19,948 INFO L87 Difference]: Start difference. First operand 126 states and 191 transitions. cyclomatic complexity: 70 Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2025-03-09 06:49:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:20,139 INFO L93 Difference]: Finished difference Result 229 states and 436 transitions. [2025-03-09 06:49:20,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 436 transitions. [2025-03-09 06:49:20,144 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-03-09 06:49:20,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 226 states and 433 transitions. [2025-03-09 06:49:20,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-03-09 06:49:20,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-03-09 06:49:20,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 433 transitions. [2025-03-09 06:49:20,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:20,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 226 states and 433 transitions. [2025-03-09 06:49:20,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 433 transitions. [2025-03-09 06:49:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 167. [2025-03-09 06:49:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 102 states have internal predecessors, (139), 35 states have call successors, (35), 8 states have call predecessors, (35), 22 states have return successors, (106), 56 states have call predecessors, (106), 35 states have call successors, (106) [2025-03-09 06:49:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 280 transitions. [2025-03-09 06:49:20,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 280 transitions. [2025-03-09 06:49:20,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:49:20,164 INFO L432 stractBuchiCegarLoop]: Abstraction has 167 states and 280 transitions. [2025-03-09 06:49:20,164 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:49:20,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 280 transitions. [2025-03-09 06:49:20,188 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2025-03-09 06:49:20,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:20,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:20,188 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:20,188 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:20,188 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-03-09 06:49:20,188 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2025-03-09 06:49:20,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash 58180664, now seen corresponding path program 2 times [2025-03-09 06:49:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:20,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95806922] [2025-03-09 06:49:20,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:20,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:20,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:20,194 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 [2025-03-09 06:49:20,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:20,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:20,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:20,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:20,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:20,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:20,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash 75464136, now seen corresponding path program 1 times [2025-03-09 06:49:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:20,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735554476] [2025-03-09 06:49:20,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:20,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:20,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:20,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:20,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:20,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:20,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:20,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:20,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash -525919489, now seen corresponding path program 1 times [2025-03-09 06:49:20,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:20,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204955810] [2025-03-09 06:49:20,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:20,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:20,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:49:20,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:49:20,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:20,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:20,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204955810] [2025-03-09 06:49:20,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204955810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:20,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:20,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:49:20,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361650188] [2025-03-09 06:49:20,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:20,318 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:20,318 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:20,318 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:20,318 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:20,318 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:20,318 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,318 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:20,318 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:20,318 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration4_Loop [2025-03-09 06:49:20,318 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:20,318 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:20,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,345 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:20,345 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:20,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,347 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) [2025-03-09 06:49:20,348 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 [2025-03-09 06:49:20,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:20,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:20,360 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:20,360 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: [] [2025-03-09 06:49:20,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:49:20,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,367 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) [2025-03-09 06:49:20,368 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 [2025-03-09 06:49:20,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:20,368 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:20,384 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 [2025-03-09 06:49:20,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,386 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) [2025-03-09 06:49:20,387 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 [2025-03-09 06:49:20,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:20,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:20,410 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:20,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:49:20,414 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:20,414 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:20,414 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:20,414 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:20,414 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:20,414 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,414 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:20,414 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:20,414 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration4_Loop [2025-03-09 06:49:20,414 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:20,414 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:20,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:20,439 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:20,439 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:20,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,441 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) [2025-03-09 06:49:20,442 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 [2025-03-09 06:49:20,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:20,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:20,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:20,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:20,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:20,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:20,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:20,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:20,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:20,459 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:20,459 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:20,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:20,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:20,461 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) [2025-03-09 06:49:20,462 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 [2025-03-09 06:49:20,471 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:20,471 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:20,471 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:20,471 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 [] [2025-03-09 06:49:20,477 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 [2025-03-09 06:49:20,477 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:20,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:20,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:20,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:20,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:20,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:20,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:20,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:20,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:20,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:20,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:20,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:20,566 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 [2025-03-09 06:49:20,566 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 167 states and 280 transitions. cyclomatic complexity: 118 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) [2025-03-09 06:49:20,735 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 167 states and 280 transitions. cyclomatic complexity: 118. 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 958 states and 1806 transitions. Complement of second has 39 states. [2025-03-09 06:49:20,736 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 [2025-03-09 06:49:20,737 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) [2025-03-09 06:49:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2025-03-09 06:49:20,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 5 letters. Loop has 8 letters. [2025-03-09 06:49:20,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:20,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 13 letters. Loop has 8 letters. [2025-03-09 06:49:20,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:20,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 5 letters. Loop has 16 letters. [2025-03-09 06:49:20,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:20,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 958 states and 1806 transitions. [2025-03-09 06:49:20,752 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 47 [2025-03-09 06:49:20,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 958 states to 838 states and 1552 transitions. [2025-03-09 06:49:20,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2025-03-09 06:49:20,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2025-03-09 06:49:20,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 838 states and 1552 transitions. [2025-03-09 06:49:20,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:20,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 838 states and 1552 transitions. [2025-03-09 06:49:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states and 1552 transitions. [2025-03-09 06:49:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 675. [2025-03-09 06:49:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 433 states have (on average 1.2678983833718245) internal successors, (549), 406 states have internal predecessors, (549), 156 states have call successors, (156), 39 states have call predecessors, (156), 86 states have return successors, (427), 229 states have call predecessors, (427), 152 states have call successors, (427) [2025-03-09 06:49:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1132 transitions. [2025-03-09 06:49:20,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 675 states and 1132 transitions. [2025-03-09 06:49:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:20,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:49:20,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:49:20,822 INFO L87 Difference]: Start difference. First operand 675 states and 1132 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) [2025-03-09 06:49:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:20,877 INFO L93 Difference]: Finished difference Result 736 states and 1284 transitions. [2025-03-09 06:49:20,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 736 states and 1284 transitions. [2025-03-09 06:49:20,885 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 44 [2025-03-09 06:49:20,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 736 states to 311 states and 534 transitions. [2025-03-09 06:49:20,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2025-03-09 06:49:20,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2025-03-09 06:49:20,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 534 transitions. [2025-03-09 06:49:20,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:20,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 311 states and 534 transitions. [2025-03-09 06:49:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 534 transitions. [2025-03-09 06:49:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 255. [2025-03-09 06:49:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 163 states have (on average 1.2760736196319018) internal successors, (208), 159 states have internal predecessors, (208), 61 states have call successors, (61), 16 states have call predecessors, (61), 31 states have return successors, (136), 79 states have call predecessors, (136), 55 states have call successors, (136) [2025-03-09 06:49:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 405 transitions. [2025-03-09 06:49:20,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 255 states and 405 transitions. [2025-03-09 06:49:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:49:20,903 INFO L432 stractBuchiCegarLoop]: Abstraction has 255 states and 405 transitions. [2025-03-09 06:49:20,903 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:49:20,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 405 transitions. [2025-03-09 06:49:20,905 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 44 [2025-03-09 06:49:20,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:20,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:20,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:20,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:20,905 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" [2025-03-09 06:49:20,905 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" [2025-03-09 06:49:20,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:20,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1188268990, now seen corresponding path program 1 times [2025-03-09 06:49:20,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:20,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783989551] [2025-03-09 06:49:20,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:20,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:20,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:49:20,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:49:20,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:20,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:49:20,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:49:20,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:20,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash -685329803, now seen corresponding path program 1 times [2025-03-09 06:49:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:20,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970614706] [2025-03-09 06:49:20,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:20,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:20,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:20,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:20,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:20,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:20,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:20,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:20,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:20,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1047599080, now seen corresponding path program 1 times [2025-03-09 06:49:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765203216] [2025-03-09 06:49:20,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:20,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:49:20,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:49:20,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,947 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:20,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:49:20,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:49:20,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:20,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:20,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:20,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:21,009 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:21,009 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:21,009 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:21,009 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:21,009 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:21,009 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,009 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:21,010 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:21,010 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2025-03-09 06:49:21,010 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:21,010 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:21,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,030 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:21,030 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:21,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,033 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) [2025-03-09 06:49:21,034 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 [2025-03-09 06:49:21,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:21,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:21,047 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:21,047 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: [] [2025-03-09 06:49:21,053 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 [2025-03-09 06:49:21,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,056 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) [2025-03-09 06:49:21,057 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 [2025-03-09 06:49:21,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:21,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:21,076 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:21,076 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=0} Honda state: {ULTIMATE.start_main_~p~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:21,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-09 06:49:21,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,088 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) [2025-03-09 06:49:21,088 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 [2025-03-09 06:49:21,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:21,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:21,107 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 [2025-03-09 06:49:21,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,109 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) [2025-03-09 06:49:21,110 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 [2025-03-09 06:49:21,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:21,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:21,200 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:21,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 06:49:21,205 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:21,205 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:21,205 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:21,205 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:21,205 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:21,205 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,205 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:21,205 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:21,205 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2025-03-09 06:49:21,205 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:21,205 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:21,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,230 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:21,230 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:21,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,232 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) [2025-03-09 06:49:21,233 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 [2025-03-09 06:49:21,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:21,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:21,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:21,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:21,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:21,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:21,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:21,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:21,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:21,251 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 [2025-03-09 06:49:21,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,253 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) [2025-03-09 06:49:21,253 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 [2025-03-09 06:49:21,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:21,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:21,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:21,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:21,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:21,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:21,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:21,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:21,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:21,271 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 [2025-03-09 06:49:21,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,272 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) [2025-03-09 06:49:21,274 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 [2025-03-09 06:49:21,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:21,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:21,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:21,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:21,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:21,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:21,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:21,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:21,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:21,289 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:49:21,289 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:49:21,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,291 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) [2025-03-09 06:49:21,292 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 [2025-03-09 06:49:21,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:21,292 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:21,292 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:21,293 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 [] [2025-03-09 06:49:21,298 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 [2025-03-09 06:49:21,299 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:21,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:21,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:49:21,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:49:21,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:21,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:21,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:21,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:21,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:21,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:21,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:21,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:21,398 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 [2025-03-09 06:49:21,399 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 255 states and 405 transitions. cyclomatic complexity: 158 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) [2025-03-09 06:49:21,467 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 255 states and 405 transitions. cyclomatic complexity: 158. 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 387 states and 597 transitions. Complement of second has 13 states. [2025-03-09 06:49:21,467 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 [2025-03-09 06:49:21,468 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) [2025-03-09 06:49:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2025-03-09 06:49:21,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 7 letters. [2025-03-09 06:49:21,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:21,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 18 letters. Loop has 7 letters. [2025-03-09 06:49:21,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:21,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 14 letters. [2025-03-09 06:49:21,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:21,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 597 transitions. [2025-03-09 06:49:21,474 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2025-03-09 06:49:21,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 315 states and 490 transitions. [2025-03-09 06:49:21,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2025-03-09 06:49:21,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2025-03-09 06:49:21,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 490 transitions. [2025-03-09 06:49:21,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:21,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 315 states and 490 transitions. [2025-03-09 06:49:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 490 transitions. [2025-03-09 06:49:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2025-03-09 06:49:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 200 states have (on average 1.265) internal successors, (253), 195 states have internal predecessors, (253), 77 states have call successors, (79), 22 states have call predecessors, (79), 37 states have return successors, (157), 96 states have call predecessors, (157), 68 states have call successors, (157) [2025-03-09 06:49:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 489 transitions. [2025-03-09 06:49:21,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 314 states and 489 transitions. [2025-03-09 06:49:21,492 INFO L432 stractBuchiCegarLoop]: Abstraction has 314 states and 489 transitions. [2025-03-09 06:49:21,492 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:49:21,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 489 transitions. [2025-03-09 06:49:21,494 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2025-03-09 06:49:21,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:21,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:21,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:21,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:21,495 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< [2025-03-09 06:49:21,495 INFO L754 eck$LassoCheckResult]: Loop: "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< [2025-03-09 06:49:21,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1818072937, now seen corresponding path program 1 times [2025-03-09 06:49:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:21,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797641367] [2025-03-09 06:49:21,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:21,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:49:21,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:49:21,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:21,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:21,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797641367] [2025-03-09 06:49:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797641367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:21,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:21,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:49:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792491177] [2025-03-09 06:49:21,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:21,537 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:21,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash 39094691, now seen corresponding path program 1 times [2025-03-09 06:49:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:21,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957422558] [2025-03-09 06:49:21,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:21,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:21,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:21,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:21,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:21,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:21,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:21,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:21,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:21,594 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:21,594 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:21,594 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:21,594 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:21,594 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:21,594 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,594 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:21,594 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:21,594 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2025-03-09 06:49:21,594 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:21,594 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:21,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,637 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:21,637 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:21,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,640 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) [2025-03-09 06:49:21,640 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 [2025-03-09 06:49:21,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:21,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:21,651 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:21,652 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:21,657 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 [2025-03-09 06:49:21,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,659 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) [2025-03-09 06:49:21,659 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 [2025-03-09 06:49:21,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:21,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:21,684 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 [2025-03-09 06:49:21,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,686 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) [2025-03-09 06:49:21,686 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 [2025-03-09 06:49:21,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:21,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:21,829 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:21,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 06:49:21,835 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:21,835 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:21,835 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:21,835 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:21,835 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:21,835 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,835 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:21,835 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:21,835 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2025-03-09 06:49:21,836 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:21,836 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:21,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:21,872 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:21,872 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:21,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,874 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) [2025-03-09 06:49:21,875 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 [2025-03-09 06:49:21,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:21,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:21,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:21,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:21,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:21,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:21,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:21,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:21,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:21,893 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 [2025-03-09 06:49:21,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,895 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) [2025-03-09 06:49:21,896 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 [2025-03-09 06:49:21,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:21,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:21,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:21,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:21,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:21,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:21,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:21,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:21,910 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:21,912 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:21,912 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:49:21,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:21,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:21,914 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) [2025-03-09 06:49:21,916 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 [2025-03-09 06:49:21,917 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:21,917 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:21,917 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:21,917 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-03-09 06:49:21,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 06:49:21,923 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:21,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:21,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:49:21,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:49:21,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:21,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:21,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:21,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:21,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:21,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:21,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:21,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:21,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:22,005 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 [2025-03-09 06:49:22,005 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 489 transitions. cyclomatic complexity: 184 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) [2025-03-09 06:49:22,121 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 [2025-03-09 06:49:22,123 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 489 transitions. cyclomatic complexity: 184. 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 1007 states and 2044 transitions. Complement of second has 45 states. [2025-03-09 06:49:22,124 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 [2025-03-09 06:49:22,124 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) [2025-03-09 06:49:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2025-03-09 06:49:22,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 12 letters. Loop has 5 letters. [2025-03-09 06:49:22,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:22,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 17 letters. Loop has 5 letters. [2025-03-09 06:49:22,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:22,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 12 letters. Loop has 10 letters. [2025-03-09 06:49:22,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:22,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1007 states and 2044 transitions. [2025-03-09 06:49:22,135 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 [2025-03-09 06:49:22,143 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 165 [2025-03-09 06:49:22,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1007 states to 912 states and 1870 transitions. [2025-03-09 06:49:22,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2025-03-09 06:49:22,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 501 [2025-03-09 06:49:22,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 912 states and 1870 transitions. [2025-03-09 06:49:22,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:22,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 912 states and 1870 transitions. [2025-03-09 06:49:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states and 1870 transitions. [2025-03-09 06:49:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 810. [2025-03-09 06:49:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 494 states have (on average 1.3218623481781377) internal successors, (653), 539 states have internal predecessors, (653), 216 states have call successors, (218), 67 states have call predecessors, (218), 100 states have return successors, (670), 203 states have call predecessors, (670), 191 states have call successors, (670) [2025-03-09 06:49:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1541 transitions. [2025-03-09 06:49:22,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 810 states and 1541 transitions. [2025-03-09 06:49:22,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:22,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:49:22,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:49:22,192 INFO L87 Difference]: Start difference. First operand 810 states and 1541 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) [2025-03-09 06:49:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:22,220 INFO L93 Difference]: Finished difference Result 716 states and 1339 transitions. [2025-03-09 06:49:22,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 716 states and 1339 transitions. [2025-03-09 06:49:22,228 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 104 [2025-03-09 06:49:22,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 716 states to 715 states and 1338 transitions. [2025-03-09 06:49:22,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2025-03-09 06:49:22,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2025-03-09 06:49:22,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 715 states and 1338 transitions. [2025-03-09 06:49:22,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:22,238 INFO L218 hiAutomatonCegarLoop]: Abstraction has 715 states and 1338 transitions. [2025-03-09 06:49:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states and 1338 transitions. [2025-03-09 06:49:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 707. [2025-03-09 06:49:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 440 states have (on average 1.3) internal successors, (572), 480 states have internal predecessors, (572), 174 states have call successors, (176), 58 states have call predecessors, (176), 93 states have return successors, (582), 168 states have call predecessors, (582), 156 states have call successors, (582) [2025-03-09 06:49:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1330 transitions. [2025-03-09 06:49:22,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 707 states and 1330 transitions. [2025-03-09 06:49:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:49:22,262 INFO L432 stractBuchiCegarLoop]: Abstraction has 707 states and 1330 transitions. [2025-03-09 06:49:22,262 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:49:22,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 707 states and 1330 transitions. [2025-03-09 06:49:22,266 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 102 [2025-03-09 06:49:22,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:22,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:22,267 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:22,267 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:22,267 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-03-09 06:49:22,267 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-03-09 06:49:22,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:22,268 INFO L85 PathProgramCache]: Analyzing trace with hash 601043318, now seen corresponding path program 2 times [2025-03-09 06:49:22,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:22,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586125201] [2025-03-09 06:49:22,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:22,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:22,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:49:22,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:49:22,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:22,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:22,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586125201] [2025-03-09 06:49:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586125201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254801558] [2025-03-09 06:49:22,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:22,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:22,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:22,320 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) [2025-03-09 06:49:22,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-09 06:49:22,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:49:22,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:49:22,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:22,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:22,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:22,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:22,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:22,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254801558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:22,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:22,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-09 06:49:22,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370927575] [2025-03-09 06:49:22,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:22,412 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:22,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:22,413 INFO L85 PathProgramCache]: Analyzing trace with hash -313480764, now seen corresponding path program 1 times [2025-03-09 06:49:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:22,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059108462] [2025-03-09 06:49:22,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:22,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:49:22,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:49:22,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:22,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:49:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059108462] [2025-03-09 06:49:22,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059108462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321952625] [2025-03-09 06:49:22,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:22,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:22,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:22,557 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) [2025-03-09 06:49:22,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-09 06:49:22,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:49:22,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:49:22,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:22,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:22,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:49:22,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:49:22,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:49:22,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321952625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:22,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:22,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 06:49:22,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091995134] [2025-03-09 06:49:22,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:22,800 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:22,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:22,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:49:22,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:49:22,800 INFO L87 Difference]: Start difference. First operand 707 states and 1330 transitions. cyclomatic complexity: 643 Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 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) [2025-03-09 06:49:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:22,830 INFO L93 Difference]: Finished difference Result 755 states and 1413 transitions. [2025-03-09 06:49:22,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 1413 transitions. [2025-03-09 06:49:22,839 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 112 [2025-03-09 06:49:22,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 752 states and 1409 transitions. [2025-03-09 06:49:22,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2025-03-09 06:49:22,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 388 [2025-03-09 06:49:22,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 752 states and 1409 transitions. [2025-03-09 06:49:22,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:22,848 INFO L218 hiAutomatonCegarLoop]: Abstraction has 752 states and 1409 transitions. [2025-03-09 06:49:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states and 1409 transitions. [2025-03-09 06:49:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 706. [2025-03-09 06:49:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 439 states have (on average 1.2984054669703873) internal successors, (570), 480 states have internal predecessors, (570), 174 states have call successors, (176), 58 states have call predecessors, (176), 93 states have return successors, (582), 167 states have call predecessors, (582), 156 states have call successors, (582) [2025-03-09 06:49:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1328 transitions. [2025-03-09 06:49:22,870 INFO L240 hiAutomatonCegarLoop]: Abstraction has 706 states and 1328 transitions. [2025-03-09 06:49:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:49:22,872 INFO L432 stractBuchiCegarLoop]: Abstraction has 706 states and 1328 transitions. [2025-03-09 06:49:22,872 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:49:22,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 706 states and 1328 transitions. [2025-03-09 06:49:22,875 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 102 [2025-03-09 06:49:22,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:22,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:22,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:49:22,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:22,877 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-03-09 06:49:22,877 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-03-09 06:49:22,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:22,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1791803684, now seen corresponding path program 3 times [2025-03-09 06:49:22,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:22,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211492491] [2025-03-09 06:49:22,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:22,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:22,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-09 06:49:22,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:49:22,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:49:22,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:22,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:22,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:49:22,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:49:22,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:22,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:22,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:22,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:22,890 INFO L85 PathProgramCache]: Analyzing trace with hash -313480764, now seen corresponding path program 2 times [2025-03-09 06:49:22,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:22,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757605177] [2025-03-09 06:49:22,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:22,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:22,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-09 06:49:22,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:49:22,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:22,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:49:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757605177] [2025-03-09 06:49:22,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757605177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370260093] [2025-03-09 06:49:22,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:22,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:22,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:22,980 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) [2025-03-09 06:49:22,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-09 06:49:23,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-09 06:49:23,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:49:23,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:23,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:23,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:49:23,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:49:23,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:49:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370260093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:23,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:23,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 06:49:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411751912] [2025-03-09 06:49:23,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:23,203 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:23,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 06:49:23,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-09 06:49:23,203 INFO L87 Difference]: Start difference. First operand 706 states and 1328 transitions. cyclomatic complexity: 642 Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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) [2025-03-09 06:49:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:23,451 INFO L93 Difference]: Finished difference Result 1107 states and 2858 transitions. [2025-03-09 06:49:23,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1107 states and 2858 transitions. [2025-03-09 06:49:23,465 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 181 [2025-03-09 06:49:23,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1107 states to 1090 states and 2809 transitions. [2025-03-09 06:49:23,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 602 [2025-03-09 06:49:23,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2025-03-09 06:49:23,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1090 states and 2809 transitions. [2025-03-09 06:49:23,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:23,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1090 states and 2809 transitions. [2025-03-09 06:49:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states and 2809 transitions. [2025-03-09 06:49:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 749. [2025-03-09 06:49:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 461 states have (on average 1.2819956616052062) internal successors, (591), 522 states have internal predecessors, (591), 180 states have call successors, (182), 58 states have call predecessors, (182), 108 states have return successors, (792), 168 states have call predecessors, (792), 162 states have call successors, (792) [2025-03-09 06:49:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1565 transitions. [2025-03-09 06:49:23,545 INFO L240 hiAutomatonCegarLoop]: Abstraction has 749 states and 1565 transitions. [2025-03-09 06:49:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:49:23,546 INFO L432 stractBuchiCegarLoop]: Abstraction has 749 states and 1565 transitions. [2025-03-09 06:49:23,546 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:49:23,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 749 states and 1565 transitions. [2025-03-09 06:49:23,549 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2025-03-09 06:49:23,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:23,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:23,550 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:49:23,550 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2025-03-09 06:49:23,550 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-03-09 06:49:23,550 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" [2025-03-09 06:49:23,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1791803684, now seen corresponding path program 4 times [2025-03-09 06:49:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864018893] [2025-03-09 06:49:23,551 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:23,553 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-09 06:49:23,555 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:49:23,555 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:23,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:23,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:23,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:49:23,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:49:23,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:23,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:23,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:23,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:23,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1663446188, now seen corresponding path program 3 times [2025-03-09 06:49:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:23,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876699316] [2025-03-09 06:49:23,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:23,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:23,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-09 06:49:23,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 52 statements. [2025-03-09 06:49:23,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:49:23,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-09 06:49:23,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876699316] [2025-03-09 06:49:23,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876699316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927141567] [2025-03-09 06:49:23,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:23,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:23,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:23,646 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) [2025-03-09 06:49:23,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-09 06:49:23,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-09 06:49:23,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 52 statements. [2025-03-09 06:49:23,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:49:23,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:23,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:49:23,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-09 06:49:23,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-09 06:49:24,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927141567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:24,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:24,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2025-03-09 06:49:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761718296] [2025-03-09 06:49:24,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:24,053 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:24,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 06:49:24,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-09 06:49:24,054 INFO L87 Difference]: Start difference. First operand 749 states and 1565 transitions. cyclomatic complexity: 836 Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-09 06:49:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:24,420 INFO L93 Difference]: Finished difference Result 1355 states and 2923 transitions. [2025-03-09 06:49:24,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1355 states and 2923 transitions. [2025-03-09 06:49:24,435 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 160 [2025-03-09 06:49:24,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1355 states to 1279 states and 2785 transitions. [2025-03-09 06:49:24,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2025-03-09 06:49:24,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 675 [2025-03-09 06:49:24,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 2785 transitions. [2025-03-09 06:49:24,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:24,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1279 states and 2785 transitions. [2025-03-09 06:49:24,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 2785 transitions. [2025-03-09 06:49:24,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 996. [2025-03-09 06:49:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 630 states have (on average 1.2095238095238094) internal successors, (762), 693 states have internal predecessors, (762), 201 states have call successors, (203), 81 states have call predecessors, (203), 165 states have return successors, (1147), 221 states have call predecessors, (1147), 195 states have call successors, (1147) [2025-03-09 06:49:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 2112 transitions. [2025-03-09 06:49:24,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 996 states and 2112 transitions. [2025-03-09 06:49:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:49:24,505 INFO L432 stractBuchiCegarLoop]: Abstraction has 996 states and 2112 transitions. [2025-03-09 06:49:24,505 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 06:49:24,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 996 states and 2112 transitions. [2025-03-09 06:49:24,511 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 110 [2025-03-09 06:49:24,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:24,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:24,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:24,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:24,512 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< [2025-03-09 06:49:24,512 INFO L754 eck$LassoCheckResult]: Loop: "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< [2025-03-09 06:49:24,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1956724682, now seen corresponding path program 1 times [2025-03-09 06:49:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:24,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889995968] [2025-03-09 06:49:24,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:24,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:49:24,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:49:24,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:24,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:49:24,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:24,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889995968] [2025-03-09 06:49:24,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889995968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:24,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:24,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:49:24,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671888792] [2025-03-09 06:49:24,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:24,559 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:24,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:24,559 INFO L85 PathProgramCache]: Analyzing trace with hash 39094726, now seen corresponding path program 1 times [2025-03-09 06:49:24,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:24,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982811279] [2025-03-09 06:49:24,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:24,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:24,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:24,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:24,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:24,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:24,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:24,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:24,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:24,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:24,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:24,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:24,609 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:24,610 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:24,610 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:24,610 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:24,610 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:24,610 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,610 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:24,610 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:24,610 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration10_Loop [2025-03-09 06:49:24,610 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:24,610 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:24,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,649 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:24,649 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:24,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,651 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) [2025-03-09 06:49:24,652 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 [2025-03-09 06:49:24,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:24,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:24,664 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:24,664 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:24,669 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 [2025-03-09 06:49:24,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,671 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) [2025-03-09 06:49:24,672 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 [2025-03-09 06:49:24,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:24,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:24,684 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:24,684 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:24,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-09 06:49:24,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,691 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) [2025-03-09 06:49:24,692 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 [2025-03-09 06:49:24,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:24,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:24,704 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:24,704 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:24,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-09 06:49:24,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,711 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) [2025-03-09 06:49:24,712 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 [2025-03-09 06:49:24,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:24,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:24,723 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:24,723 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:24,728 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 [2025-03-09 06:49:24,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,731 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) [2025-03-09 06:49:24,731 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 [2025-03-09 06:49:24,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:24,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:24,742 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:24,742 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:24,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-09 06:49:24,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,751 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) [2025-03-09 06:49:24,751 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 [2025-03-09 06:49:24,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:24,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:24,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-09 06:49:24,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,771 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) [2025-03-09 06:49:24,771 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 [2025-03-09 06:49:24,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:24,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:24,814 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:24,818 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 [2025-03-09 06:49:24,818 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:24,818 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:24,818 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:24,818 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:24,818 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:24,818 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,818 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:24,818 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:24,818 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration10_Loop [2025-03-09 06:49:24,818 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:24,818 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:24,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:24,858 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:24,859 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:24,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,861 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) [2025-03-09 06:49:24,861 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 [2025-03-09 06:49:24,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:24,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:24,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:24,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:24,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:24,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:24,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:24,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:24,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:24,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-09 06:49:24,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,881 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) [2025-03-09 06:49:24,882 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 [2025-03-09 06:49:24,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:24,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:24,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:24,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:24,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:24,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:24,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:24,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:24,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:24,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-09 06:49:24,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,902 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) [2025-03-09 06:49:24,903 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 [2025-03-09 06:49:24,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:24,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:24,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:24,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:24,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:24,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:24,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:24,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:24,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:24,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-09 06:49:24,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,928 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) [2025-03-09 06:49:24,929 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 [2025-03-09 06:49:24,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:24,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:24,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:24,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:24,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:24,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:24,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:24,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:24,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:24,948 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 [2025-03-09 06:49:24,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,950 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) [2025-03-09 06:49:24,951 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 [2025-03-09 06:49:24,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:24,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:24,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:24,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:24,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:24,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:24,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:24,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:24,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:24,969 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 [2025-03-09 06:49:24,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,971 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) [2025-03-09 06:49:24,972 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 [2025-03-09 06:49:24,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:24,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:24,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:24,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:24,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:24,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:24,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:24,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:24,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:24,988 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 06:49:24,988 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:24,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:24,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:24,991 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) [2025-03-09 06:49:24,992 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 [2025-03-09 06:49:24,993 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:24,993 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:24,993 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:24,993 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2025-03-09 06:49:24,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-09 06:49:24,999 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:25,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:25,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:49:25,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:49:25,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:49:25,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:25,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:25,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:25,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:25,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:25,128 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 [2025-03-09 06:49:25,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 996 states and 2112 transitions. cyclomatic complexity: 1136 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) [2025-03-09 06:49:25,240 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 996 states and 2112 transitions. cyclomatic complexity: 1136. 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 1889 states and 3790 transitions. Complement of second has 34 states. [2025-03-09 06:49:25,241 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 [2025-03-09 06:49:25,241 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) [2025-03-09 06:49:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2025-03-09 06:49:25,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 24 letters. Loop has 5 letters. [2025-03-09 06:49:25,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:25,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 29 letters. Loop has 5 letters. [2025-03-09 06:49:25,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:25,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 24 letters. Loop has 10 letters. [2025-03-09 06:49:25,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:25,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1889 states and 3790 transitions. [2025-03-09 06:49:25,280 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 122 [2025-03-09 06:49:25,283 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 [2025-03-09 06:49:25,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1889 states to 1647 states and 3417 transitions. [2025-03-09 06:49:25,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 718 [2025-03-09 06:49:25,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 744 [2025-03-09 06:49:25,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1647 states and 3417 transitions. [2025-03-09 06:49:25,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:25,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1647 states and 3417 transitions. [2025-03-09 06:49:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states and 3417 transitions. [2025-03-09 06:49:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1563. [2025-03-09 06:49:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1025 states have (on average 1.2448780487804878) internal successors, (1276), 1176 states have internal predecessors, (1276), 291 states have call successors, (293), 141 states have call predecessors, (293), 247 states have return successors, (1630), 245 states have call predecessors, (1630), 285 states have call successors, (1630) [2025-03-09 06:49:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 3199 transitions. [2025-03-09 06:49:25,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1563 states and 3199 transitions. [2025-03-09 06:49:25,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:25,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:49:25,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:49:25,339 INFO L87 Difference]: Start difference. First operand 1563 states and 3199 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) [2025-03-09 06:49:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:25,364 INFO L93 Difference]: Finished difference Result 1287 states and 2712 transitions. [2025-03-09 06:49:25,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1287 states and 2712 transitions. [2025-03-09 06:49:25,373 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 78 [2025-03-09 06:49:25,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1287 states to 1271 states and 2695 transitions. [2025-03-09 06:49:25,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2025-03-09 06:49:25,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 518 [2025-03-09 06:49:25,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1271 states and 2695 transitions. [2025-03-09 06:49:25,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:25,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-03-09 06:49:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states and 2695 transitions. [2025-03-09 06:49:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2025-03-09 06:49:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 832 states have (on average 1.2524038461538463) internal successors, (1042), 957 states have internal predecessors, (1042), 232 states have call successors, (233), 109 states have call predecessors, (233), 207 states have return successors, (1420), 204 states have call predecessors, (1420), 232 states have call successors, (1420) [2025-03-09 06:49:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2695 transitions. [2025-03-09 06:49:25,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-03-09 06:49:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:49:25,416 INFO L432 stractBuchiCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-03-09 06:49:25,417 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 06:49:25,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1271 states and 2695 transitions. [2025-03-09 06:49:25,422 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 78 [2025-03-09 06:49:25,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:25,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:25,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:49:25,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:25,423 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" [2025-03-09 06:49:25,423 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" [2025-03-09 06:49:25,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash -66487454, now seen corresponding path program 5 times [2025-03-09 06:49:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:25,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045818902] [2025-03-09 06:49:25,423 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:25,426 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-03-09 06:49:25,430 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:49:25,430 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 06:49:25,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 06:49:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045818902] [2025-03-09 06:49:25,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045818902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:25,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:25,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:49:25,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107163393] [2025-03-09 06:49:25,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:25,470 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:25,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -685329803, now seen corresponding path program 2 times [2025-03-09 06:49:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:25,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355525061] [2025-03-09 06:49:25,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:25,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:25,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:25,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:25,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:25,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:25,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:25,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:25,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:25,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:25,516 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:25,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:25,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:25,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:25,517 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:25,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:25,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:25,517 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2025-03-09 06:49:25,517 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:25,517 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:25,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,538 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:25,538 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:25,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:25,541 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) [2025-03-09 06:49:25,543 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 [2025-03-09 06:49:25,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:25,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:25,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:25,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:25,563 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) [2025-03-09 06:49:25,565 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 [2025-03-09 06:49:25,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:25,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:25,656 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:25,661 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 [2025-03-09 06:49:25,661 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:25,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:25,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:25,661 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:25,661 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:25,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,661 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:25,661 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:25,661 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2025-03-09 06:49:25,661 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:25,661 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:25,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:25,683 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:25,683 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:25,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:25,685 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) [2025-03-09 06:49:25,687 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 [2025-03-09 06:49:25,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:25,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:25,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:25,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:25,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:25,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:25,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:25,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:25,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:25,702 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:49:25,702 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:49:25,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:25,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:25,704 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) [2025-03-09 06:49:25,705 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 [2025-03-09 06:49:25,705 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:25,705 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:25,705 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:25,705 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 [] [2025-03-09 06:49:25,710 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 [2025-03-09 06:49:25,711 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:25,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:25,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 06:49:25,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:49:25,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:25,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:25,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:25,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:25,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:25,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:25,856 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 [2025-03-09 06:49:25,856 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-09 06:49:25,898 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 1284 states and 2709 transitions. Complement of second has 10 states. [2025-03-09 06:49:25,898 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 [2025-03-09 06:49:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-09 06:49:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2025-03-09 06:49:25,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 27 letters. Loop has 7 letters. [2025-03-09 06:49:25,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:25,899 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:25,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:25,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 06:49:25,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:49:25,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:25,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:25,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:25,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:25,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:26,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:26,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:26,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:26,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:26,031 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 [2025-03-09 06:49:26,031 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-09 06:49:26,086 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 1282 states and 2706 transitions. Complement of second has 10 states. [2025-03-09 06:49:26,087 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 [2025-03-09 06:49:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-09 06:49:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-03-09 06:49:26,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 27 letters. Loop has 7 letters. [2025-03-09 06:49:26,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:26,087 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:26,088 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 [2025-03-09 06:49:26,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:26,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 06:49:26,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:49:26,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:26,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:26,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:26,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:26,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:26,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:26,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:26,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:26,226 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 [2025-03-09 06:49:26,226 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-09 06:49:26,295 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1271 states and 2695 transitions. cyclomatic complexity: 1453. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 2445 states and 5285 transitions. Complement of second has 11 states. [2025-03-09 06:49:26,295 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 [2025-03-09 06:49:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-09 06:49:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2025-03-09 06:49:26,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 27 letters. Loop has 7 letters. [2025-03-09 06:49:26,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:26,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 34 letters. Loop has 7 letters. [2025-03-09 06:49:26,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:26,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 27 letters. Loop has 14 letters. [2025-03-09 06:49:26,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:26,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2445 states and 5285 transitions. [2025-03-09 06:49:26,318 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 57 [2025-03-09 06:49:26,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2445 states to 2000 states and 4030 transitions. [2025-03-09 06:49:26,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2025-03-09 06:49:26,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 383 [2025-03-09 06:49:26,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2000 states and 4030 transitions. [2025-03-09 06:49:26,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:26,347 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2000 states and 4030 transitions. [2025-03-09 06:49:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states and 4030 transitions. [2025-03-09 06:49:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1924. [2025-03-09 06:49:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1279 states have (on average 1.236903831118061) internal successors, (1582), 1452 states have internal predecessors, (1582), 355 states have call successors, (372), 185 states have call predecessors, (372), 290 states have return successors, (1925), 286 states have call predecessors, (1925), 343 states have call successors, (1925) [2025-03-09 06:49:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3879 transitions. [2025-03-09 06:49:26,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1924 states and 3879 transitions. [2025-03-09 06:49:26,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:26,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:49:26,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:49:26,398 INFO L87 Difference]: Start difference. First operand 1924 states and 3879 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-09 06:49:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:26,465 INFO L93 Difference]: Finished difference Result 1127 states and 2232 transitions. [2025-03-09 06:49:26,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1127 states and 2232 transitions. [2025-03-09 06:49:26,472 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-03-09 06:49:26,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1127 states to 620 states and 1244 transitions. [2025-03-09 06:49:26,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2025-03-09 06:49:26,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 244 [2025-03-09 06:49:26,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 620 states and 1244 transitions. [2025-03-09 06:49:26,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:26,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 620 states and 1244 transitions. [2025-03-09 06:49:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states and 1244 transitions. [2025-03-09 06:49:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 574. [2025-03-09 06:49:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 383 states have (on average 1.216710182767624) internal successors, (466), 425 states have internal predecessors, (466), 102 states have call successors, (108), 57 states have call predecessors, (108), 89 states have return successors, (576), 91 states have call predecessors, (576), 99 states have call successors, (576) [2025-03-09 06:49:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1150 transitions. [2025-03-09 06:49:26,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 574 states and 1150 transitions. [2025-03-09 06:49:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:49:26,494 INFO L432 stractBuchiCegarLoop]: Abstraction has 574 states and 1150 transitions. [2025-03-09 06:49:26,494 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 06:49:26,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 1150 transitions. [2025-03-09 06:49:26,495 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-03-09 06:49:26,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:26,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:26,496 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] [2025-03-09 06:49:26,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:26,496 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-03-09 06:49:26,496 INFO L754 eck$LassoCheckResult]: Loop: "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-03-09 06:49:26,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:26,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1871664325, now seen corresponding path program 1 times [2025-03-09 06:49:26,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:26,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745680516] [2025-03-09 06:49:26,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:26,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 06:49:26,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 06:49:26,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:26,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:26,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 06:49:26,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 06:49:26,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:26,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:26,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1821627982, now seen corresponding path program 1 times [2025-03-09 06:49:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:26,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165135765] [2025-03-09 06:49:26,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:26,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:26,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:26,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:26,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:26,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:26,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:26,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:26,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:26,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:26,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -14481902, now seen corresponding path program 2 times [2025-03-09 06:49:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:26,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011753549] [2025-03-09 06:49:26,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:26,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 06:49:26,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 06:49:26,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:26,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 06:49:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011753549] [2025-03-09 06:49:26,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011753549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844969150] [2025-03-09 06:49:26,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:26,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:26,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:26,606 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) [2025-03-09 06:49:26,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-03-09 06:49:26,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 06:49:26,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 06:49:26,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:26,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:26,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:49:26,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 06:49:26,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 06:49:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844969150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:26,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:26,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-03-09 06:49:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133525634] [2025-03-09 06:49:26,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:26,786 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:26,786 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:26,786 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:26,786 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:26,786 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:26,786 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:26,786 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:26,786 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:26,786 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2025-03-09 06:49:26,786 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:26,786 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:26,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:26,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:26,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:26,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:26,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:26,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:26,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:26,833 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:26,833 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:26,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:26,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:26,836 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) [2025-03-09 06:49:26,836 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 [2025-03-09 06:49:26,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:26,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:26,848 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:26,848 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:26,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:26,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:26,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:26,855 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) [2025-03-09 06:49:26,856 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 [2025-03-09 06:49:26,857 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:26,857 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:26,867 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:26,867 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:26,872 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 [2025-03-09 06:49:26,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:26,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:26,874 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) [2025-03-09 06:49:26,875 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 [2025-03-09 06:49:26,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:26,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:26,886 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:26,886 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:26,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-09 06:49:26,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:26,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:26,893 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) [2025-03-09 06:49:26,894 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 [2025-03-09 06:49:26,895 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:26,895 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:26,905 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:26,905 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:26,910 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 [2025-03-09 06:49:26,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:26,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:26,913 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) [2025-03-09 06:49:26,913 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 [2025-03-09 06:49:26,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:26,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:26,924 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:26,924 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:26,930 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 [2025-03-09 06:49:26,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:26,932 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) [2025-03-09 06:49:26,933 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 [2025-03-09 06:49:26,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:26,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:26,949 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 [2025-03-09 06:49:26,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:26,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:26,951 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) [2025-03-09 06:49:26,952 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 [2025-03-09 06:49:26,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:26,953 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:27,046 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:27,051 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 [2025-03-09 06:49:27,051 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:27,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:27,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:27,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:27,051 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:27,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:27,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:27,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:27,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2025-03-09 06:49:27,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:27,051 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:27,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:27,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:27,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:27,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:27,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:27,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:27,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:27,090 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:27,090 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:27,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:27,092 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) [2025-03-09 06:49:27,093 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 [2025-03-09 06:49:27,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:27,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:27,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:27,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:27,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:27,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:27,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:27,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:27,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:27,110 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 [2025-03-09 06:49:27,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:27,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:27,112 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) [2025-03-09 06:49:27,113 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 [2025-03-09 06:49:27,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:27,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:27,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:27,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:27,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:27,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:27,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:27,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:27,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:27,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-09 06:49:27,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:27,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:27,132 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) [2025-03-09 06:49:27,133 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 [2025-03-09 06:49:27,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:27,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:27,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:27,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:27,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:27,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:27,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:27,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:27,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:27,149 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 [2025-03-09 06:49:27,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:27,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:27,151 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) [2025-03-09 06:49:27,153 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 [2025-03-09 06:49:27,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:27,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:27,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:27,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:27,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:27,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:27,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:27,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:27,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:27,170 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 [2025-03-09 06:49:27,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:27,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:27,172 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) [2025-03-09 06:49:27,173 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 [2025-03-09 06:49:27,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:27,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:27,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:27,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:27,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:27,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:27,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:27,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:27,188 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:27,190 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:27,190 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:49:27,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:27,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:27,192 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) [2025-03-09 06:49:27,193 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 [2025-03-09 06:49:27,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:27,194 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:27,194 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:27,194 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-03-09 06:49:27,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:27,200 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:27,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:27,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 06:49:27,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 06:49:27,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:27,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:27,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:49:27,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:27,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:27,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:27,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:27,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:27,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:49:27,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:27,387 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 [2025-03-09 06:49:27,387 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 574 states and 1150 transitions. cyclomatic complexity: 595 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2025-03-09 06:49:27,555 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 574 states and 1150 transitions. cyclomatic complexity: 595. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 2135 states and 4399 transitions. Complement of second has 41 states. [2025-03-09 06:49:27,556 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 [2025-03-09 06:49:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2025-03-09 06:49:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2025-03-09 06:49:27,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 41 letters. Loop has 10 letters. [2025-03-09 06:49:27,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:27,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 51 letters. Loop has 10 letters. [2025-03-09 06:49:27,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:27,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 41 letters. Loop has 20 letters. [2025-03-09 06:49:27,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:27,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2135 states and 4399 transitions. [2025-03-09 06:49:27,577 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 100 [2025-03-09 06:49:27,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2135 states to 1599 states and 3530 transitions. [2025-03-09 06:49:27,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 441 [2025-03-09 06:49:27,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 488 [2025-03-09 06:49:27,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1599 states and 3530 transitions. [2025-03-09 06:49:27,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:27,600 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1599 states and 3530 transitions. [2025-03-09 06:49:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states and 3530 transitions. [2025-03-09 06:49:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1386. [2025-03-09 06:49:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 909 states have (on average 1.2530253025302531) internal successors, (1139), 1034 states have internal predecessors, (1139), 262 states have call successors, (268), 151 states have call predecessors, (268), 215 states have return successors, (1330), 200 states have call predecessors, (1330), 247 states have call successors, (1330) [2025-03-09 06:49:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2737 transitions. [2025-03-09 06:49:27,643 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1386 states and 2737 transitions. [2025-03-09 06:49:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:27,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:49:27,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:49:27,644 INFO L87 Difference]: Start difference. First operand 1386 states and 2737 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 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) [2025-03-09 06:49:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:27,717 INFO L93 Difference]: Finished difference Result 1694 states and 3159 transitions. [2025-03-09 06:49:27,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1694 states and 3159 transitions. [2025-03-09 06:49:27,727 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2025-03-09 06:49:27,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1694 states to 1594 states and 3025 transitions. [2025-03-09 06:49:27,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 460 [2025-03-09 06:49:27,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 460 [2025-03-09 06:49:27,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1594 states and 3025 transitions. [2025-03-09 06:49:27,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:27,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1594 states and 3025 transitions. [2025-03-09 06:49:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states and 3025 transitions. [2025-03-09 06:49:27,803 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 [2025-03-09 06:49:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1544. [2025-03-09 06:49:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1006 states have (on average 1.2495029821073558) internal successors, (1257), 1145 states have internal predecessors, (1257), 296 states have call successors, (304), 167 states have call predecessors, (304), 242 states have return successors, (1398), 231 states have call predecessors, (1398), 276 states have call successors, (1398) [2025-03-09 06:49:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2959 transitions. [2025-03-09 06:49:27,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1544 states and 2959 transitions. [2025-03-09 06:49:27,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:49:27,816 INFO L432 stractBuchiCegarLoop]: Abstraction has 1544 states and 2959 transitions. [2025-03-09 06:49:27,817 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 06:49:27,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1544 states and 2959 transitions. [2025-03-09 06:49:27,821 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 107 [2025-03-09 06:49:27,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:27,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:27,821 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] [2025-03-09 06:49:27,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:27,822 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" [2025-03-09 06:49:27,822 INFO L754 eck$LassoCheckResult]: Loop: "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" [2025-03-09 06:49:27,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1076834671, now seen corresponding path program 1 times [2025-03-09 06:49:27,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:27,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250342146] [2025-03-09 06:49:27,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:27,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 06:49:27,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:49:27,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:27,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 06:49:27,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:27,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250342146] [2025-03-09 06:49:27,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250342146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:27,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087191674] [2025-03-09 06:49:27,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:27,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:27,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:27,875 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) [2025-03-09 06:49:27,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-03-09 06:49:27,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 06:49:27,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:49:27,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:27,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:27,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:27,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 06:49:27,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 06:49:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087191674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:27,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-09 06:49:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122099035] [2025-03-09 06:49:27,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:27,960 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:27,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash 37130476, now seen corresponding path program 2 times [2025-03-09 06:49:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:27,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431056271] [2025-03-09 06:49:27,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:27,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:27,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:27,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:27,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:27,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:27,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:27,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:27,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:27,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:27,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:27,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:28,029 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:28,029 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:28,029 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:28,029 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:28,029 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:28,029 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:28,029 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:28,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:28,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2025-03-09 06:49:28,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:28,029 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:28,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:28,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:28,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:28,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:28,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:28,076 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:28,076 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:28,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:28,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:28,078 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) [2025-03-09 06:49:28,079 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 [2025-03-09 06:49:28,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:28,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:28,091 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:28,091 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:28,097 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 [2025-03-09 06:49:28,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:28,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:28,099 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) [2025-03-09 06:49:28,099 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 [2025-03-09 06:49:28,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:28,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:28,111 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:28,111 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:28,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-09 06:49:28,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:28,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:28,119 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) [2025-03-09 06:49:28,119 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 [2025-03-09 06:49:28,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:28,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:28,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-09 06:49:28,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:28,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:28,147 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) [2025-03-09 06:49:28,148 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 [2025-03-09 06:49:28,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:28,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:28,446 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:28,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:28,456 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:28,456 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:28,456 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:28,456 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:28,456 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:28,456 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:28,456 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:28,456 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:28,456 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2025-03-09 06:49:28,456 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:28,456 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:28,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:28,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:28,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:28,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:28,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:28,495 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:28,495 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:28,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:28,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:28,497 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) [2025-03-09 06:49:28,498 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 [2025-03-09 06:49:28,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:28,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:28,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:28,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:28,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:28,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:28,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:28,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:28,513 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:28,516 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:28,516 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:49:28,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:28,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:28,518 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) [2025-03-09 06:49:28,518 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 [2025-03-09 06:49:28,519 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:28,519 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:28,519 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:28,519 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-03-09 06:49:28,524 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 [2025-03-09 06:49:28,525 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:28,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:28,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 06:49:28,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:49:28,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:28,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:28,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:49:28,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:28,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:28,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:28,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:28,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:28,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:49:28,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:28,723 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 [2025-03-09 06:49:28,723 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460 Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2025-03-09 06:49:28,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 1635 states and 3065 transitions. Complement of second has 15 states. [2025-03-09 06:49:28,802 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 [2025-03-09 06:49:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2025-03-09 06:49:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2025-03-09 06:49:28,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 49 letters. Loop has 5 letters. [2025-03-09 06:49:28,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:28,803 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:28,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:28,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 06:49:28,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:49:28,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:28,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:28,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:49:28,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:28,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:28,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:28,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:28,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:28,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:49:28,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:29,002 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 [2025-03-09 06:49:29,002 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460 Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2025-03-09 06:49:29,067 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 1635 states and 3065 transitions. Complement of second has 15 states. [2025-03-09 06:49:29,070 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 [2025-03-09 06:49:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2025-03-09 06:49:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2025-03-09 06:49:29,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 49 letters. Loop has 5 letters. [2025-03-09 06:49:29,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:29,071 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:29,090 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 [2025-03-09 06:49:29,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:29,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 06:49:29,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:49:29,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:29,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:29,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:49:29,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:29,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:29,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:29,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:29,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:29,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:49:29,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:29,279 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 [2025-03-09 06:49:29,280 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460 Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2025-03-09 06:49:29,365 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 2295 states and 4136 transitions. Complement of second has 20 states. [2025-03-09 06:49:29,366 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 [2025-03-09 06:49:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2025-03-09 06:49:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2025-03-09 06:49:29,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 49 letters. Loop has 5 letters. [2025-03-09 06:49:29,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:29,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 54 letters. Loop has 5 letters. [2025-03-09 06:49:29,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:29,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 49 letters. Loop has 10 letters. [2025-03-09 06:49:29,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:29,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2295 states and 4136 transitions. [2025-03-09 06:49:29,381 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 107 [2025-03-09 06:49:29,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2295 states to 1866 states and 3619 transitions. [2025-03-09 06:49:29,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2025-03-09 06:49:29,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 472 [2025-03-09 06:49:29,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1866 states and 3619 transitions. [2025-03-09 06:49:29,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:29,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1866 states and 3619 transitions. [2025-03-09 06:49:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states and 3619 transitions. [2025-03-09 06:49:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1731. [2025-03-09 06:49:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1110 states have (on average 1.2720720720720722) internal successors, (1412), 1292 states have internal predecessors, (1412), 375 states have call successors, (383), 206 states have call predecessors, (383), 246 states have return successors, (1365), 232 states have call predecessors, (1365), 357 states have call successors, (1365) [2025-03-09 06:49:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3160 transitions. [2025-03-09 06:49:29,464 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1731 states and 3160 transitions. [2025-03-09 06:49:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:29,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:49:29,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:49:29,465 INFO L87 Difference]: Start difference. First operand 1731 states and 3160 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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) [2025-03-09 06:49:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:29,553 INFO L93 Difference]: Finished difference Result 1730 states and 3132 transitions. [2025-03-09 06:49:29,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1730 states and 3132 transitions. [2025-03-09 06:49:29,562 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 101 [2025-03-09 06:49:29,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1730 states to 1706 states and 3106 transitions. [2025-03-09 06:49:29,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 441 [2025-03-09 06:49:29,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 441 [2025-03-09 06:49:29,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1706 states and 3106 transitions. [2025-03-09 06:49:29,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:29,579 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1706 states and 3106 transitions. [2025-03-09 06:49:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states and 3106 transitions. [2025-03-09 06:49:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1673. [2025-03-09 06:49:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1072 states have (on average 1.271455223880597) internal successors, (1363), 1250 states have internal predecessors, (1363), 361 states have call successors, (367), 200 states have call predecessors, (367), 240 states have return successors, (1334), 222 states have call predecessors, (1334), 347 states have call successors, (1334) [2025-03-09 06:49:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 3064 transitions. [2025-03-09 06:49:29,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1673 states and 3064 transitions. [2025-03-09 06:49:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:49:29,621 INFO L432 stractBuchiCegarLoop]: Abstraction has 1673 states and 3064 transitions. [2025-03-09 06:49:29,621 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-09 06:49:29,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1673 states and 3064 transitions. [2025-03-09 06:49:29,625 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 99 [2025-03-09 06:49:29,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:29,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:29,626 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 6, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:29,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:49:29,626 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-03-09 06:49:29,626 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-03-09 06:49:29,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash -64031317, now seen corresponding path program 1 times [2025-03-09 06:49:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:29,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934026709] [2025-03-09 06:49:29,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:29,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 06:49:29,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 06:49:29,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:29,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-09 06:49:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934026709] [2025-03-09 06:49:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934026709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251571535] [2025-03-09 06:49:29,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:29,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:29,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:29,706 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) [2025-03-09 06:49:29,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-03-09 06:49:29,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 06:49:29,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 06:49:29,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:29,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:29,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:29,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-09 06:49:29,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-09 06:49:29,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251571535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:29,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:29,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-09 06:49:29,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478426639] [2025-03-09 06:49:29,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:29,843 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash -928346155, now seen corresponding path program 2 times [2025-03-09 06:49:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:29,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379079178] [2025-03-09 06:49:29,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:29,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 06:49:29,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:49:29,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:29,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:29,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:29,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:49:29,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:49:29,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:29,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:29,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:30,014 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:30,015 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:30,015 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:30,015 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:30,015 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:30,015 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,015 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:30,015 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:30,015 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2025-03-09 06:49:30,015 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:30,015 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:30,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:30,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:30,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:30,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:30,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:30,059 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:30,059 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:30,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,062 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) [2025-03-09 06:49:30,062 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 [2025-03-09 06:49:30,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:30,063 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:30,074 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:30,074 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:30,079 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 [2025-03-09 06:49:30,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,081 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) [2025-03-09 06:49:30,082 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 [2025-03-09 06:49:30,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:30,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:30,093 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:30,093 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:30,099 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 [2025-03-09 06:49:30,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,101 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) [2025-03-09 06:49:30,104 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 [2025-03-09 06:49:30,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:30,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:30,115 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:30,115 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:30,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-09 06:49:30,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,122 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) [2025-03-09 06:49:30,123 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 [2025-03-09 06:49:30,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:30,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:30,134 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:30,134 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:30,139 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 [2025-03-09 06:49:30,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,141 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:30,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-09 06:49:30,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:30,142 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:30,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-09 06:49:30,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,171 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) [2025-03-09 06:49:30,172 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 [2025-03-09 06:49:30,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:30,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:30,415 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:30,425 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 [2025-03-09 06:49:30,425 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:30,425 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:30,425 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:30,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:30,425 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:30,425 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,425 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:30,425 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:30,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2025-03-09 06:49:30,425 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:30,425 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:30,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:30,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:30,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:30,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:30,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:30,477 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:30,477 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:30,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,479 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) [2025-03-09 06:49:30,480 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 [2025-03-09 06:49:30,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:30,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:30,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:30,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:30,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:30,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:30,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:30,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:30,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:30,497 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 [2025-03-09 06:49:30,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,499 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) [2025-03-09 06:49:30,500 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 [2025-03-09 06:49:30,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:30,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:30,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:30,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:30,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:30,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:30,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:30,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:30,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:30,517 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 [2025-03-09 06:49:30,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,519 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) [2025-03-09 06:49:30,519 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 [2025-03-09 06:49:30,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:30,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:30,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:30,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:30,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:30,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:30,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:30,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:30,533 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:30,535 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:30,535 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:49:30,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:30,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:30,538 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) [2025-03-09 06:49:30,539 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 [2025-03-09 06:49:30,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:30,540 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:30,540 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:30,540 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-03-09 06:49:30,545 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 [2025-03-09 06:49:30,546 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:30,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:30,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 06:49:30,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 06:49:30,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:30,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:30,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:49:30,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:30,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:49:30,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:49:30,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:30,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:30,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:49:30,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:30,845 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 [2025-03-09 06:49:30,845 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432 Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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) [2025-03-09 06:49:31,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-09 06:49:31,143 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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 8219 states and 15420 transitions. Complement of second has 50 states. [2025-03-09 06:49:31,145 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 [2025-03-09 06:49:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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) [2025-03-09 06:49:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2025-03-09 06:49:31,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 61 letters. Loop has 15 letters. [2025-03-09 06:49:31,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:31,145 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:31,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:31,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 06:49:31,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 06:49:31,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:31,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:31,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:49:31,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:31,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:49:31,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:49:31,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:31,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:31,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:49:31,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:31,449 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 [2025-03-09 06:49:31,449 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432 Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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) [2025-03-09 06:49:31,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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 8523 states and 16556 transitions. Complement of second has 48 states. [2025-03-09 06:49:31,715 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 [2025-03-09 06:49:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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) [2025-03-09 06:49:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2025-03-09 06:49:31,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 72 transitions. Stem has 61 letters. Loop has 15 letters. [2025-03-09 06:49:31,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:31,716 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:31,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:31,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 06:49:31,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 06:49:31,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:31,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:31,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:49:31,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:31,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:49:31,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:49:31,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:31,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:31,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:49:31,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:32,043 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 [2025-03-09 06:49:32,043 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432 Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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) [2025-03-09 06:49:32,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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 20358 states and 40513 transitions. Complement of second has 334 states. [2025-03-09 06:49:32,477 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 [2025-03-09 06:49:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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) [2025-03-09 06:49:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2025-03-09 06:49:32,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 61 letters. Loop has 15 letters. [2025-03-09 06:49:32,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:32,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 76 letters. Loop has 15 letters. [2025-03-09 06:49:32,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:32,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 61 letters. Loop has 30 letters. [2025-03-09 06:49:32,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:32,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20358 states and 40513 transitions. [2025-03-09 06:49:32,746 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 104 [2025-03-09 06:49:32,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20358 states to 11007 states and 25018 transitions. [2025-03-09 06:49:32,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1082 [2025-03-09 06:49:32,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1254 [2025-03-09 06:49:32,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11007 states and 25018 transitions. [2025-03-09 06:49:32,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:32,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11007 states and 25018 transitions. [2025-03-09 06:49:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11007 states and 25018 transitions. [2025-03-09 06:49:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11007 to 8039. [2025-03-09 06:49:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8039 states, 5055 states have (on average 1.2660731948565775) internal successors, (6400), 5880 states have internal predecessors, (6400), 1945 states have call successors, (1997), 993 states have call predecessors, (1997), 1039 states have return successors, (4995), 1165 states have call predecessors, (4995), 1920 states have call successors, (4995) [2025-03-09 06:49:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8039 states to 8039 states and 13392 transitions. [2025-03-09 06:49:33,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8039 states and 13392 transitions. [2025-03-09 06:49:33,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:33,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:49:33,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:49:33,227 INFO L87 Difference]: Start difference. First operand 8039 states and 13392 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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) [2025-03-09 06:49:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:33,311 INFO L93 Difference]: Finished difference Result 8082 states and 13470 transitions. [2025-03-09 06:49:33,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8082 states and 13470 transitions. [2025-03-09 06:49:33,352 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 84 [2025-03-09 06:49:33,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8082 states to 8068 states and 13453 transitions. [2025-03-09 06:49:33,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 941 [2025-03-09 06:49:33,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 941 [2025-03-09 06:49:33,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8068 states and 13453 transitions. [2025-03-09 06:49:33,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:33,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8068 states and 13453 transitions. [2025-03-09 06:49:33,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8068 states and 13453 transitions. [2025-03-09 06:49:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8068 to 8042. [2025-03-09 06:49:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8042 states, 5057 states have (on average 1.265967965196757) internal successors, (6402), 5882 states have internal predecessors, (6402), 1946 states have call successors, (1998), 993 states have call predecessors, (1998), 1039 states have return successors, (4996), 1166 states have call predecessors, (4996), 1921 states have call successors, (4996) [2025-03-09 06:49:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8042 states to 8042 states and 13396 transitions. [2025-03-09 06:49:33,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8042 states and 13396 transitions. [2025-03-09 06:49:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:49:33,687 INFO L432 stractBuchiCegarLoop]: Abstraction has 8042 states and 13396 transitions. [2025-03-09 06:49:33,687 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-09 06:49:33,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8042 states and 13396 transitions. [2025-03-09 06:49:33,711 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 75 [2025-03-09 06:49:33,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:33,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:33,712 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 6, 6, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:33,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:33,713 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" [2025-03-09 06:49:33,713 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" [2025-03-09 06:49:33,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:33,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1195528394, now seen corresponding path program 2 times [2025-03-09 06:49:33,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:33,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178338217] [2025-03-09 06:49:33,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:33,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:33,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-09 06:49:33,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:49:33,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:33,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-09 06:49:33,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:33,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178338217] [2025-03-09 06:49:33,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178338217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:33,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:33,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:49:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758737329] [2025-03-09 06:49:33,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:33,766 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:33,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1417212244, now seen corresponding path program 3 times [2025-03-09 06:49:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:33,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635526350] [2025-03-09 06:49:33,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:33,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 2 equivalence classes. [2025-03-09 06:49:33,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:33,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:49:33,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:33,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:33,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:33,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:33,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:33,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:33,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:33,894 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:33,894 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:33,894 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:33,894 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:33,894 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:33,894 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:33,894 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:33,894 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:33,894 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2025-03-09 06:49:33,894 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:33,894 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:33,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:33,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:33,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:33,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:33,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:33,950 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:33,950 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:33,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:33,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:33,952 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) [2025-03-09 06:49:33,954 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 [2025-03-09 06:49:33,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:33,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:33,965 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:33,965 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:33,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:33,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:33,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:33,973 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) [2025-03-09 06:49:33,974 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 [2025-03-09 06:49:33,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:33,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:33,986 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:33,986 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=1} Honda state: {parts_#t~ret1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:33,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:33,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:33,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:33,994 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) [2025-03-09 06:49:33,995 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 [2025-03-09 06:49:33,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:33,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:34,007 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:34,008 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:34,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:34,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:34,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:34,015 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) [2025-03-09 06:49:34,017 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 [2025-03-09 06:49:34,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:34,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:34,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:34,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:34,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:34,044 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) [2025-03-09 06:49:34,045 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 [2025-03-09 06:49:34,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:34,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:34,334 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:34,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:34,346 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:34,346 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:34,346 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:34,346 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:34,346 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:34,346 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:34,346 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:34,346 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:34,346 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2025-03-09 06:49:34,346 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:34,346 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:34,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:34,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:34,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:34,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:34,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:34,390 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:34,390 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:34,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:34,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:34,392 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) [2025-03-09 06:49:34,393 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 [2025-03-09 06:49:34,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:34,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:34,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:34,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:34,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:34,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:34,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:34,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:34,404 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:34,409 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 [2025-03-09 06:49:34,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:34,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:34,411 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:34,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-09 06:49:34,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:34,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:34,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:34,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:34,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:34,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:34,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:34,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:34,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:34,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-09 06:49:34,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:34,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:34,431 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) [2025-03-09 06:49:34,431 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 [2025-03-09 06:49:34,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:34,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:34,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:34,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:34,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:34,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:34,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:34,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:34,445 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:34,447 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:34,447 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:49:34,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:34,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:34,449 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) [2025-03-09 06:49:34,450 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 [2025-03-09 06:49:34,451 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:34,451 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:34,451 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:34,451 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2025-03-09 06:49:34,456 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 [2025-03-09 06:49:34,456 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:34,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:34,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 06:49:34,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:49:34,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:34,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:34,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:49:34,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:34,784 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Exception during sending of exit command (exit): Broken pipe [2025-03-09 06:49:34,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-09 06:49:34,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:34,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:34,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:34,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:34,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:49:34,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:34,866 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 [2025-03-09 06:49:34,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 06:49:35,068 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 20125 states and 32565 transitions. Complement of second has 28 states. [2025-03-09 06:49:35,069 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 [2025-03-09 06:49:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 06:49:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2025-03-09 06:49:35,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 57 transitions. Stem has 68 letters. Loop has 10 letters. [2025-03-09 06:49:35,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:35,070 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:35,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:35,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 06:49:35,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:49:35,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:35,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:35,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:49:35,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:35,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:35,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:35,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:35,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:35,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:49:35,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:35,377 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 [2025-03-09 06:49:35,377 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 06:49:35,559 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 14019 states and 22220 transitions. Complement of second has 32 states. [2025-03-09 06:49:35,560 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 [2025-03-09 06:49:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 06:49:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2025-03-09 06:49:35,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 68 letters. Loop has 10 letters. [2025-03-09 06:49:35,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:35,561 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:35,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:35,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 06:49:35,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:49:35,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:35,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:35,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:49:35,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:35,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:35,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:35,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:35,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:35,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:49:35,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:35,867 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 [2025-03-09 06:49:35,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 06:49:36,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 35870 states and 61710 transitions. Complement of second has 110 states. [2025-03-09 06:49:36,162 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 [2025-03-09 06:49:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 06:49:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2025-03-09 06:49:36,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 61 transitions. Stem has 68 letters. Loop has 10 letters. [2025-03-09 06:49:36,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:36,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 61 transitions. Stem has 78 letters. Loop has 10 letters. [2025-03-09 06:49:36,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:36,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 61 transitions. Stem has 68 letters. Loop has 20 letters. [2025-03-09 06:49:36,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:36,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35870 states and 61710 transitions. [2025-03-09 06:49:36,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-03-09 06:49:36,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35870 states to 11934 states and 21429 transitions. [2025-03-09 06:49:36,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 687 [2025-03-09 06:49:36,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 757 [2025-03-09 06:49:36,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11934 states and 21429 transitions. [2025-03-09 06:49:36,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:36,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11934 states and 21429 transitions. [2025-03-09 06:49:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11934 states and 21429 transitions. [2025-03-09 06:49:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11934 to 9822. [2025-03-09 06:49:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9822 states, 6090 states have (on average 1.2494252873563219) internal successors, (7609), 7005 states have internal predecessors, (7609), 2480 states have call successors, (2606), 1220 states have call predecessors, (2606), 1252 states have return successors, (5938), 1596 states have call predecessors, (5938), 2478 states have call successors, (5938) [2025-03-09 06:49:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9822 states to 9822 states and 16153 transitions. [2025-03-09 06:49:36,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9822 states and 16153 transitions. [2025-03-09 06:49:36,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:36,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:49:36,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:49:36,977 INFO L87 Difference]: Start difference. First operand 9822 states and 16153 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:49:37,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:37,183 INFO L93 Difference]: Finished difference Result 9899 states and 15811 transitions. [2025-03-09 06:49:37,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9899 states and 15811 transitions. [2025-03-09 06:49:37,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-03-09 06:49:37,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9899 states to 9547 states and 15449 transitions. [2025-03-09 06:49:37,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 582 [2025-03-09 06:49:37,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 582 [2025-03-09 06:49:37,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9547 states and 15449 transitions. [2025-03-09 06:49:37,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:37,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9547 states and 15449 transitions. [2025-03-09 06:49:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states and 15449 transitions. [2025-03-09 06:49:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 9406. [2025-03-09 06:49:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9406 states, 5842 states have (on average 1.2307428962684013) internal successors, (7190), 6700 states have internal predecessors, (7190), 2429 states have call successors, (2544), 1187 states have call predecessors, (2544), 1135 states have return successors, (5391), 1518 states have call predecessors, (5391), 2427 states have call successors, (5391) [2025-03-09 06:49:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9406 states to 9406 states and 15125 transitions. [2025-03-09 06:49:37,549 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9406 states and 15125 transitions. [2025-03-09 06:49:37,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:49:37,550 INFO L432 stractBuchiCegarLoop]: Abstraction has 9406 states and 15125 transitions. [2025-03-09 06:49:37,550 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-09 06:49:37,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9406 states and 15125 transitions. [2025-03-09 06:49:37,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-03-09 06:49:37,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:37,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:37,575 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 7, 7, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:37,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 9, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:49:37,576 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:49:37,576 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:49:37,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1889861346, now seen corresponding path program 1 times [2025-03-09 06:49:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:37,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866710456] [2025-03-09 06:49:37,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:37,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:37,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 06:49:37,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 06:49:37,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:37,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 57 proven. 23 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-09 06:49:37,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866710456] [2025-03-09 06:49:37,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866710456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888139913] [2025-03-09 06:49:37,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:37,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:37,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:37,661 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:37,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2025-03-09 06:49:37,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 06:49:37,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 06:49:37,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:37,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:37,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:49:37,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-09 06:49:37,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:49:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888139913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:37,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:49:37,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-09 06:49:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281974456] [2025-03-09 06:49:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:37,724 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:37,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1125100596, now seen corresponding path program 1 times [2025-03-09 06:49:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209380605] [2025-03-09 06:49:37,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:37,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:49:37,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:49:37,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:37,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 59 proven. 49 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-03-09 06:49:37,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:37,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209380605] [2025-03-09 06:49:37,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209380605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:37,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750177447] [2025-03-09 06:49:37,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:37,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:37,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:37,843 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:37,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2025-03-09 06:49:37,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:49:37,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:49:37,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:37,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:37,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:49:37,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 59 proven. 49 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-03-09 06:49:37,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 59 proven. 49 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-03-09 06:49:38,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750177447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:38,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:38,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2025-03-09 06:49:38,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080120449] [2025-03-09 06:49:38,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:38,118 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:38,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:38,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:49:38,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:49:38,118 INFO L87 Difference]: Start difference. First operand 9406 states and 15125 transitions. cyclomatic complexity: 5883 Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-09 06:49:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:38,287 INFO L93 Difference]: Finished difference Result 9681 states and 15539 transitions. [2025-03-09 06:49:38,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9681 states and 15539 transitions. [2025-03-09 06:49:38,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-03-09 06:49:38,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9681 states to 6653 states and 10775 transitions. [2025-03-09 06:49:38,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 390 [2025-03-09 06:49:38,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 390 [2025-03-09 06:49:38,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6653 states and 10775 transitions. [2025-03-09 06:49:38,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:38,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6653 states and 10775 transitions. [2025-03-09 06:49:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6653 states and 10775 transitions. [2025-03-09 06:49:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6653 to 6087. [2025-03-09 06:49:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6087 states, 3824 states have (on average 1.2201882845188285) internal successors, (4666), 4359 states have internal predecessors, (4666), 1549 states have call successors, (1608), 790 states have call predecessors, (1608), 714 states have return successors, (3266), 937 states have call predecessors, (3266), 1547 states have call successors, (3266) [2025-03-09 06:49:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6087 states to 6087 states and 9540 transitions. [2025-03-09 06:49:38,550 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6087 states and 9540 transitions. [2025-03-09 06:49:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:49:38,550 INFO L432 stractBuchiCegarLoop]: Abstraction has 6087 states and 9540 transitions. [2025-03-09 06:49:38,550 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-09 06:49:38,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6087 states and 9540 transitions. [2025-03-09 06:49:38,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-03-09 06:49:38,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:38,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:38,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 7, 7, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:38,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:38,566 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:49:38,566 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:49:38,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1889861346, now seen corresponding path program 2 times [2025-03-09 06:49:38,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:38,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619451591] [2025-03-09 06:49:38,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:38,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:38,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-09 06:49:38,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 06:49:38,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:38,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 57 proven. 23 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-09 06:49:38,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:38,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619451591] [2025-03-09 06:49:38,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619451591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:38,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060160532] [2025-03-09 06:49:38,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:38,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:38,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:38,630 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:38,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2025-03-09 06:49:38,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-09 06:49:38,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 06:49:38,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:38,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:38,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:49:38,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-09 06:49:38,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:49:38,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060160532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:38,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:49:38,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-09 06:49:38,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186990010] [2025-03-09 06:49:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:38,694 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:38,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:38,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2064467040, now seen corresponding path program 2 times [2025-03-09 06:49:38,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:38,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839665838] [2025-03-09 06:49:38,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:38,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 06:49:38,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:49:38,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:38,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 06:49:38,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:38,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839665838] [2025-03-09 06:49:38,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839665838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:38,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272639422] [2025-03-09 06:49:38,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:38,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:38,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:38,791 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:38,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-03-09 06:49:38,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 06:49:38,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:49:38,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:38,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:38,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:49:38,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 06:49:38,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 06:49:39,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272639422] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:39,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:39,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 13 [2025-03-09 06:49:39,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084813710] [2025-03-09 06:49:39,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:39,173 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:39,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:39,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 06:49:39,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:49:39,173 INFO L87 Difference]: Start difference. First operand 6087 states and 9540 transitions. cyclomatic complexity: 3566 Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-09 06:49:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:39,353 INFO L93 Difference]: Finished difference Result 6590 states and 11202 transitions. [2025-03-09 06:49:39,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6590 states and 11202 transitions. [2025-03-09 06:49:39,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-09 06:49:39,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6590 states to 6245 states and 10468 transitions. [2025-03-09 06:49:39,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 364 [2025-03-09 06:49:39,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 364 [2025-03-09 06:49:39,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6245 states and 10468 transitions. [2025-03-09 06:49:39,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:39,455 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6245 states and 10468 transitions. [2025-03-09 06:49:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6245 states and 10468 transitions. [2025-03-09 06:49:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6245 to 5641. [2025-03-09 06:49:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 3552 states have (on average 1.2148085585585586) internal successors, (4315), 4050 states have internal predecessors, (4315), 1424 states have call successors, (1468), 730 states have call predecessors, (1468), 665 states have return successors, (2867), 860 states have call predecessors, (2867), 1424 states have call successors, (2867) [2025-03-09 06:49:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 8650 transitions. [2025-03-09 06:49:39,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5641 states and 8650 transitions. [2025-03-09 06:49:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:49:39,584 INFO L432 stractBuchiCegarLoop]: Abstraction has 5641 states and 8650 transitions. [2025-03-09 06:49:39,584 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-09 06:49:39,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5641 states and 8650 transitions. [2025-03-09 06:49:39,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-09 06:49:39,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:39,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:39,598 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 7, 6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:39,599 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] [2025-03-09 06:49:39,599 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:49:39,599 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:49:39,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:39,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1302591480, now seen corresponding path program 3 times [2025-03-09 06:49:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:39,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593954283] [2025-03-09 06:49:39,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:39,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:39,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 5 equivalence classes. [2025-03-09 06:49:39,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 62 of 74 statements. [2025-03-09 06:49:39,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:49:39,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-09 06:49:39,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593954283] [2025-03-09 06:49:39,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593954283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578196255] [2025-03-09 06:49:39,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:39,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:39,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:39,656 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:39,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-03-09 06:49:39,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 5 equivalence classes. [2025-03-09 06:49:39,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 62 of 74 statements. [2025-03-09 06:49:39,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:49:39,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:39,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:49:39,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-09 06:49:39,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:49:39,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578196255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:39,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:49:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2025-03-09 06:49:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870057416] [2025-03-09 06:49:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:39,715 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:39,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash -443579339, now seen corresponding path program 3 times [2025-03-09 06:49:39,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:39,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735479049] [2025-03-09 06:49:39,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:39,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-09 06:49:39,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 06:49:39,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:49:39,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:39,725 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:39,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 06:49:39,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 06:49:39,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:39,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:39,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:39,971 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:39,971 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:39,971 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:39,971 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:39,971 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:39,971 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:39,971 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:39,971 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:39,971 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2025-03-09 06:49:39,971 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:39,971 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:39,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:39,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:40,000 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:40,000 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:40,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:40,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:40,003 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) [2025-03-09 06:49:40,004 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 [2025-03-09 06:49:40,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:40,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:40,023 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 [2025-03-09 06:49:40,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:40,025 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) [2025-03-09 06:49:40,027 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 [2025-03-09 06:49:40,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:40,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:40,060 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:40,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:40,065 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:40,065 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:40,065 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:40,065 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:40,065 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:40,065 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:40,065 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:40,065 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:40,066 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2025-03-09 06:49:40,066 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:40,066 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:40,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:40,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:40,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:40,095 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:40,095 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:40,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:40,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:40,097 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) [2025-03-09 06:49:40,098 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 [2025-03-09 06:49:40,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:40,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:40,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:40,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:40,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:40,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:40,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:40,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:40,112 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:40,114 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:49:40,114 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:49:40,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:40,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:40,117 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) [2025-03-09 06:49:40,118 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 [2025-03-09 06:49:40,119 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:40,119 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:40,119 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:40,119 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 [] [2025-03-09 06:49:40,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:40,126 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:40,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:40,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 06:49:40,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 06:49:40,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:40,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:40,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:49:40,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:40,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 06:49:40,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 06:49:40,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:40,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:40,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:49:40,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 06:49:40,527 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 [2025-03-09 06:49:40,527 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5641 states and 8650 transitions. cyclomatic complexity: 3102 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:49:40,572 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5641 states and 8650 transitions. cyclomatic complexity: 3102. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 5659 states and 8670 transitions. Complement of second has 9 states. [2025-03-09 06:49:40,572 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 [2025-03-09 06:49:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:49:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-09 06:49:40,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 74 letters. Loop has 29 letters. [2025-03-09 06:49:40,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:40,573 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:40,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:40,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 06:49:40,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 06:49:40,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:40,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:40,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:49:40,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:40,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 06:49:40,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 06:49:40,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:40,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:40,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:49:40,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 06:49:40,973 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 [2025-03-09 06:49:40,973 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5641 states and 8650 transitions. cyclomatic complexity: 3102 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:49:41,007 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5641 states and 8650 transitions. cyclomatic complexity: 3102. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 5659 states and 8670 transitions. Complement of second has 9 states. [2025-03-09 06:49:41,008 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 [2025-03-09 06:49:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:49:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-09 06:49:41,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 74 letters. Loop has 29 letters. [2025-03-09 06:49:41,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:41,008 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:41,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:41,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 06:49:41,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 06:49:41,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:41,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:41,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:49:41,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:41,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 06:49:41,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 06:49:41,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:41,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:41,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:49:41,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 06:49:41,371 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 [2025-03-09 06:49:41,371 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5641 states and 8650 transitions. cyclomatic complexity: 3102 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:49:41,502 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5641 states and 8650 transitions. cyclomatic complexity: 3102. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 11260 states and 17279 transitions. Complement of second has 10 states. [2025-03-09 06:49:41,503 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 [2025-03-09 06:49:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:49:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2025-03-09 06:49:41,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 74 letters. Loop has 29 letters. [2025-03-09 06:49:41,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:41,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 103 letters. Loop has 29 letters. [2025-03-09 06:49:41,504 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 [2025-03-09 06:49:41,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:41,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 74 letters. Loop has 58 letters. [2025-03-09 06:49:41,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:41,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11260 states and 17279 transitions. [2025-03-09 06:49:41,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-09 06:49:41,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11260 states to 5641 states and 8650 transitions. [2025-03-09 06:49:41,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2025-03-09 06:49:41,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2025-03-09 06:49:41,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5641 states and 8650 transitions. [2025-03-09 06:49:41,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:41,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5641 states and 8650 transitions. [2025-03-09 06:49:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states and 8650 transitions. [2025-03-09 06:49:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 5641. [2025-03-09 06:49:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 3552 states have (on average 1.2148085585585586) internal successors, (4315), 4050 states have internal predecessors, (4315), 1424 states have call successors, (1468), 730 states have call predecessors, (1468), 665 states have return successors, (2867), 860 states have call predecessors, (2867), 1424 states have call successors, (2867) [2025-03-09 06:49:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 8650 transitions. [2025-03-09 06:49:41,652 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5641 states and 8650 transitions. [2025-03-09 06:49:41,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:41,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:49:41,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:49:41,653 INFO L87 Difference]: Start difference. First operand 5641 states and 8650 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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) [2025-03-09 06:49:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:41,721 INFO L93 Difference]: Finished difference Result 3886 states and 5776 transitions. [2025-03-09 06:49:41,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3886 states and 5776 transitions. [2025-03-09 06:49:41,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-09 06:49:41,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3886 states to 3805 states and 5670 transitions. [2025-03-09 06:49:41,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2025-03-09 06:49:41,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2025-03-09 06:49:41,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3805 states and 5670 transitions. [2025-03-09 06:49:41,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:41,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3805 states and 5670 transitions. [2025-03-09 06:49:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states and 5670 transitions. [2025-03-09 06:49:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3737. [2025-03-09 06:49:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3737 states, 2357 states have (on average 1.196011879507849) internal successors, (2819), 2660 states have internal predecessors, (2819), 917 states have call successors, (953), 477 states have call predecessors, (953), 463 states have return successors, (1779), 599 states have call predecessors, (1779), 917 states have call successors, (1779) [2025-03-09 06:49:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 5551 transitions. [2025-03-09 06:49:41,800 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3737 states and 5551 transitions. [2025-03-09 06:49:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:49:41,801 INFO L432 stractBuchiCegarLoop]: Abstraction has 3737 states and 5551 transitions. [2025-03-09 06:49:41,801 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-09 06:49:41,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3737 states and 5551 transitions. [2025-03-09 06:49:41,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-09 06:49:41,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:41,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:41,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [30, 30, 19, 13, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:49:41,807 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] [2025-03-09 06:49:41,807 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:41,808 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:41,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:41,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1480852247, now seen corresponding path program 4 times [2025-03-09 06:49:41,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:41,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347401138] [2025-03-09 06:49:41,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:41,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:41,813 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 213 statements into 2 equivalence classes. [2025-03-09 06:49:41,822 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-09 06:49:41,822 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:41,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2203 backedges. 230 proven. 191 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [2025-03-09 06:49:41,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:41,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347401138] [2025-03-09 06:49:41,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347401138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:41,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738352677] [2025-03-09 06:49:41,947 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:41,949 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:41,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2025-03-09 06:49:41,987 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 213 statements into 2 equivalence classes. [2025-03-09 06:49:42,028 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-09 06:49:42,028 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:42,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:42,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:49:42,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2203 backedges. 230 proven. 191 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [2025-03-09 06:49:42,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2203 backedges. 230 proven. 193 refuted. 0 times theorem prover too weak. 1780 trivial. 0 not checked. [2025-03-09 06:49:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738352677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:42,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:42,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2025-03-09 06:49:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129408942] [2025-03-09 06:49:42,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:42,562 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:42,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:42,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1240692240, now seen corresponding path program 1 times [2025-03-09 06:49:42,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:42,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752212662] [2025-03-09 06:49:42,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:42,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:42,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 06:49:42,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 06:49:42,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:42,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:42,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:42,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 06:49:42,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 06:49:42,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:42,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:42,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:42,965 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:42,965 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:42,965 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:42,965 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:42,965 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:42,965 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:42,965 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:42,965 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:42,965 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration19_Loop [2025-03-09 06:49:42,965 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:42,965 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:42,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:42,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:42,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:42,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:42,990 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:42,990 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:42,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:42,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:42,992 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:42,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-09 06:49:42,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:42,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:43,004 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:43,004 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: [] [2025-03-09 06:49:43,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-09 06:49:43,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:43,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:43,011 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) [2025-03-09 06:49:43,013 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 [2025-03-09 06:49:43,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:43,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:43,030 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:43,031 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: [] [2025-03-09 06:49:43,036 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 [2025-03-09 06:49:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:43,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:43,038 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) [2025-03-09 06:49:43,038 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 [2025-03-09 06:49:43,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:43,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:43,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-09 06:49:43,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:43,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:43,056 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) [2025-03-09 06:49:43,057 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 [2025-03-09 06:49:43,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:43,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:43,069 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:43,074 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 [2025-03-09 06:49:43,074 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:43,074 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:43,074 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:43,074 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:43,074 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:43,074 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:43,074 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:43,074 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:43,074 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration19_Loop [2025-03-09 06:49:43,074 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:43,074 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:43,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:43,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:43,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:43,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:43,100 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:43,100 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:43,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:43,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:43,102 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) [2025-03-09 06:49:43,103 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 [2025-03-09 06:49:43,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:43,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:43,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:43,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:43,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:43,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:43,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:43,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:43,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:43,121 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 [2025-03-09 06:49:43,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:43,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:43,123 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) [2025-03-09 06:49:43,123 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 [2025-03-09 06:49:43,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:43,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:43,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:43,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:43,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:43,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:43,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:43,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:43,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:43,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-03-09 06:49:43,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:43,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:43,144 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) [2025-03-09 06:49:43,144 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 [2025-03-09 06:49:43,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:43,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:43,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:43,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:43,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:43,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:43,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:43,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:43,157 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:43,158 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:43,158 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:43,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:43,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:43,161 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) [2025-03-09 06:49:43,161 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 [2025-03-09 06:49:43,162 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:43,162 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:43,162 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:43,162 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 [] [2025-03-09 06:49:43,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:43,167 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:43,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:43,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-09 06:49:43,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-09 06:49:43,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:43,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:43,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-09 06:49:43,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:44,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 06:49:44,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 06:49:44,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:44,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:44,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:49:44,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 14 proven. 47 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 06:49:44,423 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 [2025-03-09 06:49:44,423 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3737 states and 5551 transitions. cyclomatic complexity: 1873 Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 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) [2025-03-09 06:49:44,663 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3737 states and 5551 transitions. cyclomatic complexity: 1873. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 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 8138 states and 12445 transitions. Complement of second has 67 states. [2025-03-09 06:49:44,664 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 [2025-03-09 06:49:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 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) [2025-03-09 06:49:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2025-03-09 06:49:44,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 73 transitions. Stem has 213 letters. Loop has 60 letters. [2025-03-09 06:49:44,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:44,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 73 transitions. Stem has 273 letters. Loop has 60 letters. [2025-03-09 06:49:44,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:44,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 73 transitions. Stem has 213 letters. Loop has 120 letters. [2025-03-09 06:49:44,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:44,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8138 states and 12445 transitions. [2025-03-09 06:49:44,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-03-09 06:49:44,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8138 states to 8110 states and 12417 transitions. [2025-03-09 06:49:44,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 336 [2025-03-09 06:49:44,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 336 [2025-03-09 06:49:44,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8110 states and 12417 transitions. [2025-03-09 06:49:44,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:44,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8110 states and 12417 transitions. [2025-03-09 06:49:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8110 states and 12417 transitions. [2025-03-09 06:49:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8110 to 7576. [2025-03-09 06:49:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7576 states, 4754 states have (on average 1.1912074042911234) internal successors, (5663), 5372 states have internal predecessors, (5663), 1868 states have call successors, (1940), 959 states have call predecessors, (1940), 954 states have return successors, (3595), 1244 states have call predecessors, (3595), 1868 states have call successors, (3595) [2025-03-09 06:49:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7576 states to 7576 states and 11198 transitions. [2025-03-09 06:49:44,874 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7576 states and 11198 transitions. [2025-03-09 06:49:44,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:49:44,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:49:44,875 INFO L87 Difference]: Start difference. First operand 7576 states and 11198 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 06:49:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:45,108 INFO L93 Difference]: Finished difference Result 9084 states and 15360 transitions. [2025-03-09 06:49:45,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9084 states and 15360 transitions. [2025-03-09 06:49:45,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-09 06:49:45,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9084 states to 7167 states and 10935 transitions. [2025-03-09 06:49:45,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2025-03-09 06:49:45,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2025-03-09 06:49:45,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7167 states and 10935 transitions. [2025-03-09 06:49:45,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:45,190 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7167 states and 10935 transitions. [2025-03-09 06:49:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7167 states and 10935 transitions. [2025-03-09 06:49:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7167 to 5731. [2025-03-09 06:49:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5731 states, 3575 states have (on average 1.1563636363636363) internal successors, (4134), 3937 states have internal predecessors, (4134), 1342 states have call successors, (1408), 665 states have call predecessors, (1408), 814 states have return successors, (2519), 1128 states have call predecessors, (2519), 1342 states have call successors, (2519) [2025-03-09 06:49:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5731 states to 5731 states and 8061 transitions. [2025-03-09 06:49:45,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5731 states and 8061 transitions. [2025-03-09 06:49:45,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:49:45,271 INFO L432 stractBuchiCegarLoop]: Abstraction has 5731 states and 8061 transitions. [2025-03-09 06:49:45,271 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-09 06:49:45,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5731 states and 8061 transitions. [2025-03-09 06:49:45,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-09 06:49:45,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:45,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:45,280 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] [2025-03-09 06:49:45,280 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 13, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1] [2025-03-09 06:49:45,280 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:45,280 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:45,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:45,281 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 5 times [2025-03-09 06:49:45,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:45,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647747465] [2025-03-09 06:49:45,281 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:45,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:45,284 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 85 statements into 5 equivalence classes. [2025-03-09 06:49:45,289 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:45,290 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-09 06:49:45,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:45,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:45,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 06:49:45,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:45,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:45,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:45,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:45,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1508663746, now seen corresponding path program 2 times [2025-03-09 06:49:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733997585] [2025-03-09 06:49:45,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:45,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-09 06:49:45,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 06:49:45,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:45,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:45,385 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 [2025-03-09 06:49:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 82 proven. 137 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2025-03-09 06:49:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733997585] [2025-03-09 06:49:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733997585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969217888] [2025-03-09 06:49:45,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:45,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:45,535 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:45,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2025-03-09 06:49:45,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-09 06:49:45,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-09 06:49:45,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:45,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:45,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:49:45,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 328 proven. 106 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-03-09 06:49:45,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 82 proven. 191 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-09 06:49:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969217888] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:46,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 27 [2025-03-09 06:49:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316307544] [2025-03-09 06:49:46,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:46,009 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:46,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 06:49:46,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-03-09 06:49:46,009 INFO L87 Difference]: Start difference. First operand 5731 states and 8061 transitions. cyclomatic complexity: 2419 Second operand has 27 states, 25 states have (on average 3.04) internal successors, (76), 24 states have internal predecessors, (76), 17 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (27), 11 states have call predecessors, (27), 17 states have call successors, (27) [2025-03-09 06:49:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:46,588 INFO L93 Difference]: Finished difference Result 7883 states and 12101 transitions. [2025-03-09 06:49:46,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7883 states and 12101 transitions. [2025-03-09 06:49:46,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-03-09 06:49:46,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7883 states to 7831 states and 12017 transitions. [2025-03-09 06:49:46,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2025-03-09 06:49:46,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2025-03-09 06:49:46,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7831 states and 12017 transitions. [2025-03-09 06:49:46,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:46,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7831 states and 12017 transitions. [2025-03-09 06:49:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7831 states and 12017 transitions. [2025-03-09 06:49:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7831 to 6681. [2025-03-09 06:49:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6681 states, 4143 states have (on average 1.1489258991069273) internal successors, (4760), 4549 states have internal predecessors, (4760), 1574 states have call successors, (1656), 743 states have call predecessors, (1656), 964 states have return successors, (3415), 1388 states have call predecessors, (3415), 1574 states have call successors, (3415) [2025-03-09 06:49:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 9831 transitions. [2025-03-09 06:49:46,753 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6681 states and 9831 transitions. [2025-03-09 06:49:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 06:49:46,753 INFO L432 stractBuchiCegarLoop]: Abstraction has 6681 states and 9831 transitions. [2025-03-09 06:49:46,753 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-09 06:49:46,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6681 states and 9831 transitions. [2025-03-09 06:49:46,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-09 06:49:46,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:46,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:46,763 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] [2025-03-09 06:49:46,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:46,764 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:46,764 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:46,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:46,764 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 6 times [2025-03-09 06:49:46,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:46,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029846149] [2025-03-09 06:49:46,764 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:46,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:46,767 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 85 statements into 5 equivalence classes. [2025-03-09 06:49:46,773 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:46,773 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-09 06:49:46,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:46,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:46,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 06:49:46,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:46,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:46,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:46,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:46,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:46,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2050828688, now seen corresponding path program 3 times [2025-03-09 06:49:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:46,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210645940] [2025-03-09 06:49:46,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:46,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 6 equivalence classes. [2025-03-09 06:49:46,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 81 of 109 statements. [2025-03-09 06:49:46,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:49:46,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 89 proven. 41 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-03-09 06:49:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210645940] [2025-03-09 06:49:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210645940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893226418] [2025-03-09 06:49:46,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:46,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:46,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:46,811 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) [2025-03-09 06:49:46,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-03-09 06:49:46,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 6 equivalence classes. [2025-03-09 06:49:46,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 81 of 109 statements. [2025-03-09 06:49:46,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:49:46,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:46,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:46,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-09 06:49:46,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:49:46,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893226418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:46,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:49:46,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-09 06:49:46,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768284390] [2025-03-09 06:49:46,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:46,868 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:46,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:46,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:49:46,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:49:46,868 INFO L87 Difference]: Start difference. First operand 6681 states and 9831 transitions. cyclomatic complexity: 3255 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-09 06:49:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:46,924 INFO L93 Difference]: Finished difference Result 6011 states and 8267 transitions. [2025-03-09 06:49:46,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6011 states and 8267 transitions. [2025-03-09 06:49:46,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-09 06:49:46,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6011 states to 4298 states and 6002 transitions. [2025-03-09 06:49:46,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2025-03-09 06:49:46,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2025-03-09 06:49:46,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4298 states and 6002 transitions. [2025-03-09 06:49:46,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:46,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4298 states and 6002 transitions. [2025-03-09 06:49:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states and 6002 transitions. [2025-03-09 06:49:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4170. [2025-03-09 06:49:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 2640 states have (on average 1.106818181818182) internal successors, (2922), 2814 states have internal predecessors, (2922), 929 states have call successors, (1009), 492 states have call predecessors, (1009), 601 states have return successors, (1795), 863 states have call predecessors, (1795), 929 states have call successors, (1795) [2025-03-09 06:49:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 5726 transitions. [2025-03-09 06:49:47,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4170 states and 5726 transitions. [2025-03-09 06:49:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:49:47,014 INFO L432 stractBuchiCegarLoop]: Abstraction has 4170 states and 5726 transitions. [2025-03-09 06:49:47,014 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-09 06:49:47,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4170 states and 5726 transitions. [2025-03-09 06:49:47,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-09 06:49:47,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:47,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:47,023 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] [2025-03-09 06:49:47,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 13, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:47,023 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:47,023 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:47,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 7 times [2025-03-09 06:49:47,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:47,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858070751] [2025-03-09 06:49:47,024 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:47,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 06:49:47,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:47,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:47,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:47,031 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:47,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 06:49:47,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:47,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:47,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:47,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:47,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash -834396815, now seen corresponding path program 4 times [2025-03-09 06:49:47,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:47,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314378515] [2025-03-09 06:49:47,038 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:47,041 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 122 statements into 2 equivalence classes. [2025-03-09 06:49:47,047 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 06:49:47,047 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:47,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 181 proven. 144 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-03-09 06:49:47,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:47,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314378515] [2025-03-09 06:49:47,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314378515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:47,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474901780] [2025-03-09 06:49:47,159 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:47,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:47,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:47,161 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) [2025-03-09 06:49:47,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2025-03-09 06:49:47,194 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 122 statements into 2 equivalence classes. [2025-03-09 06:49:47,214 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 06:49:47,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:47,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:47,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:49:47,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 181 proven. 144 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-03-09 06:49:47,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 181 proven. 147 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-09 06:49:47,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474901780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:47,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:47,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 18 [2025-03-09 06:49:47,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954567225] [2025-03-09 06:49:47,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:47,601 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:47,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:49:47,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:49:47,601 INFO L87 Difference]: Start difference. First operand 4170 states and 5726 transitions. cyclomatic complexity: 1632 Second operand has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 11 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-09 06:49:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:47,923 INFO L93 Difference]: Finished difference Result 5421 states and 8190 transitions. [2025-03-09 06:49:47,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5421 states and 8190 transitions. [2025-03-09 06:49:47,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-09 06:49:47,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5421 states to 3665 states and 5326 transitions. [2025-03-09 06:49:47,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2025-03-09 06:49:47,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2025-03-09 06:49:47,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3665 states and 5326 transitions. [2025-03-09 06:49:47,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:47,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3665 states and 5326 transitions. [2025-03-09 06:49:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states and 5326 transitions. [2025-03-09 06:49:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 2676. [2025-03-09 06:49:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2676 states, 1722 states have (on average 1.1068524970963995) internal successors, (1906), 1843 states have internal predecessors, (1906), 595 states have call successors, (652), 341 states have call predecessors, (652), 359 states have return successors, (837), 491 states have call predecessors, (837), 595 states have call successors, (837) [2025-03-09 06:49:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3395 transitions. [2025-03-09 06:49:47,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2676 states and 3395 transitions. [2025-03-09 06:49:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:49:47,996 INFO L432 stractBuchiCegarLoop]: Abstraction has 2676 states and 3395 transitions. [2025-03-09 06:49:47,996 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-09 06:49:47,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2676 states and 3395 transitions. [2025-03-09 06:49:47,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-09 06:49:47,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:47,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:48,000 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] [2025-03-09 06:49:48,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 13, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:48,000 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:48,000 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:48,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:48,000 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 8 times [2025-03-09 06:49:48,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:48,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087311950] [2025-03-09 06:49:48,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:48,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:48,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-03-09 06:49:48,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:48,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:48,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:48,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:48,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 06:49:48,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:48,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:48,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:48,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:48,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1175339157, now seen corresponding path program 5 times [2025-03-09 06:49:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:48,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977497493] [2025-03-09 06:49:48,013 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:48,016 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 122 statements into 7 equivalence classes. [2025-03-09 06:49:48,022 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 114 of 122 statements. [2025-03-09 06:49:48,022 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 06:49:48,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 81 proven. 76 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-09 06:49:48,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:48,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977497493] [2025-03-09 06:49:48,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977497493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:48,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686811246] [2025-03-09 06:49:48,079 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:48,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:48,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:48,081 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) [2025-03-09 06:49:48,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2025-03-09 06:49:48,115 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 122 statements into 7 equivalence classes. [2025-03-09 06:49:48,137 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 114 of 122 statements. [2025-03-09 06:49:48,137 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 06:49:48,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:48,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:49:48,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 450 proven. 54 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-03-09 06:49:48,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 81 proven. 239 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-09 06:49:48,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686811246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:48,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:48,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 15] total 24 [2025-03-09 06:49:48,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778979273] [2025-03-09 06:49:48,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:48,602 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:48,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:48,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 06:49:48,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-03-09 06:49:48,603 INFO L87 Difference]: Start difference. First operand 2676 states and 3395 transitions. cyclomatic complexity: 770 Second operand has 24 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 15 states have call successors, (24), 2 states have call predecessors, (24), 8 states have return successors, (25), 12 states have call predecessors, (25), 15 states have call successors, (25) [2025-03-09 06:49:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:49,190 INFO L93 Difference]: Finished difference Result 3182 states and 4301 transitions. [2025-03-09 06:49:49,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3182 states and 4301 transitions. [2025-03-09 06:49:49,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-09 06:49:49,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3182 states to 1501 states and 1950 transitions. [2025-03-09 06:49:49,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2025-03-09 06:49:49,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2025-03-09 06:49:49,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1501 states and 1950 transitions. [2025-03-09 06:49:49,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:49,204 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1501 states and 1950 transitions. [2025-03-09 06:49:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states and 1950 transitions. [2025-03-09 06:49:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1188. [2025-03-09 06:49:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 780 states have (on average 1.091025641025641) internal successors, (851), 825 states have internal predecessors, (851), 246 states have call successors, (262), 151 states have call predecessors, (262), 162 states have return successors, (341), 211 states have call predecessors, (341), 246 states have call successors, (341) [2025-03-09 06:49:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1454 transitions. [2025-03-09 06:49:49,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1188 states and 1454 transitions. [2025-03-09 06:49:49,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 06:49:49,216 INFO L432 stractBuchiCegarLoop]: Abstraction has 1188 states and 1454 transitions. [2025-03-09 06:49:49,216 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-09 06:49:49,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1188 states and 1454 transitions. [2025-03-09 06:49:49,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-09 06:49:49,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:49,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:49,219 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] [2025-03-09 06:49:49,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [26, 26, 20, 12, 10, 10, 10, 10, 10, 10, 8, 6, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1] [2025-03-09 06:49:49,219 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:49,219 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:49,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 9 times [2025-03-09 06:49:49,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:49,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582235170] [2025-03-09 06:49:49,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:49,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:49,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 5 equivalence classes. [2025-03-09 06:49:49,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:49,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 06:49:49,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:49,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:49,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 06:49:49,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:49,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:49,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:49,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:49,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:49,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1583174235, now seen corresponding path program 6 times [2025-03-09 06:49:49,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:49,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000929722] [2025-03-09 06:49:49,233 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:49,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:49,237 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 184 statements into 11 equivalence classes. [2025-03-09 06:49:49,260 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 164 of 184 statements. [2025-03-09 06:49:49,261 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-09 06:49:49,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1715 backedges. 445 proven. 35 refuted. 0 times theorem prover too weak. 1235 trivial. 0 not checked. [2025-03-09 06:49:49,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:49,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000929722] [2025-03-09 06:49:49,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000929722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999566690] [2025-03-09 06:49:49,328 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:49,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:49,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:49,330 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) [2025-03-09 06:49:49,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-03-09 06:49:49,368 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 184 statements into 11 equivalence classes. [2025-03-09 06:49:49,399 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 164 of 184 statements. [2025-03-09 06:49:49,399 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-09 06:49:49,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:49,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:49,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1715 backedges. 441 proven. 39 refuted. 0 times theorem prover too weak. 1235 trivial. 0 not checked. [2025-03-09 06:49:49,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1715 backedges. 441 proven. 41 refuted. 0 times theorem prover too weak. 1233 trivial. 0 not checked. [2025-03-09 06:49:49,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999566690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:49,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:49,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 12 [2025-03-09 06:49:49,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424334471] [2025-03-09 06:49:49,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:49,775 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:49,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:49,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:49:49,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:49:49,776 INFO L87 Difference]: Start difference. First operand 1188 states and 1454 transitions. cyclomatic complexity: 288 Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-09 06:49:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:49,855 INFO L93 Difference]: Finished difference Result 1341 states and 1663 transitions. [2025-03-09 06:49:49,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1341 states and 1663 transitions. [2025-03-09 06:49:49,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-09 06:49:49,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1341 states to 1141 states and 1389 transitions. [2025-03-09 06:49:49,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2025-03-09 06:49:49,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2025-03-09 06:49:49,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1141 states and 1389 transitions. [2025-03-09 06:49:49,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:49,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1141 states and 1389 transitions. [2025-03-09 06:49:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states and 1389 transitions. [2025-03-09 06:49:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1058. [2025-03-09 06:49:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 706 states have (on average 1.0807365439093484) internal successors, (763), 741 states have internal predecessors, (763), 207 states have call successors, (217), 134 states have call predecessors, (217), 145 states have return successors, (294), 182 states have call predecessors, (294), 207 states have call successors, (294) [2025-03-09 06:49:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1274 transitions. [2025-03-09 06:49:49,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1058 states and 1274 transitions. [2025-03-09 06:49:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:49:49,873 INFO L432 stractBuchiCegarLoop]: Abstraction has 1058 states and 1274 transitions. [2025-03-09 06:49:49,873 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-09 06:49:49,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1058 states and 1274 transitions. [2025-03-09 06:49:49,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-09 06:49:49,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:49,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:49,877 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] [2025-03-09 06:49:49,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 19, 11, 9, 9, 9, 9, 9, 9, 8, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1] [2025-03-09 06:49:49,880 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:49,880 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:49,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 10 times [2025-03-09 06:49:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128729345] [2025-03-09 06:49:49,881 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:49,883 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-03-09 06:49:49,887 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:49,887 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:49,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:49,887 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:49,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 06:49:49,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:49,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:49,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:49,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:49,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1843768954, now seen corresponding path program 7 times [2025-03-09 06:49:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:49,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849863416] [2025-03-09 06:49:49,895 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:49,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-09 06:49:49,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-09 06:49:49,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:49,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 336 proven. 371 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2025-03-09 06:49:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849863416] [2025-03-09 06:49:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849863416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575060617] [2025-03-09 06:49:50,148 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:50,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:50,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:50,150 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) [2025-03-09 06:49:50,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2025-03-09 06:49:50,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-09 06:49:50,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-09 06:49:50,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:50,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:50,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:49:50,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 342 proven. 361 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2025-03-09 06:49:50,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 337 proven. 382 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2025-03-09 06:49:51,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575060617] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:51,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:51,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 26 [2025-03-09 06:49:51,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890241998] [2025-03-09 06:49:51,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:51,231 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:51,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:51,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 06:49:51,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2025-03-09 06:49:51,231 INFO L87 Difference]: Start difference. First operand 1058 states and 1274 transitions. cyclomatic complexity: 236 Second operand has 27 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 21 states have call successors, (26), 1 states have call predecessors, (26), 8 states have return successors, (31), 12 states have call predecessors, (31), 21 states have call successors, (31) [2025-03-09 06:49:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:51,818 INFO L93 Difference]: Finished difference Result 1412 states and 1835 transitions. [2025-03-09 06:49:51,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1412 states and 1835 transitions. [2025-03-09 06:49:51,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2025-03-09 06:49:51,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1412 states to 1412 states and 1833 transitions. [2025-03-09 06:49:51,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 291 [2025-03-09 06:49:51,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2025-03-09 06:49:51,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1412 states and 1833 transitions. [2025-03-09 06:49:51,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:51,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1412 states and 1833 transitions. [2025-03-09 06:49:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states and 1833 transitions. [2025-03-09 06:49:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1143. [2025-03-09 06:49:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 759 states have (on average 1.075098814229249) internal successors, (816), 793 states have internal predecessors, (816), 219 states have call successors, (230), 137 states have call predecessors, (230), 165 states have return successors, (372), 212 states have call predecessors, (372), 219 states have call successors, (372) [2025-03-09 06:49:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1418 transitions. [2025-03-09 06:49:51,836 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1143 states and 1418 transitions. [2025-03-09 06:49:51,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 06:49:51,836 INFO L432 stractBuchiCegarLoop]: Abstraction has 1143 states and 1418 transitions. [2025-03-09 06:49:51,836 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-09 06:49:51,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1143 states and 1418 transitions. [2025-03-09 06:49:51,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-03-09 06:49:51,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:51,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:51,839 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] [2025-03-09 06:49:51,839 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] [2025-03-09 06:49:51,839 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:51,839 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:51,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 11 times [2025-03-09 06:49:51,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:51,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745403164] [2025-03-09 06:49:51,840 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:51,842 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 85 statements into 5 equivalence classes. [2025-03-09 06:49:51,847 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:51,847 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-09 06:49:51,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:51,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 06:49:51,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:51,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:51,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:51,853 INFO L85 PathProgramCache]: Analyzing trace with hash -672660034, now seen corresponding path program 8 times [2025-03-09 06:49:51,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:51,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684703179] [2025-03-09 06:49:51,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:51,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:51,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-03-09 06:49:51,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-03-09 06:49:51,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:51,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:51,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-09 06:49:51,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-09 06:49:51,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:51,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:51,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:51,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:51,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1279671858, now seen corresponding path program 12 times [2025-03-09 06:49:51,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:51,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661243293] [2025-03-09 06:49:51,878 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:51,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:51,883 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 234 statements into 9 equivalence classes. [2025-03-09 06:49:51,896 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 195 of 234 statements. [2025-03-09 06:49:51,897 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-09 06:49:51,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 196 proven. 203 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2025-03-09 06:49:52,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:52,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661243293] [2025-03-09 06:49:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661243293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:52,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414942852] [2025-03-09 06:49:52,033 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:49:52,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:52,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:52,036 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) [2025-03-09 06:49:52,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2025-03-09 06:49:52,087 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 234 statements into 9 equivalence classes. [2025-03-09 06:49:52,124 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 195 of 234 statements. [2025-03-09 06:49:52,125 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-09 06:49:52,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:52,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:49:52,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 1142 proven. 125 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2025-03-09 06:49:52,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 179 proven. 194 refuted. 0 times theorem prover too weak. 2195 trivial. 0 not checked. [2025-03-09 06:49:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414942852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:52,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:52,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 34 [2025-03-09 06:49:52,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845284231] [2025-03-09 06:49:52,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:53,703 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:53,703 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:53,703 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:53,703 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:53,703 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:53,703 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,703 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:53,703 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:53,703 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration26_Loop [2025-03-09 06:49:53,703 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:53,703 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:53,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:53,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:53,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:53,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:53,730 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:53,730 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:53,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:53,732 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:53,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-09 06:49:53,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:53,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:53,751 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:53,751 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=3, ULTIMATE.start_main_~q~0#1=3} Honda state: {ULTIMATE.start_main_~x~0#1=3, ULTIMATE.start_main_~q~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:53,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-03-09 06:49:53,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:53,758 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:53,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-09 06:49:53,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:53,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:53,770 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:53,770 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: [] [2025-03-09 06:49:53,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:53,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:53,777 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:53,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-03-09 06:49:53,779 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:53,779 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:53,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-09 06:49:53,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:53,796 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) [2025-03-09 06:49:53,796 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 [2025-03-09 06:49:53,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:53,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:53,808 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:53,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-03-09 06:49:53,813 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:53,813 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:53,813 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:53,813 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:53,813 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:53,813 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,813 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:53,813 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:53,813 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration26_Loop [2025-03-09 06:49:53,813 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:53,813 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:53,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:53,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:53,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:53,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:53,850 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:53,850 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:53,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:53,852 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) [2025-03-09 06:49:53,852 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 [2025-03-09 06:49:53,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:53,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:53,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:53,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:53,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:53,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:53,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:53,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:53,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:53,869 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 [2025-03-09 06:49:53,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:53,871 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) [2025-03-09 06:49:53,872 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 [2025-03-09 06:49:53,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:53,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:53,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:53,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:53,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:53,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:53,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:53,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:53,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:53,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:53,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:53,890 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) [2025-03-09 06:49:53,891 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 [2025-03-09 06:49:53,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:53,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:53,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:53,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:53,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:53,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:53,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:53,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:53,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:53,907 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 [2025-03-09 06:49:53,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:53,909 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) [2025-03-09 06:49:53,910 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 [2025-03-09 06:49:53,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:53,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:53,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:53,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:53,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:53,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:53,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:53,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:53,922 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:53,923 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:53,923 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:53,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:53,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:53,925 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) [2025-03-09 06:49:53,926 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 [2025-03-09 06:49:53,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:53,927 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:53,927 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:53,927 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 3 Supporting invariants [] [2025-03-09 06:49:53,932 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 [2025-03-09 06:49:53,932 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:53,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:53,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 06:49:53,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 06:49:53,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:53,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:53,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 06:49:53,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:54,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-09 06:49:54,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-09 06:49:54,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:54,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:54,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-09 06:49:54,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 24 proven. 245 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2025-03-09 06:49:54,660 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2025-03-09 06:49:54,660 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1143 states and 1418 transitions. cyclomatic complexity: 295 Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-09 06:49:54,919 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1143 states and 1418 transitions. cyclomatic complexity: 295. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) Result 2775 states and 3556 transitions. Complement of second has 105 states. [2025-03-09 06:49:54,919 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 [2025-03-09 06:49:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-09 06:49:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2025-03-09 06:49:54,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 89 transitions. Stem has 85 letters. Loop has 149 letters. [2025-03-09 06:49:54,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:54,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 89 transitions. Stem has 234 letters. Loop has 149 letters. [2025-03-09 06:49:54,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:54,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 89 transitions. Stem has 85 letters. Loop has 298 letters. [2025-03-09 06:49:54,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:54,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2775 states and 3556 transitions. [2025-03-09 06:49:54,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-03-09 06:49:54,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2775 states to 2522 states and 3258 transitions. [2025-03-09 06:49:54,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2025-03-09 06:49:54,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2025-03-09 06:49:54,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2522 states and 3258 transitions. [2025-03-09 06:49:54,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:54,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2522 states and 3258 transitions. [2025-03-09 06:49:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states and 3258 transitions. [2025-03-09 06:49:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2139. [2025-03-09 06:49:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 1400 states have (on average 1.082857142857143) internal successors, (1516), 1475 states have internal predecessors, (1516), 435 states have call successors, (455), 253 states have call predecessors, (455), 304 states have return successors, (725), 410 states have call predecessors, (725), 435 states have call successors, (725) [2025-03-09 06:49:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2696 transitions. [2025-03-09 06:49:54,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2139 states and 2696 transitions. [2025-03-09 06:49:54,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:54,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 06:49:54,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 06:49:54,964 INFO L87 Difference]: Start difference. First operand 2139 states and 2696 transitions. Second operand has 34 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 32 states have internal predecessors, (98), 21 states have call successors, (29), 2 states have call predecessors, (29), 6 states have return successors, (32), 22 states have call predecessors, (32), 21 states have call successors, (32) [2025-03-09 06:49:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:55,487 INFO L93 Difference]: Finished difference Result 2590 states and 3466 transitions. [2025-03-09 06:49:55,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2590 states and 3466 transitions. [2025-03-09 06:49:55,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-09 06:49:55,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2590 states to 2434 states and 3192 transitions. [2025-03-09 06:49:55,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 211 [2025-03-09 06:49:55,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2025-03-09 06:49:55,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3192 transitions. [2025-03-09 06:49:55,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:55,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3192 transitions. [2025-03-09 06:49:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3192 transitions. [2025-03-09 06:49:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2148. [2025-03-09 06:49:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1405 states have (on average 1.0825622775800712) internal successors, (1521), 1483 states have internal predecessors, (1521), 439 states have call successors, (457), 253 states have call predecessors, (457), 304 states have return successors, (729), 411 states have call predecessors, (729), 439 states have call successors, (729) [2025-03-09 06:49:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 2707 transitions. [2025-03-09 06:49:55,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2148 states and 2707 transitions. [2025-03-09 06:49:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-09 06:49:55,530 INFO L432 stractBuchiCegarLoop]: Abstraction has 2148 states and 2707 transitions. [2025-03-09 06:49:55,530 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-09 06:49:55,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2148 states and 2707 transitions. [2025-03-09 06:49:55,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-03-09 06:49:55,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:55,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:55,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:49:55,534 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 29, 17, 14, 14, 14, 14, 14, 14, 12, 7, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1] [2025-03-09 06:49:55,534 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:55,534 INFO L754 eck$LassoCheckResult]: Loop: "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-09 06:49:55,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:55,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1770408651, now seen corresponding path program 13 times [2025-03-09 06:49:55,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:55,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248467329] [2025-03-09 06:49:55,535 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:49:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:55,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-09 06:49:55,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-09 06:49:55,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:55,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:55,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-09 06:49:55,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-09 06:49:55,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:55,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:55,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash -445736447, now seen corresponding path program 9 times [2025-03-09 06:49:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:55,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134117680] [2025-03-09 06:49:55,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:55,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:55,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 255 statements into 11 equivalence classes. [2025-03-09 06:49:55,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 175 of 255 statements. [2025-03-09 06:49:55,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 06:49:55,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:55,640 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 [2025-03-09 06:49:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3376 backedges. 907 proven. 148 refuted. 0 times theorem prover too weak. 2321 trivial. 0 not checked. [2025-03-09 06:49:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134117680] [2025-03-09 06:49:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134117680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889298369] [2025-03-09 06:49:55,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:55,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:55,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,900 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) [2025-03-09 06:49:55,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2025-03-09 06:49:55,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 255 statements into 11 equivalence classes. [2025-03-09 06:49:55,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 175 of 255 statements. [2025-03-09 06:49:55,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 06:49:55,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:55,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:49:55,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3376 backedges. 911 proven. 141 refuted. 0 times theorem prover too weak. 2324 trivial. 0 not checked. [2025-03-09 06:49:56,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3376 backedges. 902 proven. 153 refuted. 0 times theorem prover too weak. 2321 trivial. 0 not checked. [2025-03-09 06:49:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889298369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:57,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 30 [2025-03-09 06:49:57,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642518018] [2025-03-09 06:49:57,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:57,236 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:57,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 06:49:57,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-03-09 06:49:57,237 INFO L87 Difference]: Start difference. First operand 2148 states and 2707 transitions. cyclomatic complexity: 597 Second operand has 31 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 19 states have call successors, (29), 1 states have call predecessors, (29), 8 states have return successors, (33), 17 states have call predecessors, (33), 19 states have call successors, (33) [2025-03-09 06:49:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:57,942 INFO L93 Difference]: Finished difference Result 2479 states and 2975 transitions. [2025-03-09 06:49:57,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2479 states and 2975 transitions. [2025-03-09 06:49:57,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2025-03-09 06:49:57,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2479 states to 1279 states and 1481 transitions. [2025-03-09 06:49:57,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2025-03-09 06:49:57,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2025-03-09 06:49:57,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1481 transitions. [2025-03-09 06:49:57,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:57,958 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1279 states and 1481 transitions. [2025-03-09 06:49:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1481 transitions. [2025-03-09 06:49:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1126. [2025-03-09 06:49:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 776 states have (on average 1.0515463917525774) internal successors, (816), 801 states have internal predecessors, (816), 199 states have call successors, (212), 142 states have call predecessors, (212), 151 states have return successors, (243), 182 states have call predecessors, (243), 199 states have call successors, (243) [2025-03-09 06:49:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1271 transitions. [2025-03-09 06:49:57,973 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1126 states and 1271 transitions. [2025-03-09 06:49:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-09 06:49:57,973 INFO L432 stractBuchiCegarLoop]: Abstraction has 1126 states and 1271 transitions. [2025-03-09 06:49:57,974 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-09 06:49:57,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1126 states and 1271 transitions. [2025-03-09 06:49:57,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-09 06:49:57,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:57,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:57,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 47, 35, 20, 15, 15, 15, 15, 15, 15, 15, 13, 12, 12, 12, 12, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1] [2025-03-09 06:49:57,978 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 11, 7, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:49:57,978 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:49:57,979 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:49:57,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash -555112648, now seen corresponding path program 14 times [2025-03-09 06:49:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:57,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884279009] [2025-03-09 06:49:57,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:57,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 344 statements into 2 equivalence classes. [2025-03-09 06:49:58,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 344 of 344 statements. [2025-03-09 06:49:58,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:58,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5684 backedges. 332 proven. 531 refuted. 0 times theorem prover too weak. 4821 trivial. 0 not checked. [2025-03-09 06:49:58,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884279009] [2025-03-09 06:49:58,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884279009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50894438] [2025-03-09 06:49:58,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:58,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:58,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:58,232 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:58,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2025-03-09 06:49:58,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 344 statements into 2 equivalence classes. [2025-03-09 06:49:58,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 344 of 344 statements. [2025-03-09 06:49:58,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:58,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:58,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:49:58,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5684 backedges. 3120 proven. 137 refuted. 0 times theorem prover too weak. 2427 trivial. 0 not checked. [2025-03-09 06:49:58,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5684 backedges. 338 proven. 524 refuted. 0 times theorem prover too weak. 4822 trivial. 0 not checked. [2025-03-09 06:49:58,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50894438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:58,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:58,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 13] total 20 [2025-03-09 06:49:58,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222274863] [2025-03-09 06:49:58,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:58,885 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:58,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:58,885 INFO L85 PathProgramCache]: Analyzing trace with hash -292411870, now seen corresponding path program 4 times [2025-03-09 06:49:58,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:58,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921041024] [2025-03-09 06:49:58,886 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:58,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:58,889 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 92 statements into 2 equivalence classes. [2025-03-09 06:49:58,892 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 06:49:58,892 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:58,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 101 proven. 176 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-09 06:49:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921041024] [2025-03-09 06:49:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921041024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220935934] [2025-03-09 06:49:59,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:59,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:59,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:59,042 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:59,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2025-03-09 06:49:59,096 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 92 statements into 2 equivalence classes. [2025-03-09 06:49:59,112 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 06:49:59,113 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:49:59,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:59,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 06:49:59,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 101 proven. 176 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-09 06:49:59,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 92 proven. 187 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-09 06:49:59,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220935934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:59,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:59,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 27 [2025-03-09 06:49:59,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935091410] [2025-03-09 06:49:59,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:59,936 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:59,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:59,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 06:49:59,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-03-09 06:49:59,937 INFO L87 Difference]: Start difference. First operand 1126 states and 1271 transitions. cyclomatic complexity: 159 Second operand has 27 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 16 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (22), 12 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-09 06:50:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:00,419 INFO L93 Difference]: Finished difference Result 1304 states and 1468 transitions. [2025-03-09 06:50:00,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1304 states and 1468 transitions. [2025-03-09 06:50:00,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-09 06:50:00,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1304 states to 1021 states and 1142 transitions. [2025-03-09 06:50:00,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2025-03-09 06:50:00,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2025-03-09 06:50:00,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1021 states and 1142 transitions. [2025-03-09 06:50:00,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:00,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1021 states and 1142 transitions. [2025-03-09 06:50:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states and 1142 transitions. [2025-03-09 06:50:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 978. [2025-03-09 06:50:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 683 states have (on average 1.0380673499267936) internal successors, (709), 700 states have internal predecessors, (709), 164 states have call successors, (177), 124 states have call predecessors, (177), 131 states have return successors, (202), 153 states have call predecessors, (202), 164 states have call successors, (202) [2025-03-09 06:50:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1088 transitions. [2025-03-09 06:50:00,431 INFO L240 hiAutomatonCegarLoop]: Abstraction has 978 states and 1088 transitions. [2025-03-09 06:50:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 06:50:00,432 INFO L432 stractBuchiCegarLoop]: Abstraction has 978 states and 1088 transitions. [2025-03-09 06:50:00,432 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-09 06:50:00,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 978 states and 1088 transitions. [2025-03-09 06:50:00,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-09 06:50:00,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:00,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:00,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 34, 19, 15, 15, 15, 15, 15, 15, 15, 13, 12, 12, 12, 12, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1] [2025-03-09 06:50:00,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 8, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:50:00,434 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:50:00,435 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:50:00,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1374182318, now seen corresponding path program 15 times [2025-03-09 06:50:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:00,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359288571] [2025-03-09 06:50:00,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:50:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:00,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 336 statements into 14 equivalence classes. [2025-03-09 06:50:00,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 231 of 336 statements. [2025-03-09 06:50:00,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:50:00,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5439 backedges. 1055 proven. 485 refuted. 0 times theorem prover too weak. 3899 trivial. 0 not checked. [2025-03-09 06:50:00,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:00,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359288571] [2025-03-09 06:50:00,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359288571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:00,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272711672] [2025-03-09 06:50:00,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:50:00,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:00,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:00,697 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:00,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2025-03-09 06:50:00,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 336 statements into 14 equivalence classes. [2025-03-09 06:50:00,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 231 of 336 statements. [2025-03-09 06:50:00,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:50:00,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:00,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:50:00,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5439 backedges. 501 proven. 555 refuted. 0 times theorem prover too weak. 4383 trivial. 0 not checked. [2025-03-09 06:50:00,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5439 backedges. 499 proven. 559 refuted. 0 times theorem prover too weak. 4381 trivial. 0 not checked. [2025-03-09 06:50:01,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272711672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:01,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:01,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 35 [2025-03-09 06:50:01,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504785341] [2025-03-09 06:50:01,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:01,544 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:50:01,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1499734953, now seen corresponding path program 5 times [2025-03-09 06:50:01,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:01,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075210636] [2025-03-09 06:50:01,544 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:50:01,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:01,547 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 105 statements into 11 equivalence classes. [2025-03-09 06:50:01,554 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:01,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 06:50:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:01,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:01,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:01,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:01,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:01,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:01,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:02,372 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:02,372 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:02,372 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:02,372 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:02,372 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:50:02,372 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:02,372 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:02,372 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:02,372 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration29_Loop [2025-03-09 06:50:02,372 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:02,372 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:02,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:02,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:02,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:02,393 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:02,393 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:50:02,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:02,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:02,396 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) [2025-03-09 06:50:02,396 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 [2025-03-09 06:50:02,397 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:02,397 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:02,407 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:02,407 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: [] [2025-03-09 06:50:02,413 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 [2025-03-09 06:50:02,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:02,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:02,415 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) [2025-03-09 06:50:02,415 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 [2025-03-09 06:50:02,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:02,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:02,433 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 [2025-03-09 06:50:02,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:02,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:02,435 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) [2025-03-09 06:50:02,436 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 [2025-03-09 06:50:02,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:50:02,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:02,468 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:50:02,472 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 [2025-03-09 06:50:02,472 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:02,472 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:02,473 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:02,473 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:02,473 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:50:02,473 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:02,473 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:02,473 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:02,473 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration29_Loop [2025-03-09 06:50:02,473 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:02,473 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:02,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:02,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:02,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:02,494 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:02,494 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:50:02,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:02,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:02,496 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) [2025-03-09 06:50:02,497 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 [2025-03-09 06:50:02,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:50:02,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:02,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:02,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:02,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:02,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:02,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:02,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:02,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:02,514 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 [2025-03-09 06:50:02,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:02,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:02,516 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) [2025-03-09 06:50:02,517 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 [2025-03-09 06:50:02,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:50:02,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:02,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:02,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:02,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:02,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:02,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:02,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:02,531 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:50:02,533 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:50:02,534 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:50:02,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:02,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:02,536 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:02,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-03-09 06:50:02,537 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:50:02,537 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:50:02,537 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:50:02,537 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 [] [2025-03-09 06:50:02,543 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 [2025-03-09 06:50:02,543 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:50:02,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:02,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-09 06:50:02,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-09 06:50:02,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:02,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:02,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 2125 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-03-09 06:50:02,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:03,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-03-09 06:50:04,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:04,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:04,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:04,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:04,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:50:04,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-09 06:50:04,364 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 [2025-03-09 06:50:04,364 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 978 states and 1088 transitions. cyclomatic complexity: 124 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:04,381 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 978 states and 1088 transitions. cyclomatic complexity: 124. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 998 states and 1111 transitions. Complement of second has 9 states. [2025-03-09 06:50:04,381 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 [2025-03-09 06:50:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-09 06:50:04,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 336 letters. Loop has 105 letters. [2025-03-09 06:50:04,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:04,382 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:50:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:04,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-09 06:50:04,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-09 06:50:04,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:04,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:04,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 2125 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-03-09 06:50:04,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:05,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:05,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:05,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:05,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:05,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:50:05,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-09 06:50:06,057 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 [2025-03-09 06:50:06,058 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 978 states and 1088 transitions. cyclomatic complexity: 124 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:06,073 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 978 states and 1088 transitions. cyclomatic complexity: 124. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 998 states and 1111 transitions. Complement of second has 9 states. [2025-03-09 06:50:06,073 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 [2025-03-09 06:50:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-09 06:50:06,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 336 letters. Loop has 105 letters. [2025-03-09 06:50:06,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:06,073 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:50:06,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:06,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-09 06:50:06,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-09 06:50:06,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:06,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:06,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 2125 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-03-09 06:50:06,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:07,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:07,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:07,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:07,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:07,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:50:07,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-09 06:50:07,700 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 [2025-03-09 06:50:07,700 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 978 states and 1088 transitions. cyclomatic complexity: 124 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:07,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 978 states and 1088 transitions. cyclomatic complexity: 124. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 2068 states and 2307 transitions. Complement of second has 10 states. [2025-03-09 06:50:07,749 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 [2025-03-09 06:50:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2025-03-09 06:50:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 336 letters. Loop has 105 letters. [2025-03-09 06:50:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:07,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 441 letters. Loop has 105 letters. [2025-03-09 06:50:07,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:07,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 336 letters. Loop has 210 letters. [2025-03-09 06:50:07,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:07,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2068 states and 2307 transitions. [2025-03-09 06:50:07,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-09 06:50:07,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2068 states to 1020 states and 1128 transitions. [2025-03-09 06:50:07,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2025-03-09 06:50:07,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2025-03-09 06:50:07,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1020 states and 1128 transitions. [2025-03-09 06:50:07,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:07,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1020 states and 1128 transitions. [2025-03-09 06:50:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states and 1128 transitions. [2025-03-09 06:50:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1020. [2025-03-09 06:50:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 714 states have (on average 1.0364145658263306) internal successors, (740), 731 states have internal predecessors, (740), 170 states have call successors, (183), 132 states have call predecessors, (183), 136 states have return successors, (205), 156 states have call predecessors, (205), 170 states have call successors, (205) [2025-03-09 06:50:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1128 transitions. [2025-03-09 06:50:07,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1020 states and 1128 transitions. [2025-03-09 06:50:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:07,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 06:50:07,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 06:50:07,790 INFO L87 Difference]: Start difference. First operand 1020 states and 1128 transitions. Second operand has 35 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 22 states have call successors, (31), 1 states have call predecessors, (31), 9 states have return successors, (34), 21 states have call predecessors, (34), 22 states have call successors, (34) [2025-03-09 06:50:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:08,783 INFO L93 Difference]: Finished difference Result 1197 states and 1320 transitions. [2025-03-09 06:50:08,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1197 states and 1320 transitions. [2025-03-09 06:50:08,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2025-03-09 06:50:08,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1197 states to 983 states and 1072 transitions. [2025-03-09 06:50:08,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2025-03-09 06:50:08,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2025-03-09 06:50:08,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 983 states and 1072 transitions. [2025-03-09 06:50:08,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:08,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 983 states and 1072 transitions. [2025-03-09 06:50:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states and 1072 transitions. [2025-03-09 06:50:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 847. [2025-03-09 06:50:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 595 states have (on average 1.0252100840336134) internal successors, (610), 605 states have internal predecessors, (610), 136 states have call successors, (143), 109 states have call predecessors, (143), 116 states have return successors, (155), 132 states have call predecessors, (155), 136 states have call successors, (155) [2025-03-09 06:50:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 908 transitions. [2025-03-09 06:50:08,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 847 states and 908 transitions. [2025-03-09 06:50:08,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-09 06:50:08,795 INFO L432 stractBuchiCegarLoop]: Abstraction has 847 states and 908 transitions. [2025-03-09 06:50:08,795 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-03-09 06:50:08,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 847 states and 908 transitions. [2025-03-09 06:50:08,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-03-09 06:50:08,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:08,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:08,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [67, 67, 50, 28, 23, 23, 23, 23, 23, 23, 22, 17, 17, 16, 16, 16, 5, 5, 5, 5, 4, 3, 1, 1, 1, 1] [2025-03-09 06:50:08,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 8, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:50:08,797 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:50:08,797 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:50:08,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash -351550519, now seen corresponding path program 16 times [2025-03-09 06:50:08,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:08,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291395218] [2025-03-09 06:50:08,798 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:50:08,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:08,805 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 485 statements into 2 equivalence classes. [2025-03-09 06:50:08,887 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-09 06:50:08,887 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:50:08,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 1144 proven. 405 refuted. 0 times theorem prover too weak. 10113 trivial. 0 not checked. [2025-03-09 06:50:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:09,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291395218] [2025-03-09 06:50:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291395218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:09,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46144865] [2025-03-09 06:50:09,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:50:09,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:09,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:09,304 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) [2025-03-09 06:50:09,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2025-03-09 06:50:09,404 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 485 statements into 2 equivalence classes. [2025-03-09 06:50:09,504 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-09 06:50:09,504 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:50:09,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:09,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:50:09,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 4699 proven. 55 refuted. 0 times theorem prover too weak. 6908 trivial. 0 not checked. [2025-03-09 06:50:09,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 1144 proven. 409 refuted. 0 times theorem prover too weak. 10109 trivial. 0 not checked. [2025-03-09 06:50:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46144865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:10,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 24 [2025-03-09 06:50:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331122894] [2025-03-09 06:50:10,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:10,524 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:50:10,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1499734953, now seen corresponding path program 6 times [2025-03-09 06:50:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:10,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308521808] [2025-03-09 06:50:10,524 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:50:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:10,528 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 105 statements into 11 equivalence classes. [2025-03-09 06:50:10,537 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:10,537 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-09 06:50:10,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:10,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:10,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:10,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:10,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:10,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:10,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:11,306 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:11,306 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:11,306 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:11,306 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:11,306 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:50:11,306 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:11,306 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:11,306 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:11,306 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration30_Loop [2025-03-09 06:50:11,306 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:11,306 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:11,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:11,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:11,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:11,327 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:11,327 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:50:11,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:11,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:11,329 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) [2025-03-09 06:50:11,330 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 [2025-03-09 06:50:11,330 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:11,330 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:11,341 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:11,341 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=3} Honda state: {ULTIMATE.start_main_~p~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:50:11,345 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 [2025-03-09 06:50:11,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:11,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:11,349 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) [2025-03-09 06:50:11,350 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 [2025-03-09 06:50:11,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:11,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:11,361 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:50:11,361 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: [] [2025-03-09 06:50:11,366 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 [2025-03-09 06:50:11,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:11,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:11,368 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) [2025-03-09 06:50:11,368 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 [2025-03-09 06:50:11,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:11,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:11,385 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 [2025-03-09 06:50:11,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:11,387 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) [2025-03-09 06:50:11,388 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 [2025-03-09 06:50:11,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:50:11,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:11,419 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:50:11,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:11,423 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:11,423 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:11,423 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:11,423 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:11,423 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:50:11,423 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:11,423 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:11,423 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:11,423 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration30_Loop [2025-03-09 06:50:11,423 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:11,423 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:11,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:11,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:11,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:11,444 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:11,444 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:50:11,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:11,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:11,446 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) [2025-03-09 06:50:11,447 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 [2025-03-09 06:50:11,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:50:11,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:11,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:11,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:11,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:11,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:11,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:11,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:11,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:11,464 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 [2025-03-09 06:50:11,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:11,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:11,466 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) [2025-03-09 06:50:11,466 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 [2025-03-09 06:50:11,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 [2025-03-09 06:50:11,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:11,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:11,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:11,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:11,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:11,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:11,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:11,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:50:11,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2025-03-09 06:50:11,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:11,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:11,487 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) [2025-03-09 06:50:11,487 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 [2025-03-09 06:50:11,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:50:11,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:11,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:11,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:11,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:11,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:11,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:11,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:11,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:50:11,503 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:50:11,503 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:50:11,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:11,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:11,505 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) [2025-03-09 06:50:11,506 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 [2025-03-09 06:50:11,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:50:11,507 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:50:11,507 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:50:11,507 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 [] [2025-03-09 06:50:11,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-03-09 06:50:11,512 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:50:11,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:11,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-09 06:50:11,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-09 06:50:11,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:11,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:11,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 3088 conjuncts, 136 conjuncts are in the unsatisfiable core [2025-03-09 06:50:11,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:11,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:13,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:13,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:13,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:13,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:13,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:50:13,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-09 06:50:13,855 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 [2025-03-09 06:50:13,856 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 847 states and 908 transitions. cyclomatic complexity: 72 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:13,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 847 states and 908 transitions. cyclomatic complexity: 72. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 869 states and 933 transitions. Complement of second has 9 states. [2025-03-09 06:50:13,874 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 [2025-03-09 06:50:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-09 06:50:13,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 485 letters. Loop has 105 letters. [2025-03-09 06:50:13,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:13,874 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:50:13,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:13,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-09 06:50:14,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-09 06:50:14,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:14,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:14,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 3088 conjuncts, 136 conjuncts are in the unsatisfiable core [2025-03-09 06:50:14,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:16,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:16,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:16,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:16,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:16,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:50:16,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-09 06:50:16,237 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 [2025-03-09 06:50:16,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 847 states and 908 transitions. cyclomatic complexity: 72 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:16,252 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 847 states and 908 transitions. cyclomatic complexity: 72. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 869 states and 933 transitions. Complement of second has 9 states. [2025-03-09 06:50:16,252 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 [2025-03-09 06:50:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-09 06:50:16,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 485 letters. Loop has 105 letters. [2025-03-09 06:50:16,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:16,253 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:50:16,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:16,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-09 06:50:16,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-09 06:50:16,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:16,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:16,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 3088 conjuncts, 136 conjuncts are in the unsatisfiable core [2025-03-09 06:50:16,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:18,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:18,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:18,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:18,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:18,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:50:18,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-09 06:50:18,560 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 [2025-03-09 06:50:18,560 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 847 states and 908 transitions. cyclomatic complexity: 72 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:18,623 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 847 states and 908 transitions. cyclomatic complexity: 72. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 1656 states and 1778 transitions. Complement of second has 10 states. [2025-03-09 06:50:18,623 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 [2025-03-09 06:50:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2025-03-09 06:50:18,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 485 letters. Loop has 105 letters. [2025-03-09 06:50:18,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:18,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 590 letters. Loop has 105 letters. [2025-03-09 06:50:18,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:18,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 485 letters. Loop has 210 letters. [2025-03-09 06:50:18,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:18,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1656 states and 1778 transitions. [2025-03-09 06:50:18,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-03-09 06:50:18,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1656 states to 847 states and 908 transitions. [2025-03-09 06:50:18,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2025-03-09 06:50:18,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2025-03-09 06:50:18,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 847 states and 908 transitions. [2025-03-09 06:50:18,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:18,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 847 states and 908 transitions. [2025-03-09 06:50:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states and 908 transitions. [2025-03-09 06:50:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-03-09 06:50:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 595 states have (on average 1.0252100840336134) internal successors, (610), 605 states have internal predecessors, (610), 136 states have call successors, (143), 109 states have call predecessors, (143), 116 states have return successors, (155), 132 states have call predecessors, (155), 136 states have call successors, (155) [2025-03-09 06:50:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 908 transitions. [2025-03-09 06:50:18,641 INFO L240 hiAutomatonCegarLoop]: Abstraction has 847 states and 908 transitions. [2025-03-09 06:50:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:18,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 06:50:18,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-09 06:50:18,642 INFO L87 Difference]: Start difference. First operand 847 states and 908 transitions. Second operand has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 24 states have internal predecessors, (85), 19 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (31), 15 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-09 06:50:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:19,051 INFO L93 Difference]: Finished difference Result 917 states and 999 transitions. [2025-03-09 06:50:19,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 917 states and 999 transitions. [2025-03-09 06:50:19,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-03-09 06:50:19,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 917 states to 697 states and 767 transitions. [2025-03-09 06:50:19,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2025-03-09 06:50:19,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2025-03-09 06:50:19,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 697 states and 767 transitions. [2025-03-09 06:50:19,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:19,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 697 states and 767 transitions. [2025-03-09 06:50:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states and 767 transitions. [2025-03-09 06:50:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 646. [2025-03-09 06:50:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 455 states have (on average 1.024175824175824) internal successors, (466), 461 states have internal predecessors, (466), 105 states have call successors, (110), 82 states have call predecessors, (110), 86 states have return successors, (122), 102 states have call predecessors, (122), 105 states have call successors, (122) [2025-03-09 06:50:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 698 transitions. [2025-03-09 06:50:19,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 646 states and 698 transitions. [2025-03-09 06:50:19,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:50:19,060 INFO L432 stractBuchiCegarLoop]: Abstraction has 646 states and 698 transitions. [2025-03-09 06:50:19,060 INFO L338 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-03-09 06:50:19,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 646 states and 698 transitions. [2025-03-09 06:50:19,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-03-09 06:50:19,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:19,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:19,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [69, 69, 52, 29, 24, 24, 24, 24, 24, 24, 23, 17, 17, 16, 16, 16, 5, 5, 5, 5, 4, 3, 1, 1, 1, 1] [2025-03-09 06:50:19,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 8, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:50:19,063 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:50:19,063 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:50:19,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1072725799, now seen corresponding path program 17 times [2025-03-09 06:50:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:19,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406432321] [2025-03-09 06:50:19,063 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:50:19,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:19,072 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 499 statements into 19 equivalence classes. [2025-03-09 06:50:19,116 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 493 of 499 statements. [2025-03-09 06:50:19,116 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-03-09 06:50:19,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12400 backedges. 2404 proven. 483 refuted. 0 times theorem prover too weak. 9513 trivial. 0 not checked. [2025-03-09 06:50:19,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:19,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406432321] [2025-03-09 06:50:19,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406432321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:19,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026752137] [2025-03-09 06:50:19,702 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:50:19,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:19,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:19,704 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:19,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2025-03-09 06:50:19,792 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 499 statements into 19 equivalence classes. [2025-03-09 06:50:19,877 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 493 of 499 statements. [2025-03-09 06:50:19,878 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-03-09 06:50:19,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:19,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 06:50:19,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12400 backedges. 2410 proven. 472 refuted. 0 times theorem prover too weak. 9518 trivial. 0 not checked. [2025-03-09 06:50:19,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12400 backedges. 2391 proven. 503 refuted. 0 times theorem prover too weak. 9506 trivial. 0 not checked. [2025-03-09 06:50:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026752137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:21,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:21,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 22] total 34 [2025-03-09 06:50:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524097562] [2025-03-09 06:50:21,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:21,030 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:50:21,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1499734953, now seen corresponding path program 7 times [2025-03-09 06:50:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:21,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065740437] [2025-03-09 06:50:21,031 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:50:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:21,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:21,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:21,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:21,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:21,037 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:21,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:21,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:21,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:21,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:21,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:21,881 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:21,881 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:21,881 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:21,881 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:21,881 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:50:21,881 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,881 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:21,881 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:21,881 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration31_Loop [2025-03-09 06:50:21,881 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:21,881 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:21,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,907 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:21,907 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:50:21,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,909 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) [2025-03-09 06:50:21,910 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 [2025-03-09 06:50:21,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:50:21,911 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:21,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-03-09 06:50:21,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,928 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:21,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-03-09 06:50:21,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:50:21,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:50:21,961 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:50:21,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:21,965 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:50:21,965 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:50:21,965 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:50:21,965 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:50:21,965 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:50:21,965 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,965 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:50:21,965 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:50:21,965 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration31_Loop [2025-03-09 06:50:21,965 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:50:21,965 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:50:21,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:50:21,987 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:50:21,987 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:50:21,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:21,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:21,989 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:21,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-09 06:50:21,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:50:22,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:50:22,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:50:22,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:50:22,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:50:22,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:50:22,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:50:22,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:50:22,002 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:50:22,004 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:50:22,004 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:50:22,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:50:22,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:22,006 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:50:22,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-03-09 06:50:22,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:50:22,007 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:50:22,007 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:50:22,007 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 [] [2025-03-09 06:50:22,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:22,015 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:50:22,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:22,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-09 06:50:22,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:22,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-09 06:50:22,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:22,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:22,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-03-09 06:50:22,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:24,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:24,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:24,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:24,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:24,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:50:24,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-09 06:50:24,404 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 [2025-03-09 06:50:24,404 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 646 states and 698 transitions. cyclomatic complexity: 61 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:24,419 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 646 states and 698 transitions. cyclomatic complexity: 61. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 666 states and 721 transitions. Complement of second has 9 states. [2025-03-09 06:50:24,420 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 [2025-03-09 06:50:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-09 06:50:24,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 499 letters. Loop has 105 letters. [2025-03-09 06:50:24,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:24,420 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:50:24,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:24,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-09 06:50:24,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-09 06:50:24,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:24,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:24,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-03-09 06:50:24,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:26,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:26,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:26,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:26,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:26,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:50:26,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-09 06:50:26,774 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 [2025-03-09 06:50:26,774 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 646 states and 698 transitions. cyclomatic complexity: 61 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:26,791 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 646 states and 698 transitions. cyclomatic complexity: 61. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 666 states and 721 transitions. Complement of second has 9 states. [2025-03-09 06:50:26,791 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 [2025-03-09 06:50:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-09 06:50:26,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 499 letters. Loop has 105 letters. [2025-03-09 06:50:26,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:26,792 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:50:26,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:26,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-09 06:50:27,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-09 06:50:27,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:27,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:27,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-03-09 06:50:27,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:29,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:29,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:29,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:29,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:29,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 06:50:29,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-09 06:50:29,263 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 [2025-03-09 06:50:29,263 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 646 states and 698 transitions. cyclomatic complexity: 61 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:29,313 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 646 states and 698 transitions. cyclomatic complexity: 61. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 1256 states and 1361 transitions. Complement of second has 10 states. [2025-03-09 06:50:29,314 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 [2025-03-09 06:50:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-03-09 06:50:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2025-03-09 06:50:29,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 499 letters. Loop has 105 letters. [2025-03-09 06:50:29,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:29,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 604 letters. Loop has 105 letters. [2025-03-09 06:50:29,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:29,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 499 letters. Loop has 210 letters. [2025-03-09 06:50:29,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:50:29,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1256 states and 1361 transitions. [2025-03-09 06:50:29,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-03-09 06:50:29,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1256 states to 646 states and 698 transitions. [2025-03-09 06:50:29,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2025-03-09 06:50:29,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2025-03-09 06:50:29,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 646 states and 698 transitions. [2025-03-09 06:50:29,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:29,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 646 states and 698 transitions. [2025-03-09 06:50:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states and 698 transitions. [2025-03-09 06:50:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2025-03-09 06:50:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 455 states have (on average 1.024175824175824) internal successors, (466), 461 states have internal predecessors, (466), 105 states have call successors, (110), 82 states have call predecessors, (110), 86 states have return successors, (122), 102 states have call predecessors, (122), 105 states have call successors, (122) [2025-03-09 06:50:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 698 transitions. [2025-03-09 06:50:29,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 646 states and 698 transitions. [2025-03-09 06:50:29,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:29,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 06:50:29,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 06:50:29,351 INFO L87 Difference]: Start difference. First operand 646 states and 698 transitions. Second operand has 34 states, 30 states have (on average 3.533333333333333) internal successors, (106), 29 states have internal predecessors, (106), 25 states have call successors, (33), 1 states have call predecessors, (33), 9 states have return successors, (37), 18 states have call predecessors, (37), 25 states have call successors, (37) [2025-03-09 06:50:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:29,999 INFO L93 Difference]: Finished difference Result 680 states and 731 transitions. [2025-03-09 06:50:29,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 680 states and 731 transitions. [2025-03-09 06:50:30,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-09 06:50:30,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 680 states to 664 states and 710 transitions. [2025-03-09 06:50:30,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2025-03-09 06:50:30,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2025-03-09 06:50:30,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 664 states and 710 transitions. [2025-03-09 06:50:30,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:30,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 664 states and 710 transitions. [2025-03-09 06:50:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states and 710 transitions. [2025-03-09 06:50:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 629. [2025-03-09 06:50:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 445 states have (on average 1.0179775280898877) internal successors, (453), 450 states have internal predecessors, (453), 100 states have call successors, (104), 81 states have call predecessors, (104), 84 states have return successors, (105), 97 states have call predecessors, (105), 100 states have call successors, (105) [2025-03-09 06:50:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 662 transitions. [2025-03-09 06:50:30,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 629 states and 662 transitions. [2025-03-09 06:50:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-09 06:50:30,007 INFO L432 stractBuchiCegarLoop]: Abstraction has 629 states and 662 transitions. [2025-03-09 06:50:30,007 INFO L338 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2025-03-09 06:50:30,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 629 states and 662 transitions. [2025-03-09 06:50:30,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-09 06:50:30,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:30,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:30,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [71, 71, 53, 30, 25, 25, 25, 25, 25, 25, 23, 18, 17, 16, 16, 16, 5, 5, 5, 5, 4, 3, 1, 1, 1, 1] [2025-03-09 06:50:30,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 8, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:50:30,009 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "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;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume !(main_~q~0#1 <= main_~x~0#1);havoc main_~q~0#1;main_#t~post8#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume main_~p~0#1 <= main_~x~0#1;main_~q~0#1 := 0;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:50:30,009 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~ret6#1 := parts(main_~p~0#1, main_~q~0#1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" "assume main_~q~0#1 <= main_~x~0#1;" [2025-03-09 06:50:30,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:30,010 INFO L85 PathProgramCache]: Analyzing trace with hash 683516654, now seen corresponding path program 18 times [2025-03-09 06:50:30,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:30,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633083891] [2025-03-09 06:50:30,010 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:50:30,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:30,020 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 512 statements into 19 equivalence classes. [2025-03-09 06:50:30,063 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 434 of 512 statements. [2025-03-09 06:50:30,063 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-09 06:50:30,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 13109 backedges. 1143 proven. 1361 refuted. 0 times theorem prover too weak. 10605 trivial. 0 not checked. [2025-03-09 06:50:30,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:30,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633083891] [2025-03-09 06:50:30,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633083891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:30,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142052750] [2025-03-09 06:50:30,993 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:50:30,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:30,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:30,995 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:30,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2025-03-09 06:50:31,100 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 512 statements into 19 equivalence classes. [2025-03-09 06:50:31,195 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 434 of 512 statements. [2025-03-09 06:50:31,195 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-09 06:50:31,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:31,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:50:31,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 13109 backedges. 930 proven. 290 refuted. 0 times theorem prover too weak. 11889 trivial. 0 not checked. [2025-03-09 06:50:31,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 13109 backedges. 901 proven. 324 refuted. 0 times theorem prover too weak. 11884 trivial. 0 not checked. [2025-03-09 06:50:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142052750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:32,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:32,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13, 14] total 35 [2025-03-09 06:50:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372711780] [2025-03-09 06:50:32,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:32,007 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:50:32,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:32,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1499734953, now seen corresponding path program 8 times [2025-03-09 06:50:32,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:32,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206828583] [2025-03-09 06:50:32,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:50:32,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:32,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-09 06:50:32,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:32,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:50:32,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:32,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:32,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:50:32,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:50:32,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:32,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:32,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace