./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 798a7b37 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-?-798a7b3-m [2025-03-04 15:35:35,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:35:35,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:35:35,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:35:35,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:35:35,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:35:35,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:35:35,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:35:35,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:35:35,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:35:35,193 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:35:35,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:35:35,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:35:35,193 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:35:35,194 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:35:35,194 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:35:35,194 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:35:35,194 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:35:35,194 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:35:35,194 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:35:35,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:35:35,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:35:35,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:35:35,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:35:35,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:35:35,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:35:35,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:35:35,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:35:35,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:35:35,195 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:35:35,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:35:35,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:35:35,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:35:35,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:35:35,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:35:35,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:35:35,196 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:35:35,196 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-04 15:35:35,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:35:35,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:35:35,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:35:35,439 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:35:35,440 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:35:35,441 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-04 15:35:36,614 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efe0cbd5/b579d26068634d6abe5311514274c6ad/FLAG5d5a55e25 [2025-03-04 15:35:36,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:35:36,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2025-03-04 15:35:36,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efe0cbd5/b579d26068634d6abe5311514274c6ad/FLAG5d5a55e25 [2025-03-04 15:35:36,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efe0cbd5/b579d26068634d6abe5311514274c6ad [2025-03-04 15:35:36,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:35:36,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:35:36,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:35:36,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:35:36,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:35:36,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:36,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bdbc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36, skipping insertion in model container [2025-03-04 15:35:36,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:36,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:35:36,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:35:36,974 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:35:36,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:35:36,996 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:35:36,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36 WrapperNode [2025-03-04 15:35:36,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:35:36,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:35:36,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:35:36,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:35:37,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,016 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2025-03-04 15:35:37,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:35:37,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:35:37,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:35:37,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:35:37,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,027 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:35:37,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:35:37,037 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:35:37,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:35:37,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:35:37,039 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (1/1) ... [2025-03-04 15:35:37,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:37,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:37,065 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-04 15:35:37,073 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-04 15:35:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2025-03-04 15:35:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2025-03-04 15:35:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:35:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:35:37,124 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:35:37,126 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:35:37,247 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 15:35:37,248 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:35:37,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:35:37,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:35:37,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:35:37 BoogieIcfgContainer [2025-03-04 15:35:37,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:35:37,257 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:35:37,257 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:35:37,261 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:35:37,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:35:37,261 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:35:36" (1/3) ... [2025-03-04 15:35:37,262 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20cb1685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:35:37, skipping insertion in model container [2025-03-04 15:35:37,262 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:35:37,263 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:36" (2/3) ... [2025-03-04 15:35:37,263 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20cb1685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:35:37, skipping insertion in model container [2025-03-04 15:35:37,263 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:35:37,263 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:35:37" (3/3) ... [2025-03-04 15:35:37,264 INFO L363 chiAutomizerObserver]: Analyzing ICFG Parts.c [2025-03-04 15:35:37,301 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:35:37,302 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:35:37,302 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:35:37,302 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:35:37,302 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:35:37,302 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:35:37,303 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:35:37,303 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:35:37,307 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-04 15:35:37,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-04 15:35:37,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:37,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:37,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:35:37,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:35:37,325 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:35:37,326 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-04 15:35:37,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-04 15:35:37,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:37,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:37,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:35:37,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:35:37,335 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-04 15:35:37,335 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-04 15:35:37,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1876795, now seen corresponding path program 1 times [2025-03-04 15:35:37,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:37,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951395616] [2025-03-04 15:35:37,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:37,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:37,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:37,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:37,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:37,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:37,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:37,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:37,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:37,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:37,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:37,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:37,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:37,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1565, now seen corresponding path program 1 times [2025-03-04 15:35:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291383053] [2025-03-04 15:35:37,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:37,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:37,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:37,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:37,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:37,426 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:37,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:37,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:37,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:37,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:37,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:37,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1803600599, now seen corresponding path program 1 times [2025-03-04 15:35:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:37,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438276030] [2025-03-04 15:35:37,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:37,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:35:37,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:37,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:37,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:37,498 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-04 15:35:37,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:37,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438276030] [2025-03-04 15:35:37,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438276030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:37,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:37,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:35:37,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662000294] [2025-03-04 15:35:37,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:37,549 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:37,550 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:37,550 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:37,550 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:37,550 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:37,550 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:37,550 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:37,550 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:37,551 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration1_Loop [2025-03-04 15:35:37,551 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:37,551 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:37,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:37,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:37,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:37,606 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:37,607 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:37,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:37,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:37,610 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-04 15:35:37,612 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-04 15:35:37,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:37,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:37,633 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-04 15:35:37,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:37,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:37,635 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-04 15:35:37,637 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-04 15:35:37,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:37,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:37,716 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:37,721 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-04 15:35:37,721 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:37,721 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:37,721 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:37,721 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:37,721 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:37,721 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:37,721 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:37,721 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:37,721 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration1_Loop [2025-03-04 15:35:37,721 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:37,721 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:37,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:37,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:37,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:37,768 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:37,772 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:37,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:37,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:37,775 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-04 15:35:37,776 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-04 15:35:37,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:37,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:37,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:37,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:37,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:37,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:37,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:37,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:37,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:37,803 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 15:35:37,805 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-04 15:35:37,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:37,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:37,811 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-04 15:35:37,811 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-04 15:35:37,813 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:37,813 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:37,813 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:37,814 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-04 15:35:37,820 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-04 15:35:37,823 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:37,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:37,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:37,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:37,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:37,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:37,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:35:37,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:37,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:37,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:37,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:37,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:37,871 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:37,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:37,893 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-04 15:35:37,909 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-04 15:35:37,910 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-04 15:35:37,943 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-04 15:35:37,944 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-04 15:35:37,948 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-04 15:35:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-04 15:35:37,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:35:37,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:37,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:35:37,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:37,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-04 15:35:37,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:37,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2025-03-04 15:35:37,960 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-04 15:35:37,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 34 transitions. [2025-03-04 15:35:37,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-04 15:35:37,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-04 15:35:37,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2025-03-04 15:35:37,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:37,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-04 15:35:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2025-03-04 15:35:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-04 15:35:37,985 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-04 15:35:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-03-04 15:35:37,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-04 15:35:37,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:37,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:35:37,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:35:37,992 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-04 15:35:38,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:38,025 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2025-03-04 15:35:38,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2025-03-04 15:35:38,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-04 15:35:38,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 29 transitions. [2025-03-04 15:35:38,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-04 15:35:38,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-04 15:35:38,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2025-03-04 15:35:38,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:35:38,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-04 15:35:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2025-03-04 15:35:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-04 15:35:38,030 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-04 15:35:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2025-03-04 15:35:38,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-04 15:35:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:35:38,032 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-04 15:35:38,032 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:35:38,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2025-03-04 15:35:38,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-04 15:35:38,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:38,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:38,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:35:38,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:38,034 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-04 15:35:38,034 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-04 15:35:38,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:38,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1876795, now seen corresponding path program 2 times [2025-03-04 15:35:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043023403] [2025-03-04 15:35:38,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:38,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:38,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:38,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:38,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:38,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:38,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:38,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:38,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1695627319, now seen corresponding path program 1 times [2025-03-04 15:35:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:38,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147762715] [2025-03-04 15:35:38,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:38,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:35:38,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:35:38,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:35:38,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:35:38,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:38,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash -534800835, now seen corresponding path program 1 times [2025-03-04 15:35:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853337299] [2025-03-04 15:35:38,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:38,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:38,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:35:38,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:35:38,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:38,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:35:38,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:35:38,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:38,158 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:38,159 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:38,159 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:38,159 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:38,159 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:38,159 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:38,159 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:38,159 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:38,159 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2025-03-04 15:35:38,159 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:38,159 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:38,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:38,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:38,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:38,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:38,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:38,199 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:38,199 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:38,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:38,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:38,201 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-04 15:35:38,203 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-04 15:35:38,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:38,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:38,221 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-04 15:35:38,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:38,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:38,224 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-04 15:35:38,225 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-04 15:35:38,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:38,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:38,251 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:38,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:38,255 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:38,255 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:38,255 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:38,255 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:38,255 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:38,255 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:38,255 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:38,255 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:38,255 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2025-03-04 15:35:38,255 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:38,255 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:38,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:38,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:38,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:38,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:38,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:38,298 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:38,298 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:38,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:38,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:38,300 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-04 15:35:38,302 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-04 15:35:38,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:38,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:38,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:38,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:38,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:38,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:38,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:38,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:38,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:38,320 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-04 15:35:38,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:38,322 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-04 15:35:38,323 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-04 15:35:38,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:38,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:38,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:38,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:38,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:38,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:38,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:38,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:38,337 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:38,343 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:35:38,343 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:35:38,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:38,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:38,346 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-04 15:35:38,348 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-04 15:35:38,349 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:38,349 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:38,349 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:38,349 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-04 15:35:38,355 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-04 15:35:38,356 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:38,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:38,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:38,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:38,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:38,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:35:38,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:38,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:38,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:35:38,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:35:38,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:35:38,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:38,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:38,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:38,509 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-04 15:35:38,509 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-04 15:35:38,510 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-04 15:35:38,746 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-04 15:35:38,747 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-04 15:35:38,747 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-04 15:35:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-03-04 15:35:38,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 4 letters. Loop has 9 letters. [2025-03-04 15:35:38,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:38,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 13 letters. Loop has 9 letters. [2025-03-04 15:35:38,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:38,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 4 letters. Loop has 18 letters. [2025-03-04 15:35:38,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:38,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 240 transitions. [2025-03-04 15:35:38,754 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-04 15:35:38,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 240 transitions. [2025-03-04 15:35:38,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-03-04 15:35:38,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2025-03-04 15:35:38,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 240 transitions. [2025-03-04 15:35:38,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:38,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 240 transitions. [2025-03-04 15:35:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 240 transitions. [2025-03-04 15:35:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2025-03-04 15:35:38,770 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-04 15:35:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 191 transitions. [2025-03-04 15:35:38,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 191 transitions. [2025-03-04 15:35:38,771 INFO L432 stractBuchiCegarLoop]: Abstraction has 126 states and 191 transitions. [2025-03-04 15:35:38,771 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:35:38,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 191 transitions. [2025-03-04 15:35:38,773 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-04 15:35:38,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:38,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:38,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:35:38,775 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:38,775 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-04 15:35:38,775 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-04 15:35:38,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash 58180664, now seen corresponding path program 1 times [2025-03-04 15:35:38,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:38,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421594042] [2025-03-04 15:35:38,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:38,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:38,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:38,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:38,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:38,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:38,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:38,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:38,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash -493408852, now seen corresponding path program 1 times [2025-03-04 15:35:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:38,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276246880] [2025-03-04 15:35:38,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:38,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:35:38,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:35:38,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:38,934 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-04 15:35:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276246880] [2025-03-04 15:35:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276246880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:38,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:38,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:35:38,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645751678] [2025-03-04 15:35:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:38,935 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:38,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:38,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:35:38,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:35:38,936 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-04 15:35:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:39,117 INFO L93 Difference]: Finished difference Result 229 states and 436 transitions. [2025-03-04 15:35:39,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 436 transitions. [2025-03-04 15:35:39,121 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-03-04 15:35:39,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 226 states and 433 transitions. [2025-03-04 15:35:39,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-03-04 15:35:39,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-03-04 15:35:39,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 433 transitions. [2025-03-04 15:35:39,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:39,126 INFO L218 hiAutomatonCegarLoop]: Abstraction has 226 states and 433 transitions. [2025-03-04 15:35:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 433 transitions. [2025-03-04 15:35:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 167. [2025-03-04 15:35:39,145 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-04 15:35:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 280 transitions. [2025-03-04 15:35:39,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 280 transitions. [2025-03-04 15:35:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:35:39,150 INFO L432 stractBuchiCegarLoop]: Abstraction has 167 states and 280 transitions. [2025-03-04 15:35:39,150 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:35:39,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 280 transitions. [2025-03-04 15:35:39,152 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2025-03-04 15:35:39,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:39,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:39,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:35:39,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:39,154 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-04 15:35:39,154 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-04 15:35:39,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash 58180664, now seen corresponding path program 2 times [2025-03-04 15:35:39,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:39,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903652353] [2025-03-04 15:35:39,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:39,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:39,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:39,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:39,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:39,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:39,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:39,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:39,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:39,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash 75464136, now seen corresponding path program 1 times [2025-03-04 15:35:39,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:39,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479137616] [2025-03-04 15:35:39,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:39,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:39,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:35:39,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:35:39,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:39,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:35:39,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:35:39,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:39,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash -525919489, now seen corresponding path program 1 times [2025-03-04 15:35:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:39,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728425311] [2025-03-04 15:35:39,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:39,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:35:39,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:35:39,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:39,225 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-04 15:35:39,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:39,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728425311] [2025-03-04 15:35:39,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728425311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:39,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:39,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:35:39,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084234171] [2025-03-04 15:35:39,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:39,292 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:39,292 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:39,292 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:39,292 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:39,292 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:39,292 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,292 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:39,292 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:39,292 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration4_Loop [2025-03-04 15:35:39,292 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:39,292 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:39,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,317 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:39,317 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:39,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,319 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-04 15:35:39,320 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-04 15:35:39,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:39,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:39,333 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:39,333 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-04 15:35:39,338 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-04 15:35:39,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,340 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-04 15:35:39,341 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-04 15:35:39,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:39,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:39,358 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-04 15:35:39,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,360 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-04 15:35:39,361 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-04 15:35:39,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:39,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:39,384 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:39,388 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-04 15:35:39,389 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:39,389 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:39,389 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:39,389 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:39,389 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:39,389 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,389 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:39,389 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:39,389 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration4_Loop [2025-03-04 15:35:39,389 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:39,389 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:39,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,412 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:39,413 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:39,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,414 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-04 15:35:39,415 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-04 15:35:39,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:35:39,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:39,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:39,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:39,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:39,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:39,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:39,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:39,428 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:39,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:35:39,430 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:35:39,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,432 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-04 15:35:39,432 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-04 15:35:39,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:39,433 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:39,433 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:39,433 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-04 15:35:39,441 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-04 15:35:39,442 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:39,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:39,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:39,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:39,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:35:39,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:39,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:35:39,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:35:39,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:39,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:39,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:39,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 15:35:39,546 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-04 15:35:39,546 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-04 15:35:39,547 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-04 15:35:39,704 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-04 15:35:39,705 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-04 15:35:39,705 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-04 15:35:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2025-03-04 15:35:39,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 5 letters. Loop has 8 letters. [2025-03-04 15:35:39,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:39,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 13 letters. Loop has 8 letters. [2025-03-04 15:35:39,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:39,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 5 letters. Loop has 16 letters. [2025-03-04 15:35:39,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:39,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 958 states and 1806 transitions. [2025-03-04 15:35:39,723 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 47 [2025-03-04 15:35:39,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 958 states to 838 states and 1552 transitions. [2025-03-04 15:35:39,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2025-03-04 15:35:39,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2025-03-04 15:35:39,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 838 states and 1552 transitions. [2025-03-04 15:35:39,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:39,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 838 states and 1552 transitions. [2025-03-04 15:35:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states and 1552 transitions. [2025-03-04 15:35:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 675. [2025-03-04 15:35:39,783 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-04 15:35:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1132 transitions. [2025-03-04 15:35:39,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 675 states and 1132 transitions. [2025-03-04 15:35:39,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:39,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:35:39,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:35:39,791 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-04 15:35:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:39,847 INFO L93 Difference]: Finished difference Result 736 states and 1284 transitions. [2025-03-04 15:35:39,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 736 states and 1284 transitions. [2025-03-04 15:35:39,854 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 44 [2025-03-04 15:35:39,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 736 states to 311 states and 534 transitions. [2025-03-04 15:35:39,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2025-03-04 15:35:39,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2025-03-04 15:35:39,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 534 transitions. [2025-03-04 15:35:39,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:39,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 311 states and 534 transitions. [2025-03-04 15:35:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 534 transitions. [2025-03-04 15:35:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 255. [2025-03-04 15:35:39,865 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-04 15:35:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 405 transitions. [2025-03-04 15:35:39,867 INFO L240 hiAutomatonCegarLoop]: Abstraction has 255 states and 405 transitions. [2025-03-04 15:35:39,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:35:39,868 INFO L432 stractBuchiCegarLoop]: Abstraction has 255 states and 405 transitions. [2025-03-04 15:35:39,868 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:35:39,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 405 transitions. [2025-03-04 15:35:39,869 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 44 [2025-03-04 15:35:39,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:39,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:39,870 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:39,870 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:39,870 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-04 15:35:39,870 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-04 15:35:39,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1188268990, now seen corresponding path program 1 times [2025-03-04 15:35:39,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:39,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116295863] [2025-03-04 15:35:39,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:39,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:35:39,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:35:39,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:39,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:35:39,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:35:39,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:39,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,877 INFO L85 PathProgramCache]: Analyzing trace with hash -685329803, now seen corresponding path program 1 times [2025-03-04 15:35:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:39,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402854854] [2025-03-04 15:35:39,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:39,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:35:39,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:35:39,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:39,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:35:39,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:35:39,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:39,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1047599080, now seen corresponding path program 1 times [2025-03-04 15:35:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:39,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17620593] [2025-03-04 15:35:39,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:39,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:35:39,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:35:39,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:39,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:35:39,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:35:39,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:39,946 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:39,947 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:39,947 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:39,947 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:39,947 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:39,947 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,947 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:39,947 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:39,947 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2025-03-04 15:35:39,947 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:39,947 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:39,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,967 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:39,967 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:39,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,969 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-04 15:35:39,969 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-04 15:35:39,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:39,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:39,981 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:39,982 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-04 15:35:39,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:35:39,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,989 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-04 15:35:39,990 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-04 15:35:39,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:39,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:40,008 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:40,008 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-04 15:35:40,014 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-04 15:35:40,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,016 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-04 15:35:40,017 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-04 15:35:40,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:40,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:40,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-04 15:35:40,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,037 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-04 15:35:40,038 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-04 15:35:40,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:40,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:40,131 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:40,137 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-04 15:35:40,137 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:40,137 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:40,137 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:40,137 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:40,137 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:40,137 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,137 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:40,137 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:40,137 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2025-03-04 15:35:40,137 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:40,137 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:40,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,160 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:40,160 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:40,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,162 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-04 15:35:40,164 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-04 15:35:40,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:40,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:40,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:40,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:40,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:40,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:40,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:40,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:40,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:40,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:40,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,184 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-04 15:35:40,186 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-04 15:35:40,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:40,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:40,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:40,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:40,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:40,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:40,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:40,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:40,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:40,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:40,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,260 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-04 15:35:40,261 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-04 15:35:40,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:40,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:40,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:40,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:40,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:40,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:40,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:40,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:40,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:40,277 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 15:35:40,277 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:35:40,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,279 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-04 15:35:40,280 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-04 15:35:40,281 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:40,281 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:40,281 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:40,281 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-04 15:35:40,287 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-04 15:35:40,288 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:40,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:40,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:35:40,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:35:40,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:40,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:35:40,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:40,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:35:40,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:35:40,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:40,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:40,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:40,390 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-04 15:35:40,390 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-04 15:35:40,390 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-04 15:35:40,468 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-04 15:35:40,468 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-04 15:35:40,469 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-04 15:35:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2025-03-04 15:35:40,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 7 letters. [2025-03-04 15:35:40,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:40,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 18 letters. Loop has 7 letters. [2025-03-04 15:35:40,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:40,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 14 letters. [2025-03-04 15:35:40,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:40,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 597 transitions. [2025-03-04 15:35:40,477 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2025-03-04 15:35:40,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 315 states and 490 transitions. [2025-03-04 15:35:40,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2025-03-04 15:35:40,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2025-03-04 15:35:40,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 490 transitions. [2025-03-04 15:35:40,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:40,483 INFO L218 hiAutomatonCegarLoop]: Abstraction has 315 states and 490 transitions. [2025-03-04 15:35:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 490 transitions. [2025-03-04 15:35:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2025-03-04 15:35:40,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-04 15:35:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 489 transitions. [2025-03-04 15:35:40,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 314 states and 489 transitions. [2025-03-04 15:35:40,501 INFO L432 stractBuchiCegarLoop]: Abstraction has 314 states and 489 transitions. [2025-03-04 15:35:40,501 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:35:40,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 489 transitions. [2025-03-04 15:35:40,506 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2025-03-04 15:35:40,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:40,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:40,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:40,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:35:40,506 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-04 15:35:40,506 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-04 15:35:40,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1818072937, now seen corresponding path program 1 times [2025-03-04 15:35:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:40,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56054413] [2025-03-04 15:35:40,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:40,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:35:40,510 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-04 15:35:40,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:35:40,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:40,538 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-04 15:35:40,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:40,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56054413] [2025-03-04 15:35:40,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56054413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:40,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:40,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:35:40,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486265391] [2025-03-04 15:35:40,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:40,539 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:40,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:40,539 INFO L85 PathProgramCache]: Analyzing trace with hash 39094691, now seen corresponding path program 1 times [2025-03-04 15:35:40,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:40,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419122784] [2025-03-04 15:35:40,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:40,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:40,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:40,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:40,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:40,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:40,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:40,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:40,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:40,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:40,596 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:40,596 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:40,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:40,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:40,596 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:40,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:40,596 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:40,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2025-03-04 15:35:40,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:40,596 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:40,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,636 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:40,636 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:40,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,638 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-04 15:35:40,638 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-04 15:35:40,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:40,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:40,650 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:40,650 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:40,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:35:40,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,657 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-04 15:35:40,658 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-04 15:35:40,659 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:40,659 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:40,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:40,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,684 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-04 15:35:40,685 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-04 15:35:40,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:40,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:40,838 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:40,845 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-04 15:35:40,845 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:40,845 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:40,845 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:40,845 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:40,845 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:40,845 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,845 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:40,845 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:40,845 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2025-03-04 15:35:40,845 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:40,845 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:40,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:40,886 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:40,886 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:40,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,888 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-04 15:35:40,889 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-04 15:35:40,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:35:40,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:40,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:40,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:40,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:40,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:40,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:40,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:40,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:40,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 15:35:40,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,909 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-04 15:35:40,909 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-04 15:35:40,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-04 15:35:40,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:40,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:40,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:40,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:40,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:40,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:40,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:40,923 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:40,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:35:40,925 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:35:40,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:40,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:40,927 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-04 15:35:40,927 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-04 15:35:40,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:40,928 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:40,928 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:40,928 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-03-04 15:35:40,934 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-04 15:35:40,934 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:40,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:40,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:35:40,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:35:40,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:40,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:40,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:40,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:40,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:40,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:40,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:40,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:41,009 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-04 15:35:41,010 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-04 15:35:41,010 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-04 15:35:41,102 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-04 15:35:41,103 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-04 15:35:41,103 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-04 15:35:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2025-03-04 15:35:41,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 12 letters. Loop has 5 letters. [2025-03-04 15:35:41,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:41,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 17 letters. Loop has 5 letters. [2025-03-04 15:35:41,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:41,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 12 letters. Loop has 10 letters. [2025-03-04 15:35:41,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:41,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1007 states and 2044 transitions. [2025-03-04 15:35:41,118 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 165 [2025-03-04 15:35:41,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1007 states to 912 states and 1870 transitions. [2025-03-04 15:35:41,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2025-03-04 15:35:41,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 501 [2025-03-04 15:35:41,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 912 states and 1870 transitions. [2025-03-04 15:35:41,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:41,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 912 states and 1870 transitions. [2025-03-04 15:35:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states and 1870 transitions. [2025-03-04 15:35:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 810. [2025-03-04 15:35:41,159 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-04 15:35:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1541 transitions. [2025-03-04 15:35:41,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 810 states and 1541 transitions. [2025-03-04 15:35:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:41,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:35:41,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:35:41,166 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-04 15:35:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:41,196 INFO L93 Difference]: Finished difference Result 716 states and 1339 transitions. [2025-03-04 15:35:41,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 716 states and 1339 transitions. [2025-03-04 15:35:41,203 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 104 [2025-03-04 15:35:41,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 716 states to 715 states and 1338 transitions. [2025-03-04 15:35:41,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2025-03-04 15:35:41,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2025-03-04 15:35:41,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 715 states and 1338 transitions. [2025-03-04 15:35:41,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:41,212 INFO L218 hiAutomatonCegarLoop]: Abstraction has 715 states and 1338 transitions. [2025-03-04 15:35:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states and 1338 transitions. [2025-03-04 15:35:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 707. [2025-03-04 15:35:41,229 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-04 15:35:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1330 transitions. [2025-03-04 15:35:41,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 707 states and 1330 transitions. [2025-03-04 15:35:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:35:41,253 INFO L432 stractBuchiCegarLoop]: Abstraction has 707 states and 1330 transitions. [2025-03-04 15:35:41,253 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:35:41,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 707 states and 1330 transitions. [2025-03-04 15:35:41,257 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 102 [2025-03-04 15:35:41,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:41,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:41,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-04 15:35:41,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:41,259 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-04 15:35:41,259 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-04 15:35:41,259 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-04 15:35:41,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:41,259 INFO L85 PathProgramCache]: Analyzing trace with hash 601043318, now seen corresponding path program 2 times [2025-03-04 15:35:41,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:41,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33658045] [2025-03-04 15:35:41,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:41,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:41,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 15:35:41,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:35:41,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:41,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:41,310 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-04 15:35:41,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33658045] [2025-03-04 15:35:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33658045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407048849] [2025-03-04 15:35:41,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:41,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:41,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:41,313 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-04 15:35:41,314 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-04 15:35:41,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 15:35:41,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:35:41,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:41,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:41,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:41,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:41,380 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-04 15:35:41,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:41,405 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-04 15:35:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407048849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:41,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:41,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 15:35:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924160996] [2025-03-04 15:35:41,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:41,406 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:41,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:41,406 INFO L85 PathProgramCache]: Analyzing trace with hash -313480764, now seen corresponding path program 1 times [2025-03-04 15:35:41,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:41,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598675838] [2025-03-04 15:35:41,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:41,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:41,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:35:41,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:35:41,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:41,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:41,515 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-04 15:35:41,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:41,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598675838] [2025-03-04 15:35:41,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598675838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:41,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115062508] [2025-03-04 15:35:41,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:41,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:41,518 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-04 15:35:41,520 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-04 15:35:41,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:35:41,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:35:41,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:41,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:41,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:35:41,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:41,644 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-04 15:35:41,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:41,763 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-04 15:35:41,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115062508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:41,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:41,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:35:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7634300] [2025-03-04 15:35:41,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:41,764 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:41,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:35:41,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:35:41,764 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-04 15:35:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:41,797 INFO L93 Difference]: Finished difference Result 755 states and 1413 transitions. [2025-03-04 15:35:41,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 1413 transitions. [2025-03-04 15:35:41,805 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 112 [2025-03-04 15:35:41,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 752 states and 1409 transitions. [2025-03-04 15:35:41,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2025-03-04 15:35:41,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 388 [2025-03-04 15:35:41,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 752 states and 1409 transitions. [2025-03-04 15:35:41,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:41,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 752 states and 1409 transitions. [2025-03-04 15:35:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states and 1409 transitions. [2025-03-04 15:35:41,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 706. [2025-03-04 15:35:41,831 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-04 15:35:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1328 transitions. [2025-03-04 15:35:41,835 INFO L240 hiAutomatonCegarLoop]: Abstraction has 706 states and 1328 transitions. [2025-03-04 15:35:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:35:41,836 INFO L432 stractBuchiCegarLoop]: Abstraction has 706 states and 1328 transitions. [2025-03-04 15:35:41,836 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:35:41,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 706 states and 1328 transitions. [2025-03-04 15:35:41,854 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 102 [2025-03-04 15:35:41,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:41,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:41,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:35:41,854 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-04 15:35:41,855 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-04 15:35:41,855 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-04 15:35:41,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1791803684, now seen corresponding path program 3 times [2025-03-04 15:35:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:41,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101354071] [2025-03-04 15:35:41,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:41,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:41,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-04 15:35:41,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:35:41,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:35:41,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:41,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:41,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:35:41,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:35:41,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:41,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:41,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:41,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash -313480764, now seen corresponding path program 2 times [2025-03-04 15:35:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:41,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035650595] [2025-03-04 15:35:41,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:41,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:41,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 15:35:41,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:35:41,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:41,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:41,940 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-04 15:35:41,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:41,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035650595] [2025-03-04 15:35:41,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035650595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:41,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091217496] [2025-03-04 15:35:41,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:41,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:41,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:41,942 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-04 15:35:41,943 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-04 15:35:41,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 15:35:41,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:35:41,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:41,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:41,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:35:41,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:42,057 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-04 15:35:42,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:42,163 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-04 15:35:42,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091217496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:42,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:42,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:35:42,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923403787] [2025-03-04 15:35:42,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:42,164 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:42,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:42,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:35:42,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:35:42,164 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-04 15:35:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:42,422 INFO L93 Difference]: Finished difference Result 1107 states and 2858 transitions. [2025-03-04 15:35:42,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1107 states and 2858 transitions. [2025-03-04 15:35:42,436 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 181 [2025-03-04 15:35:42,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1107 states to 1090 states and 2809 transitions. [2025-03-04 15:35:42,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 602 [2025-03-04 15:35:42,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2025-03-04 15:35:42,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1090 states and 2809 transitions. [2025-03-04 15:35:42,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:42,459 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1090 states and 2809 transitions. [2025-03-04 15:35:42,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states and 2809 transitions. [2025-03-04 15:35:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 749. [2025-03-04 15:35:42,507 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-04 15:35:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1565 transitions. [2025-03-04 15:35:42,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 749 states and 1565 transitions. [2025-03-04 15:35:42,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:35:42,513 INFO L432 stractBuchiCegarLoop]: Abstraction has 749 states and 1565 transitions. [2025-03-04 15:35:42,513 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:35:42,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 749 states and 1565 transitions. [2025-03-04 15:35:42,517 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2025-03-04 15:35:42,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:42,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:42,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:35:42,518 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-04 15:35:42,519 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-04 15:35:42,519 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-04 15:35:42,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:42,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1791803684, now seen corresponding path program 4 times [2025-03-04 15:35:42,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:42,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049736381] [2025-03-04 15:35:42,521 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:42,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:42,523 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 15:35:42,524 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:35:42,528 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:35:42,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:42,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:42,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:35:42,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:35:42,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:42,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:42,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:42,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1663446188, now seen corresponding path program 3 times [2025-03-04 15:35:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:42,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283158549] [2025-03-04 15:35:42,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:42,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:42,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-04 15:35:42,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 52 statements. [2025-03-04 15:35:42,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:35:42,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:42,630 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-04 15:35:42,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:42,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283158549] [2025-03-04 15:35:42,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283158549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:42,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695693091] [2025-03-04 15:35:42,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:42,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:42,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:42,633 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-04 15:35:42,635 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-04 15:35:42,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-04 15:35:42,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 52 statements. [2025-03-04 15:35:42,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:35:42,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:42,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:35:42,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:42,776 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-04 15:35:42,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:43,045 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-04 15:35:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695693091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:43,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2025-03-04 15:35:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910737973] [2025-03-04 15:35:43,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:43,045 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:43,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:43,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:35:43,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:35:43,046 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-04 15:35:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:43,397 INFO L93 Difference]: Finished difference Result 1355 states and 2923 transitions. [2025-03-04 15:35:43,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1355 states and 2923 transitions. [2025-03-04 15:35:43,413 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 160 [2025-03-04 15:35:43,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1355 states to 1279 states and 2785 transitions. [2025-03-04 15:35:43,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2025-03-04 15:35:43,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 675 [2025-03-04 15:35:43,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 2785 transitions. [2025-03-04 15:35:43,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:43,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1279 states and 2785 transitions. [2025-03-04 15:35:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 2785 transitions. [2025-03-04 15:35:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 996. [2025-03-04 15:35:43,465 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-04 15:35:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 2112 transitions. [2025-03-04 15:35:43,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 996 states and 2112 transitions. [2025-03-04 15:35:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:35:43,471 INFO L432 stractBuchiCegarLoop]: Abstraction has 996 states and 2112 transitions. [2025-03-04 15:35:43,471 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:35:43,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 996 states and 2112 transitions. [2025-03-04 15:35:43,477 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 110 [2025-03-04 15:35:43,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:43,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:43,478 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-04 15:35:43,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:35:43,478 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-04 15:35:43,478 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-04 15:35:43,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:43,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1956724682, now seen corresponding path program 1 times [2025-03-04 15:35:43,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:43,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325205025] [2025-03-04 15:35:43,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:43,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:43,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:35:43,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:35:43,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:43,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:43,500 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-04 15:35:43,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:43,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325205025] [2025-03-04 15:35:43,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325205025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:43,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:43,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:35:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909679093] [2025-03-04 15:35:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:43,501 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:43,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash 39094726, now seen corresponding path program 1 times [2025-03-04 15:35:43,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:43,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866596848] [2025-03-04 15:35:43,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:43,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:43,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:43,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:43,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:43,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:43,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:43,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:43,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:43,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:43,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:43,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:43,546 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:43,546 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:43,546 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:43,546 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:43,546 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:43,546 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,546 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:43,546 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:43,546 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration10_Loop [2025-03-04 15:35:43,546 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:43,546 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:43,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,585 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:43,585 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:43,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,589 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-04 15:35:43,590 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-04 15:35:43,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:43,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:43,602 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:43,602 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-04 15:35:43,608 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-04 15:35:43,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,610 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-04 15:35:43,612 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-04 15:35:43,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:43,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:43,623 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:43,623 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-04 15:35:43,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:43,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,632 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-04 15:35:43,633 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-04 15:35:43,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:43,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:43,646 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:43,646 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:43,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:43,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,654 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-04 15:35:43,656 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-04 15:35:43,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:43,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:43,668 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:43,668 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:43,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:43,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,678 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-04 15:35:43,679 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-04 15:35:43,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:43,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:43,694 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:43,694 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-04 15:35:43,703 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-04 15:35:43,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,705 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-04 15:35:43,708 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-04 15:35:43,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:43,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:43,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:43,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,729 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-04 15:35:43,730 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-04 15:35:43,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:43,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:43,773 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:43,777 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-04 15:35:43,777 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:43,778 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:43,778 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:43,778 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:43,778 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:43,778 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,778 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:43,778 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:43,778 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration10_Loop [2025-03-04 15:35:43,778 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:43,778 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:43,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:43,816 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:43,816 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:43,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,825 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-04 15:35:43,826 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-04 15:35:43,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:35:43,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:43,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:43,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:43,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:43,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:43,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:43,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:43,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:43,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:43,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,845 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-04 15:35:43,846 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-04 15:35:43,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:35:43,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:43,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:43,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:43,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:43,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:43,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:43,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:43,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:43,863 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-04 15:35:43,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,865 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-04 15:35:43,865 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-04 15:35:43,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:43,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:43,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:43,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:43,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:43,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:43,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:43,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:43,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:43,884 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-04 15:35:43,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,887 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-04 15:35:43,888 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-04 15:35:43,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:35:43,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:43,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:43,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:43,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:43,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:43,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:43,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:43,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:43,906 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-04 15:35:43,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,908 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-04 15:35:43,908 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-04 15:35:43,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:43,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:43,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:43,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:43,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:43,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:43,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:43,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:43,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:43,925 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-04 15:35:43,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,927 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-04 15:35:43,928 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-04 15:35:43,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:35:43,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:43,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:43,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:43,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:43,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:43,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:43,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:43,941 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:43,944 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:35:43,944 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:35:43,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:43,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,946 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-04 15:35:43,947 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-04 15:35:43,948 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:43,948 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:43,948 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:43,948 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2025-03-04 15:35:43,954 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-04 15:35:43,955 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:43,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:35:43,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:35:43,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:43,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:43,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:35:43,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:44,041 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-04 15:35:44,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:44,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:44,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:44,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:44,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:44,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:44,103 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-04 15:35:44,104 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-04 15:35:44,104 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-04 15:35:44,217 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-04 15:35:44,217 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-04 15:35:44,218 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-04 15:35:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2025-03-04 15:35:44,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 24 letters. Loop has 5 letters. [2025-03-04 15:35:44,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:44,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 29 letters. Loop has 5 letters. [2025-03-04 15:35:44,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:44,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 24 letters. Loop has 10 letters. [2025-03-04 15:35:44,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:44,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1889 states and 3790 transitions. [2025-03-04 15:35:44,236 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 122 [2025-03-04 15:35:44,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1889 states to 1647 states and 3417 transitions. [2025-03-04 15:35:44,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 718 [2025-03-04 15:35:44,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 744 [2025-03-04 15:35:44,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1647 states and 3417 transitions. [2025-03-04 15:35:44,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:44,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1647 states and 3417 transitions. [2025-03-04 15:35:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states and 3417 transitions. [2025-03-04 15:35:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1563. [2025-03-04 15:35:44,291 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-04 15:35:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 3199 transitions. [2025-03-04 15:35:44,298 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1563 states and 3199 transitions. [2025-03-04 15:35:44,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:44,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:35:44,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:35:44,298 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-04 15:35:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:44,332 INFO L93 Difference]: Finished difference Result 1287 states and 2712 transitions. [2025-03-04 15:35:44,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1287 states and 2712 transitions. [2025-03-04 15:35:44,343 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 78 [2025-03-04 15:35:44,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1287 states to 1271 states and 2695 transitions. [2025-03-04 15:35:44,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2025-03-04 15:35:44,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 518 [2025-03-04 15:35:44,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1271 states and 2695 transitions. [2025-03-04 15:35:44,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:44,356 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-03-04 15:35:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states and 2695 transitions. [2025-03-04 15:35:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2025-03-04 15:35:44,380 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-04 15:35:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2695 transitions. [2025-03-04 15:35:44,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-03-04 15:35:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:35:44,387 INFO L432 stractBuchiCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-03-04 15:35:44,387 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:35:44,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1271 states and 2695 transitions. [2025-03-04 15:35:44,392 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 78 [2025-03-04 15:35:44,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:44,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:44,394 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:35:44,394 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:44,394 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-04 15:35:44,394 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-04 15:35:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash -66487454, now seen corresponding path program 5 times [2025-03-04 15:35:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:44,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962121369] [2025-03-04 15:35:44,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:35:44,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:44,397 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-03-04 15:35:44,400 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:35:44,400 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 15:35:44,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:44,453 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-04 15:35:44,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:44,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962121369] [2025-03-04 15:35:44,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962121369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:44,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:35:44,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439776688] [2025-03-04 15:35:44,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:44,454 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:44,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -685329803, now seen corresponding path program 2 times [2025-03-04 15:35:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:44,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47992506] [2025-03-04 15:35:44,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:44,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:35:44,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:35:44,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:44,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:44,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:44,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:35:44,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:35:44,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:44,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:44,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:44,503 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:44,503 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:44,504 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:44,504 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:44,504 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:44,504 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:44,504 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:44,504 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:44,504 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2025-03-04 15:35:44,504 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:44,504 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:44,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:44,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:44,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:44,527 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:44,527 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:44,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:44,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:44,529 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-04 15:35:44,531 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-04 15:35:44,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:44,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:44,550 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-04 15:35:44,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:44,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:44,552 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-04 15:35:44,553 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-04 15:35:44,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:44,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:44,645 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:44,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-04 15:35:44,650 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:44,650 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:44,650 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:44,650 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:44,650 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:44,650 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:44,650 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:44,650 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:44,650 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2025-03-04 15:35:44,650 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:44,650 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:44,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:44,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:44,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:44,671 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:44,671 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:44,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:44,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:44,673 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-04 15:35:44,675 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-04 15:35:44,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:44,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:44,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:44,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:44,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:44,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:44,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:44,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:44,690 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:44,695 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 15:35:44,695 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:35:44,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:44,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:44,697 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-04 15:35:44,698 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-04 15:35:44,700 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:44,700 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:44,700 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:44,700 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-04 15:35:44,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:44,706 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:44,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:44,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:35:44,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:35:44,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:44,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:44,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:44,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:44,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:35:44,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:35:44,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:44,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:44,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:44,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:44,837 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-04 15:35:44,838 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-04 15:35:44,838 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-04 15:35:44,874 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-04 15:35:44,875 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-04 15:35:44,875 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-04 15:35:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2025-03-04 15:35:44,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 27 letters. Loop has 7 letters. [2025-03-04 15:35:44,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:44,876 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:35:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:44,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:35:44,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:35:44,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:44,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:44,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:44,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:35:44,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:35:44,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:44,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:44,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:44,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:45,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-04 15:35:45,005 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-04 15:35:45,005 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-04 15:35:45,042 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-04 15:35:45,042 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-04 15:35:45,043 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-04 15:35:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-03-04 15:35:45,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 27 letters. Loop has 7 letters. [2025-03-04 15:35:45,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:45,043 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:35:45,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:45,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:35:45,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:35:45,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:45,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:45,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:45,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:45,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:35:45,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:35:45,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:45,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:45,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:45,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:45,176 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-04 15:35:45,176 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-04 15:35:45,176 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-04 15:35:45,244 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-04 15:35:45,245 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-04 15:35:45,245 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-04 15:35:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2025-03-04 15:35:45,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 27 letters. Loop has 7 letters. [2025-03-04 15:35:45,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:45,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 34 letters. Loop has 7 letters. [2025-03-04 15:35:45,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:45,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 27 letters. Loop has 14 letters. [2025-03-04 15:35:45,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:45,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2445 states and 5285 transitions. [2025-03-04 15:35:45,272 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-04 15:35:45,281 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 57 [2025-03-04 15:35:45,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2445 states to 2000 states and 4030 transitions. [2025-03-04 15:35:45,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2025-03-04 15:35:45,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 383 [2025-03-04 15:35:45,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2000 states and 4030 transitions. [2025-03-04 15:35:45,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:45,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2000 states and 4030 transitions. [2025-03-04 15:35:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states and 4030 transitions. [2025-03-04 15:35:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1924. [2025-03-04 15:35:45,336 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-04 15:35:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3879 transitions. [2025-03-04 15:35:45,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1924 states and 3879 transitions. [2025-03-04 15:35:45,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:45,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:35:45,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:35:45,343 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-04 15:35:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:45,408 INFO L93 Difference]: Finished difference Result 1127 states and 2232 transitions. [2025-03-04 15:35:45,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1127 states and 2232 transitions. [2025-03-04 15:35:45,414 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-03-04 15:35:45,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1127 states to 620 states and 1244 transitions. [2025-03-04 15:35:45,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2025-03-04 15:35:45,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 244 [2025-03-04 15:35:45,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 620 states and 1244 transitions. [2025-03-04 15:35:45,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:45,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 620 states and 1244 transitions. [2025-03-04 15:35:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states and 1244 transitions. [2025-03-04 15:35:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 574. [2025-03-04 15:35:45,431 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-04 15:35:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1150 transitions. [2025-03-04 15:35:45,433 INFO L240 hiAutomatonCegarLoop]: Abstraction has 574 states and 1150 transitions. [2025-03-04 15:35:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:35:45,434 INFO L432 stractBuchiCegarLoop]: Abstraction has 574 states and 1150 transitions. [2025-03-04 15:35:45,434 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 15:35:45,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 1150 transitions. [2025-03-04 15:35:45,436 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-03-04 15:35:45,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:45,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:45,437 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-04 15:35:45,437 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2025-03-04 15:35:45,437 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-04 15:35:45,437 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);" "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;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-03-04 15:35:45,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1871664325, now seen corresponding path program 1 times [2025-03-04 15:35:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:45,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660483876] [2025-03-04 15:35:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:45,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:35:45,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:35:45,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:45,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:45,442 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:45,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:35:45,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:35:45,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:45,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:45,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:45,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash 538808645, now seen corresponding path program 1 times [2025-03-04 15:35:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964220703] [2025-03-04 15:35:45,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:45,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:35:45,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:35:45,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:45,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 15:35:45,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964220703] [2025-03-04 15:35:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964220703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:45,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:45,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:35:45,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769715993] [2025-03-04 15:35:45,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:45,477 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:45,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:35:45,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:35:45,478 INFO L87 Difference]: Start difference. First operand 574 states and 1150 transitions. cyclomatic complexity: 595 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 15:35:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:45,516 INFO L93 Difference]: Finished difference Result 541 states and 976 transitions. [2025-03-04 15:35:45,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 541 states and 976 transitions. [2025-03-04 15:35:45,519 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-03-04 15:35:45,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 541 states to 499 states and 928 transitions. [2025-03-04 15:35:45,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2025-03-04 15:35:45,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2025-03-04 15:35:45,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 499 states and 928 transitions. [2025-03-04 15:35:45,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:45,523 INFO L218 hiAutomatonCegarLoop]: Abstraction has 499 states and 928 transitions. [2025-03-04 15:35:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states and 928 transitions. [2025-03-04 15:35:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 489. [2025-03-04 15:35:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 328 states have (on average 1.1890243902439024) internal successors, (390), 355 states have internal predecessors, (390), 97 states have call successors, (103), 53 states have call predecessors, (103), 64 states have return successors, (422), 80 states have call predecessors, (422), 94 states have call successors, (422) [2025-03-04 15:35:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 915 transitions. [2025-03-04 15:35:45,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 489 states and 915 transitions. [2025-03-04 15:35:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:35:45,534 INFO L432 stractBuchiCegarLoop]: Abstraction has 489 states and 915 transitions. [2025-03-04 15:35:45,534 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 15:35:45,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 489 states and 915 transitions. [2025-03-04 15:35:45,535 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-03-04 15:35:45,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:45,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:45,536 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-04 15:35:45,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 13, 10, 7, 7, 7, 7, 7, 6, 6, 4, 3] [2025-03-04 15:35:45,536 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-04 15:35:45,536 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);" "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);" "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;" >"#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;" >"#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-03-04 15:35:45,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1871664325, now seen corresponding path program 2 times [2025-03-04 15:35:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:45,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079898236] [2025-03-04 15:35:45,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:45,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:45,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-04 15:35:45,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:35:45,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:45,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:45,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:45,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:35:45,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:35:45,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:45,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:45,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:45,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:45,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1920836655, now seen corresponding path program 1 times [2025-03-04 15:35:45,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:45,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484612681] [2025-03-04 15:35:45,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:45,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:45,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 15:35:45,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 15:35:45,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:45,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 149 proven. 84 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-04 15:35:45,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484612681] [2025-03-04 15:35:45,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484612681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195176538] [2025-03-04 15:35:45,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:45,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:45,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:45,741 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-04 15:35:45,742 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-04 15:35:45,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 15:35:45,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 15:35:45,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:45,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:45,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:45,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 257 proven. 10 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-04 15:35:45,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 87 proven. 86 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 15:35:46,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195176538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:46,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:46,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2025-03-04 15:35:46,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249674171] [2025-03-04 15:35:46,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:46,145 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:46,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:46,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:35:46,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:35:46,146 INFO L87 Difference]: Start difference. First operand 489 states and 915 transitions. cyclomatic complexity: 445 Second operand has 15 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 11 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-04 15:35:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:46,570 INFO L93 Difference]: Finished difference Result 753 states and 1697 transitions. [2025-03-04 15:35:46,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 753 states and 1697 transitions. [2025-03-04 15:35:46,590 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 75 [2025-03-04 15:35:46,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 753 states to 673 states and 1487 transitions. [2025-03-04 15:35:46,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 265 [2025-03-04 15:35:46,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 265 [2025-03-04 15:35:46,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 673 states and 1487 transitions. [2025-03-04 15:35:46,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:46,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 673 states and 1487 transitions. [2025-03-04 15:35:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states and 1487 transitions. [2025-03-04 15:35:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 573. [2025-03-04 15:35:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 378 states have (on average 1.164021164021164) internal successors, (440), 415 states have internal predecessors, (440), 111 states have call successors, (117), 57 states have call predecessors, (117), 84 states have return successors, (594), 100 states have call predecessors, (594), 104 states have call successors, (594) [2025-03-04 15:35:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1151 transitions. [2025-03-04 15:35:46,615 INFO L240 hiAutomatonCegarLoop]: Abstraction has 573 states and 1151 transitions. [2025-03-04 15:35:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:35:46,616 INFO L432 stractBuchiCegarLoop]: Abstraction has 573 states and 1151 transitions. [2025-03-04 15:35:46,616 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 15:35:46,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 1151 transitions. [2025-03-04 15:35:46,618 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 72 [2025-03-04 15:35:46,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:46,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:46,619 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] [2025-03-04 15:35:46,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:46,619 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;" [2025-03-04 15:35:46,619 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-04 15:35:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1463644386, now seen corresponding path program 1 times [2025-03-04 15:35:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:46,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848426954] [2025-03-04 15:35:46,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:46,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:46,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:35:46,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:35:46,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:46,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:46,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:46,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:35:46,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:35:46,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:46,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:46,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:46,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:46,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1417212244, now seen corresponding path program 1 times [2025-03-04 15:35:46,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:46,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509847480] [2025-03-04 15:35:46,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:46,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:35:46,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:35:46,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:46,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:46,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:46,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:35:46,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:35:46,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:46,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:46,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:46,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash 276627505, now seen corresponding path program 3 times [2025-03-04 15:35:46,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:46,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011440750] [2025-03-04 15:35:46,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:46,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:46,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 4 equivalence classes. [2025-03-04 15:35:46,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 15:35:46,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:35:46,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 15:35:46,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011440750] [2025-03-04 15:35:46,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011440750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673737207] [2025-03-04 15:35:46,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:46,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:46,689 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:46,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-03-04 15:35:46,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 4 equivalence classes. [2025-03-04 15:35:46,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 15:35:46,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:35:46,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:46,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:35:46,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 15:35:46,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 15:35:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673737207] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:46,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:46,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-03-04 15:35:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409318467] [2025-03-04 15:35:46,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:46,895 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:46,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:46,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:46,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:46,896 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:46,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:46,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:46,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2025-03-04 15:35:46,896 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:46,896 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:46,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,949 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:46,949 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:46,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:46,952 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-04 15:35:46,953 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-04 15:35:46,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:46,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:46,966 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:46,966 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:46,972 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-04 15:35:46,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:46,974 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-04 15:35:46,974 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-04 15:35:46,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:46,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:46,987 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:46,987 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-04 15:35:46,993 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-04 15:35:46,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:46,998 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-04 15:35:47,000 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-04 15:35:47,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:47,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:47,010 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:47,011 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-04 15:35:47,018 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-04 15:35:47,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,021 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-04 15:35:47,022 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-04 15:35:47,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:47,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:47,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:47,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,051 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-04 15:35:47,051 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-04 15:35:47,052 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:47,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:47,378 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:47,389 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-04 15:35:47,389 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:47,389 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:47,389 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:47,389 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:47,389 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:47,389 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,389 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:47,389 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:47,389 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2025-03-04 15:35:47,389 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:47,389 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:47,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,444 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:47,444 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:47,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,446 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-04 15:35:47,448 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-04 15:35:47,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-04 15:35:47,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:47,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:47,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:47,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:47,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:47,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:47,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:47,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:47,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:47,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,472 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-04 15:35:47,474 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-04 15:35:47,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:47,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:47,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:47,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:47,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:47,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:47,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:47,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:47,489 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:47,492 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:35:47,492 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:35:47,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,494 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-04 15:35:47,495 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-04 15:35:47,496 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:47,496 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:47,496 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:47,496 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2025-03-04 15:35:47,501 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-04 15:35:47,502 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:47,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:47,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:35:47,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:35:47,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:47,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:47,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:35:47,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:47,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:35:47,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:35:47,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:47,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:47,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:35:47,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:47,684 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-04 15:35:47,685 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-04 15:35:47,685 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 573 states and 1151 transitions. cyclomatic complexity: 596 Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 15:35:47,799 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 573 states and 1151 transitions. cyclomatic complexity: 596. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 2153 states and 4253 transitions. Complement of second has 28 states. [2025-03-04 15:35:47,799 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-04 15:35:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 15:35:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2025-03-04 15:35:47,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 40 letters. Loop has 10 letters. [2025-03-04 15:35:47,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:47,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 50 letters. Loop has 10 letters. [2025-03-04 15:35:47,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:47,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 40 letters. Loop has 20 letters. [2025-03-04 15:35:47,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:47,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2153 states and 4253 transitions. [2025-03-04 15:35:47,833 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-04 15:35:47,835 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 132 [2025-03-04 15:35:47,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2153 states to 1841 states and 3747 transitions. [2025-03-04 15:35:47,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 546 [2025-03-04 15:35:47,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 553 [2025-03-04 15:35:47,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1841 states and 3747 transitions. [2025-03-04 15:35:47,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:47,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1841 states and 3747 transitions. [2025-03-04 15:35:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states and 3747 transitions. [2025-03-04 15:35:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1724. [2025-03-04 15:35:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1081 states have (on average 1.15263644773358) internal successors, (1246), 1185 states have internal predecessors, (1246), 373 states have call successors, (383), 160 states have call predecessors, (383), 270 states have return successors, (1837), 378 states have call predecessors, (1837), 351 states have call successors, (1837) [2025-03-04 15:35:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3466 transitions. [2025-03-04 15:35:47,898 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1724 states and 3466 transitions. [2025-03-04 15:35:47,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:47,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:35:47,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:35:47,898 INFO L87 Difference]: Start difference. First operand 1724 states and 3466 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, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 15:35:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:47,969 INFO L93 Difference]: Finished difference Result 1979 states and 3816 transitions. [2025-03-04 15:35:47,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1979 states and 3816 transitions. [2025-03-04 15:35:47,981 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 141 [2025-03-04 15:35:47,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1979 states to 1917 states and 3729 transitions. [2025-03-04 15:35:47,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 537 [2025-03-04 15:35:48,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 537 [2025-03-04 15:35:48,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1917 states and 3729 transitions. [2025-03-04 15:35:48,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:48,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1917 states and 3729 transitions. [2025-03-04 15:35:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states and 3729 transitions. [2025-03-04 15:35:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1856. [2025-03-04 15:35:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1164 states have (on average 1.1546391752577319) internal successors, (1344), 1279 states have internal predecessors, (1344), 400 states have call successors, (412), 173 states have call predecessors, (412), 292 states have return successors, (1896), 403 states have call predecessors, (1896), 373 states have call successors, (1896) [2025-03-04 15:35:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 3652 transitions. [2025-03-04 15:35:48,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1856 states and 3652 transitions. [2025-03-04 15:35:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:35:48,041 INFO L432 stractBuchiCegarLoop]: Abstraction has 1856 states and 3652 transitions. [2025-03-04 15:35:48,041 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-04 15:35:48,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1856 states and 3652 transitions. [2025-03-04 15:35:48,049 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 139 [2025-03-04 15:35:48,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:48,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:48,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:48,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:35:48,050 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);" "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);"< [2025-03-04 15:35:48,050 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-04 15:35:48,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:48,050 INFO L85 PathProgramCache]: Analyzing trace with hash -976570759, now seen corresponding path program 1 times [2025-03-04 15:35:48,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:48,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510838316] [2025-03-04 15:35:48,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:48,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:48,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:35:48,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:35:48,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:48,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 15:35:48,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510838316] [2025-03-04 15:35:48,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510838316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445148055] [2025-03-04 15:35:48,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:48,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:48,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:48,106 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:48,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-03-04 15:35:48,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:35:48,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:35:48,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:48,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:48,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:48,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 15:35:48,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 15:35:48,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445148055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:48,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:48,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-04 15:35:48,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10402374] [2025-03-04 15:35:48,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:48,203 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 39094726, now seen corresponding path program 2 times [2025-03-04 15:35:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677387169] [2025-03-04 15:35:48,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:48,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:48,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:48,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:48,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:48,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:48,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:48,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:48,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:48,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:48,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:48,258 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:48,259 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:48,259 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:48,259 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:48,259 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:48,259 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:48,259 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:48,259 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:48,259 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2025-03-04 15:35:48,259 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:48,259 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:48,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,296 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:48,296 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:48,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:48,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:48,324 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-04 15:35:48,325 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-04 15:35:48,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:48,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:48,342 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:48,342 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:48,348 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-04 15:35:48,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:48,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:48,351 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-04 15:35:48,352 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-04 15:35:48,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:48,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:48,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 15:35:48,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:48,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:48,372 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-04 15:35:48,373 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-04 15:35:48,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:48,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:48,417 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:48,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:48,421 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:48,421 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:48,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:48,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:48,422 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:48,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:48,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:48,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:48,422 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2025-03-04 15:35:48,422 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:48,422 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:48,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:48,466 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:48,466 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:48,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:48,469 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:35:48,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 15:35:48,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:48,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:48,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:48,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:48,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:48,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:48,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:48,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:48,487 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:48,490 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:35:48,490 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:35:48,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:48,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:48,493 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-04 15:35:48,494 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-04 15:35:48,496 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:48,496 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:48,496 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:48,496 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2025-03-04 15:35:48,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:48,502 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:48,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:48,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:35:48,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:35:48,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:48,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:48,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:35:48,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:48,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:48,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:48,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:48,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:48,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:48,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:48,710 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-04 15:35:48,710 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-04 15:35:48,711 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1856 states and 3652 transitions. cyclomatic complexity: 1842 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:35:48,797 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1856 states and 3652 transitions. cyclomatic complexity: 1842. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 2055 states and 3925 transitions. Complement of second has 30 states. [2025-03-04 15:35:48,797 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-04 15:35:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:35:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2025-03-04 15:35:48,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 56 letters. Loop has 5 letters. [2025-03-04 15:35:48,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:48,798 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:35:48,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:48,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:35:48,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:35:48,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:48,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:48,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:35:48,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:48,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:48,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:48,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:48,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:48,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:48,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:48,983 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-04 15:35:48,983 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-04 15:35:48,983 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1856 states and 3652 transitions. cyclomatic complexity: 1842 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:35:49,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1856 states and 3652 transitions. cyclomatic complexity: 1842. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 2055 states and 3925 transitions. Complement of second has 30 states. [2025-03-04 15:35:49,062 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-04 15:35:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:35:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2025-03-04 15:35:49,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 56 letters. Loop has 5 letters. [2025-03-04 15:35:49,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:49,063 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:35:49,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:49,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:35:49,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:35:49,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:49,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:49,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:35:49,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:49,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:49,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:49,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:49,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:49,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:49,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:49,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:49,272 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-04 15:35:49,272 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-04 15:35:49,272 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1856 states and 3652 transitions. cyclomatic complexity: 1842 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:35:49,366 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1856 states and 3652 transitions. cyclomatic complexity: 1842. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 3260 states and 5622 transitions. Complement of second has 32 states. [2025-03-04 15:35:49,367 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-04 15:35:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:35:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2025-03-04 15:35:49,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 56 letters. Loop has 5 letters. [2025-03-04 15:35:49,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:49,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 61 letters. Loop has 5 letters. [2025-03-04 15:35:49,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:49,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 56 letters. Loop has 10 letters. [2025-03-04 15:35:49,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:49,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3260 states and 5622 transitions. [2025-03-04 15:35:49,385 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 166 [2025-03-04 15:35:49,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3260 states to 2323 states and 4601 transitions. [2025-03-04 15:35:49,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 525 [2025-03-04 15:35:49,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 544 [2025-03-04 15:35:49,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2323 states and 4601 transitions. [2025-03-04 15:35:49,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:49,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2323 states and 4601 transitions. [2025-03-04 15:35:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states and 4601 transitions. [2025-03-04 15:35:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2133. [2025-03-04 15:35:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 1383 states have (on average 1.158351409978308) internal successors, (1602), 1521 states have internal predecessors, (1602), 413 states have call successors, (425), 208 states have call predecessors, (425), 337 states have return successors, (1945), 403 states have call predecessors, (1945), 384 states have call successors, (1945) [2025-03-04 15:35:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3972 transitions. [2025-03-04 15:35:49,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2133 states and 3972 transitions. [2025-03-04 15:35:49,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:49,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:35:49,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:35:49,474 INFO L87 Difference]: Start difference. First operand 2133 states and 3972 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-04 15:35:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:49,572 INFO L93 Difference]: Finished difference Result 2146 states and 3960 transitions. [2025-03-04 15:35:49,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2146 states and 3960 transitions. [2025-03-04 15:35:49,586 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 142 [2025-03-04 15:35:49,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2146 states to 2124 states and 3936 transitions. [2025-03-04 15:35:49,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2025-03-04 15:35:49,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2025-03-04 15:35:49,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2124 states and 3936 transitions. [2025-03-04 15:35:49,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:49,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2124 states and 3936 transitions. [2025-03-04 15:35:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states and 3936 transitions. [2025-03-04 15:35:49,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 2081. [2025-03-04 15:35:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 1352 states have (on average 1.1560650887573964) internal successors, (1563), 1486 states have internal predecessors, (1563), 398 states have call successors, (408), 202 states have call predecessors, (408), 331 states have return successors, (1909), 392 states have call predecessors, (1909), 376 states have call successors, (1909) [2025-03-04 15:35:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3880 transitions. [2025-03-04 15:35:49,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2081 states and 3880 transitions. [2025-03-04 15:35:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:35:49,685 INFO L432 stractBuchiCegarLoop]: Abstraction has 2081 states and 3880 transitions. [2025-03-04 15:35:49,686 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-04 15:35:49,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2081 states and 3880 transitions. [2025-03-04 15:35:49,692 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 140 [2025-03-04 15:35:49,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:49,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:49,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:49,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:35:49,694 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);"< [2025-03-04 15:35:49,694 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);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< [2025-03-04 15:35:49,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash 85478765, now seen corresponding path program 1 times [2025-03-04 15:35:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:49,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989154408] [2025-03-04 15:35:49,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:49,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 15:35:49,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:35:49,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:49,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 27 proven. 22 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:35:49,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:49,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989154408] [2025-03-04 15:35:49,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989154408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:49,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357118101] [2025-03-04 15:35:49,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:49,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:49,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:49,766 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:49,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-03-04 15:35:49,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 15:35:49,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:35:49,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:49,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:49,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:35:49,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 27 proven. 22 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:35:49,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 27 proven. 22 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:35:49,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357118101] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:49,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:49,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-04 15:35:49,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689733294] [2025-03-04 15:35:49,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:49,910 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:49,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash 706452377, now seen corresponding path program 2 times [2025-03-04 15:35:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:49,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095998332] [2025-03-04 15:35:49,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:49,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:35:49,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:35:49,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:49,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:49,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:49,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:35:49,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:35:49,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:49,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:49,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:50,076 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:50,077 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:50,077 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:50,077 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:50,077 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:50,077 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:50,077 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:50,077 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:50,077 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2025-03-04 15:35:50,077 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:50,077 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:50,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,121 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:50,121 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:50,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:50,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:50,124 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-04 15:35:50,126 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-04 15:35:50,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:50,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:50,138 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:50,139 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:50,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:50,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:50,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:50,148 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-04 15:35:50,149 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-04 15:35:50,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:50,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:50,162 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:50,162 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-04 15:35:50,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-04 15:35:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:50,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:50,175 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-04 15:35:50,176 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-04 15:35:50,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:50,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:50,201 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-04 15:35:50,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:50,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:50,204 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-04 15:35:50,206 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-04 15:35:50,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:50,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:50,238 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:50,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:50,243 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:50,243 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:50,243 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:50,243 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:50,243 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:50,243 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:50,243 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:50,243 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:50,243 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2025-03-04 15:35:50,243 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:50,243 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:50,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:50,291 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:50,292 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:50,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:50,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:50,294 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:35:50,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-04 15:35:50,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:50,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:50,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:50,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:50,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:50,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:50,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:50,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:50,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:50,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:50,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:50,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:50,318 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-04 15:35:50,322 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-04 15:35:50,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:35:50,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:50,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:50,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:50,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:50,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:50,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:50,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:50,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:50,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:50,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:50,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:50,343 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-04 15:35:50,344 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-04 15:35:50,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:35:50,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:50,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:50,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:50,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:50,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:50,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:50,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:50,360 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:50,363 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:35:50,364 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:35:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:50,366 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-04 15:35:50,367 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-04 15:35:50,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:50,368 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:50,368 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:50,368 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-03-04 15:35:50,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:50,375 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:50,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:50,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 15:35:50,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:35:50,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:50,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:50,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:35:50,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:50,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:50,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:35:50,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:35:50,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:50,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:50,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:35:50,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:50,733 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2025-03-04 15:35:50,734 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2081 states and 3880 transitions. cyclomatic complexity: 1845 Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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-04 15:35:51,013 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2081 states and 3880 transitions. cyclomatic complexity: 1845. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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 6636 states and 12178 transitions. Complement of second has 48 states. [2025-03-04 15:35:51,014 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-04 15:35:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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-04 15:35:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2025-03-04 15:35:51,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 89 transitions. Stem has 57 letters. Loop has 15 letters. [2025-03-04 15:35:51,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:51,015 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:35:51,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:51,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 15:35:51,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:35:51,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:51,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:51,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:35:51,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:51,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:35:51,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:35:51,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:51,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:51,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:35:51,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:51,315 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2025-03-04 15:35:51,315 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2081 states and 3880 transitions. cyclomatic complexity: 1845 Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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-04 15:35:51,607 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2081 states and 3880 transitions. cyclomatic complexity: 1845. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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 11145 states and 19973 transitions. Complement of second has 56 states. [2025-03-04 15:35:51,608 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-04 15:35:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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-04 15:35:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2025-03-04 15:35:51,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 87 transitions. Stem has 57 letters. Loop has 15 letters. [2025-03-04 15:35:51,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:51,609 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:35:51,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:51,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 15:35:51,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:35:51,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:51,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:51,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:35:51,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:51,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:35:51,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:35:51,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:51,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:51,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:35:51,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:51,891 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 6 loop predicates [2025-03-04 15:35:51,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2081 states and 3880 transitions. cyclomatic complexity: 1845 Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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-04 15:35:52,284 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2081 states and 3880 transitions. cyclomatic complexity: 1845. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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 28777 states and 43086 transitions. Complement of second has 389 states. [2025-03-04 15:35:52,285 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-04 15:35:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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-04 15:35:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2025-03-04 15:35:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 96 transitions. Stem has 57 letters. Loop has 15 letters. [2025-03-04 15:35:52,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:52,288 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:35:52,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:52,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 15:35:52,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 15:35:52,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:52,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:52,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:35:52,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:52,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:35:52,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:35:52,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:52,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:52,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:35:52,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:52,591 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2025-03-04 15:35:52,591 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2081 states and 3880 transitions. cyclomatic complexity: 1845 Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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-04 15:35:53,032 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2081 states and 3880 transitions. cyclomatic complexity: 1845. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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 32643 states and 52085 transitions. Complement of second has 356 states. [2025-03-04 15:35:53,033 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-04 15:35:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 4 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-04 15:35:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2025-03-04 15:35:53,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 94 transitions. Stem has 57 letters. Loop has 15 letters. [2025-03-04 15:35:53,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:53,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 94 transitions. Stem has 72 letters. Loop has 15 letters. [2025-03-04 15:35:53,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:53,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 94 transitions. Stem has 57 letters. Loop has 30 letters. [2025-03-04 15:35:53,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:53,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32643 states and 52085 transitions. [2025-03-04 15:35:53,332 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 488 [2025-03-04 15:35:53,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32643 states to 17509 states and 32282 transitions. [2025-03-04 15:35:53,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2116 [2025-03-04 15:35:53,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2137 [2025-03-04 15:35:53,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17509 states and 32282 transitions. [2025-03-04 15:35:53,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:53,525 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17509 states and 32282 transitions. [2025-03-04 15:35:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17509 states and 32282 transitions. [2025-03-04 15:35:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17509 to 13423. [2025-03-04 15:35:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13423 states, 8600 states have (on average 1.1388372093023256) internal successors, (9794), 9453 states have internal predecessors, (9794), 2896 states have call successors, (2908), 1221 states have call predecessors, (2908), 1927 states have return successors, (9929), 2748 states have call predecessors, (9929), 2844 states have call successors, (9929) [2025-03-04 15:35:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13423 states to 13423 states and 22631 transitions. [2025-03-04 15:35:53,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13423 states and 22631 transitions. [2025-03-04 15:35:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:53,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:35:53,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:35:53,970 INFO L87 Difference]: Start difference. First operand 13423 states and 22631 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-04 15:35:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:54,085 INFO L93 Difference]: Finished difference Result 13466 states and 22715 transitions. [2025-03-04 15:35:54,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13466 states and 22715 transitions. [2025-03-04 15:35:54,222 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 389 [2025-03-04 15:35:54,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13466 states to 13452 states and 22698 transitions. [2025-03-04 15:35:54,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1672 [2025-03-04 15:35:54,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1672 [2025-03-04 15:35:54,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13452 states and 22698 transitions. [2025-03-04 15:35:54,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:54,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13452 states and 22698 transitions. [2025-03-04 15:35:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13452 states and 22698 transitions. [2025-03-04 15:35:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13452 to 13426. [2025-03-04 15:35:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13426 states, 8602 states have (on average 1.138804929086259) internal successors, (9796), 9455 states have internal predecessors, (9796), 2897 states have call successors, (2909), 1221 states have call predecessors, (2909), 1927 states have return successors, (9930), 2749 states have call predecessors, (9930), 2845 states have call successors, (9930) [2025-03-04 15:35:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13426 states to 13426 states and 22635 transitions. [2025-03-04 15:35:54,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13426 states and 22635 transitions. [2025-03-04 15:35:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:35:54,926 INFO L432 stractBuchiCegarLoop]: Abstraction has 13426 states and 22635 transitions. [2025-03-04 15:35:54,926 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-04 15:35:54,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13426 states and 22635 transitions. [2025-03-04 15:35:54,973 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 380 [2025-03-04 15:35:54,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:54,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:54,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:54,976 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 17, 16, 10, 10, 10, 9, 9, 8, 8, 6, 3] [2025-03-04 15:35:54,976 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~ret1 := parts(~p - ~q, ~q);"< [2025-03-04 15:35:54,976 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);" "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~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;" >"#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);" "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;#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;" >"#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);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< [2025-03-04 15:35:54,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash 591666247, now seen corresponding path program 2 times [2025-03-04 15:35:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:54,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045332487] [2025-03-04 15:35:54,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:54,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:54,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-04 15:35:54,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 15:35:54,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:54,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 15:35:55,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:55,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045332487] [2025-03-04 15:35:55,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045332487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:55,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271405666] [2025-03-04 15:35:55,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:55,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:55,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:55,085 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:55,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-03-04 15:35:55,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-04 15:35:55,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 15:35:55,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:55,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:55,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:35:55,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 15:35:55,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 15:35:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271405666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:55,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:55,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-04 15:35:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777577983] [2025-03-04 15:35:55,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:55,300 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:55,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash -936174231, now seen corresponding path program 2 times [2025-03-04 15:35:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422379942] [2025-03-04 15:35:55,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:55,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:55,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-04 15:35:55,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 15:35:55,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:55,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 171 proven. 122 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2025-03-04 15:35:55,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:55,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422379942] [2025-03-04 15:35:55,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422379942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:55,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662528770] [2025-03-04 15:35:55,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:55,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:55,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:55,365 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:55,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-03-04 15:35:55,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-04 15:35:55,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 15:35:55,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:55,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:55,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:35:55,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 526 proven. 72 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 15:35:55,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 195 proven. 233 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-03-04 15:35:56,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662528770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:56,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:56,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 20 [2025-03-04 15:35:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108311415] [2025-03-04 15:35:56,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:56,156 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:56,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 15:35:56,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:35:56,157 INFO L87 Difference]: Start difference. First operand 13426 states and 22635 transitions. cyclomatic complexity: 9356 Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 9 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 15:35:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:56,315 INFO L93 Difference]: Finished difference Result 11252 states and 18601 transitions. [2025-03-04 15:35:56,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11252 states and 18601 transitions. [2025-03-04 15:35:56,376 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 296 [2025-03-04 15:35:56,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11252 states to 11252 states and 18601 transitions. [2025-03-04 15:35:56,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1384 [2025-03-04 15:35:56,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1384 [2025-03-04 15:35:56,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11252 states and 18601 transitions. [2025-03-04 15:35:56,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:56,472 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11252 states and 18601 transitions. [2025-03-04 15:35:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11252 states and 18601 transitions. [2025-03-04 15:35:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11252 to 11130. [2025-03-04 15:35:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11130 states, 7107 states have (on average 1.129309131841846) internal successors, (8026), 7808 states have internal predecessors, (8026), 2396 states have call successors, (2408), 1002 states have call predecessors, (2408), 1627 states have return successors, (7980), 2319 states have call predecessors, (7980), 2357 states have call successors, (7980) [2025-03-04 15:35:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11130 states to 11130 states and 18414 transitions. [2025-03-04 15:35:56,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11130 states and 18414 transitions. [2025-03-04 15:35:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:35:56,670 INFO L432 stractBuchiCegarLoop]: Abstraction has 11130 states and 18414 transitions. [2025-03-04 15:35:56,670 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-04 15:35:56,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11130 states and 18414 transitions. [2025-03-04 15:35:56,775 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 296 [2025-03-04 15:35:56,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:56,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:56,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 7, 7, 7, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:56,777 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 10, 10, 7, 6, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1] [2025-03-04 15:35:56,778 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;" "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-04 15:35:56,778 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);" "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;#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;" >"#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);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< [2025-03-04 15:35:56,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1850908414, now seen corresponding path program 1 times [2025-03-04 15:35:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:56,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910610727] [2025-03-04 15:35:56,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:56,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 15:35:56,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:35:56,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 15:35:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910610727] [2025-03-04 15:35:56,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910610727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519833297] [2025-03-04 15:35:56,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:56,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:56,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:56,832 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:56,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-03-04 15:35:56,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 15:35:56,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:35:56,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:56,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:56,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:35:56,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 15:35:56,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:35:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519833297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:56,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:35:56,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-04 15:35:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605154615] [2025-03-04 15:35:56,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:56,894 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:56,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1476680590, now seen corresponding path program 1 times [2025-03-04 15:35:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563669149] [2025-03-04 15:35:56,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:56,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:56,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 15:35:56,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 15:35:56,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:56,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 128 proven. 4 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-04 15:35:56,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563669149] [2025-03-04 15:35:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563669149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090091757] [2025-03-04 15:35:56,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:56,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:56,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:56,937 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:56,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-03-04 15:35:56,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 15:35:56,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 15:35:56,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:56,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:56,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:35:56,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-04 15:35:56,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:35:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090091757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:56,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:35:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-04 15:35:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065397856] [2025-03-04 15:35:56,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:56,996 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:56,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:35:56,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:35:56,997 INFO L87 Difference]: Start difference. First operand 11130 states and 18414 transitions. cyclomatic complexity: 7398 Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 15:35:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:57,076 INFO L93 Difference]: Finished difference Result 9983 states and 15930 transitions. [2025-03-04 15:35:57,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9983 states and 15930 transitions. [2025-03-04 15:35:57,121 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 296 [2025-03-04 15:35:57,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9983 states to 9395 states and 15340 transitions. [2025-03-04 15:35:57,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1019 [2025-03-04 15:35:57,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1019 [2025-03-04 15:35:57,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9395 states and 15340 transitions. [2025-03-04 15:35:57,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:57,200 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9395 states and 15340 transitions. [2025-03-04 15:35:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9395 states and 15340 transitions. [2025-03-04 15:35:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9395 to 9150. [2025-03-04 15:35:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9150 states, 5919 states have (on average 1.1253590133468492) internal successors, (6661), 6484 states have internal predecessors, (6661), 2042 states have call successors, (2054), 913 states have call predecessors, (2054), 1189 states have return successors, (6243), 1752 states have call predecessors, (6243), 2003 states have call successors, (6243) [2025-03-04 15:35:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9150 states to 9150 states and 14958 transitions. [2025-03-04 15:35:57,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9150 states and 14958 transitions. [2025-03-04 15:35:57,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:35:57,377 INFO L432 stractBuchiCegarLoop]: Abstraction has 9150 states and 14958 transitions. [2025-03-04 15:35:57,377 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-04 15:35:57,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9150 states and 14958 transitions. [2025-03-04 15:35:57,402 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 273 [2025-03-04 15:35:57,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:57,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:57,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 7, 7, 7, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:57,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [62, 60, 49, 34, 29, 29, 28, 28, 27, 27, 15, 13, 5, 5, 5, 5] [2025-03-04 15:35:57,405 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;" "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-04 15:35:57,405 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);" "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~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);" "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~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);" "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;" >"#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;#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;" >"#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);" "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;" >"#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);" "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;" >"#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;" >"#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);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< [2025-03-04 15:35:57,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1850908414, now seen corresponding path program 2 times [2025-03-04 15:35:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:57,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444985733] [2025-03-04 15:35:57,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:57,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-03-04 15:35:57,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:35:57,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:57,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 15:35:57,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444985733] [2025-03-04 15:35:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444985733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096324014] [2025-03-04 15:35:57,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:57,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:57,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:57,458 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:57,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-03-04 15:35:57,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-03-04 15:35:57,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:35:57,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:57,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:57,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:35:57,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 15:35:57,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:35:57,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096324014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:57,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:35:57,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-04 15:35:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661786433] [2025-03-04 15:35:57,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:57,569 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:57,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:57,569 INFO L85 PathProgramCache]: Analyzing trace with hash 49058245, now seen corresponding path program 2 times [2025-03-04 15:35:57,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:57,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573717986] [2025-03-04 15:35:57,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:57,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 421 statements into 2 equivalence classes. [2025-03-04 15:35:57,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 421 of 421 statements. [2025-03-04 15:35:57,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:57,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10214 backedges. 783 proven. 1090 refuted. 0 times theorem prover too weak. 8341 trivial. 0 not checked. [2025-03-04 15:35:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573717986] [2025-03-04 15:35:58,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573717986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633010523] [2025-03-04 15:35:58,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:58,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:58,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:58,029 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:58,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2025-03-04 15:35:58,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 421 statements into 2 equivalence classes. [2025-03-04 15:35:58,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 421 of 421 statements. [2025-03-04 15:35:58,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:58,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:58,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:35:58,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10214 backedges. 783 proven. 1090 refuted. 0 times theorem prover too weak. 8341 trivial. 0 not checked. [2025-03-04 15:35:58,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10214 backedges. 783 proven. 1096 refuted. 0 times theorem prover too weak. 8335 trivial. 0 not checked. [2025-03-04 15:36:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633010523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:00,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 17 [2025-03-04 15:36:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626260050] [2025-03-04 15:36:00,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:00,037 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:00,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:36:00,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:36:00,038 INFO L87 Difference]: Start difference. First operand 9150 states and 14958 transitions. cyclomatic complexity: 5922 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-04 15:36:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:00,097 INFO L93 Difference]: Finished difference Result 2673 states and 4212 transitions. [2025-03-04 15:36:00,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2673 states and 4212 transitions. [2025-03-04 15:36:00,112 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 124 [2025-03-04 15:36:00,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2673 states to 2667 states and 4206 transitions. [2025-03-04 15:36:00,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 447 [2025-03-04 15:36:00,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2025-03-04 15:36:00,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2667 states and 4206 transitions. [2025-03-04 15:36:00,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:00,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2667 states and 4206 transitions. [2025-03-04 15:36:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states and 4206 transitions. [2025-03-04 15:36:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2647. [2025-03-04 15:36:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 1733 states have (on average 1.1229082515868436) internal successors, (1946), 1896 states have internal predecessors, (1946), 558 states have call successors, (564), 264 states have call predecessors, (564), 356 states have return successors, (1658), 486 states have call predecessors, (1658), 547 states have call successors, (1658) [2025-03-04 15:36:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 4168 transitions. [2025-03-04 15:36:00,173 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2647 states and 4168 transitions. [2025-03-04 15:36:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:36:00,174 INFO L432 stractBuchiCegarLoop]: Abstraction has 2647 states and 4168 transitions. [2025-03-04 15:36:00,174 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-04 15:36:00,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2647 states and 4168 transitions. [2025-03-04 15:36:00,180 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 124 [2025-03-04 15:36:00,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:00,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:00,181 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-04 15:36:00,181 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-04 15:36:00,181 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-04 15:36:00,181 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-04 15:36:00,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 3 times [2025-03-04 15:36:00,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:00,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738625878] [2025-03-04 15:36:00,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:00,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:00,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 5 equivalence classes. [2025-03-04 15:36:00,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:36:00,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 15:36:00,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:00,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:00,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 15:36:00,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:36:00,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:00,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:00,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:00,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:00,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1240692240, now seen corresponding path program 1 times [2025-03-04 15:36:00,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:00,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617030564] [2025-03-04 15:36:00,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:00,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:00,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 15:36:00,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 15:36:00,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:00,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:00,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:00,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 15:36:00,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 15:36:00,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:00,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:00,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:00,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 418652956, now seen corresponding path program 4 times [2025-03-04 15:36:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378067529] [2025-03-04 15:36:00,213 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:00,218 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 145 statements into 2 equivalence classes. [2025-03-04 15:36:00,225 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 15:36:00,225 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:36:00,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 152 proven. 76 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2025-03-04 15:36:00,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:00,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378067529] [2025-03-04 15:36:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378067529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:00,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704008067] [2025-03-04 15:36:00,338 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:00,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:00,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:00,341 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:00,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-03-04 15:36:00,385 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 145 statements into 2 equivalence classes. [2025-03-04 15:36:00,410 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 15:36:00,410 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:36:00,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:00,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:36:00,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 472 proven. 10 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-03-04 15:36:00,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 152 proven. 76 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2025-03-04 15:36:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704008067] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:00,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:00,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2025-03-04 15:36:00,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601321371] [2025-03-04 15:36:00,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:01,169 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:01,170 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:01,170 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:01,170 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:01,170 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:01,170 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:01,170 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:01,170 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:01,170 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration20_Loop [2025-03-04 15:36:01,170 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:01,170 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:01,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:01,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:01,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:01,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:01,205 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:01,205 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:01,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:01,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:01,208 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-04 15:36:01,210 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-04 15:36:01,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:01,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:01,229 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:01,229 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-04 15:36:01,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-04 15:36:01,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:01,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:01,238 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-04 15:36:01,240 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-04 15:36:01,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:01,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:01,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-04 15:36:01,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:01,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:01,261 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-04 15:36:01,263 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-04 15:36:01,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:01,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:01,276 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:01,282 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-04 15:36:01,282 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:01,282 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:01,282 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:01,282 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:01,283 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:01,283 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:01,283 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:01,283 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:01,283 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration20_Loop [2025-03-04 15:36:01,283 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:01,283 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:01,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:01,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:01,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:01,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:01,319 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:01,319 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:01,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:01,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:01,322 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-04 15:36:01,323 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-04 15:36:01,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:01,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:01,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:01,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:01,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:01,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:01,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:01,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:01,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:01,342 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-04 15:36:01,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:01,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:01,344 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-04 15:36:01,346 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-04 15:36:01,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:01,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:01,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:01,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:01,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:01,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:01,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:01,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:01,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:01,365 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-04 15:36:01,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:01,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:01,368 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-04 15:36:01,369 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-04 15:36:01,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:01,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:01,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:01,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:01,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:01,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:01,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:01,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:01,383 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:01,385 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:01,385 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:01,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:01,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:01,388 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-04 15:36:01,388 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-04 15:36:01,389 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:01,389 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:01,389 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:01,389 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-04 15:36:01,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:01,396 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:01,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:01,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 15:36:01,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:36:01,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:01,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:01,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:36:01,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:01,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 15:36:01,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 15:36:01,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:01,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:01,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 15:36:01,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:01,929 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-04 15:36:01,929 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-04 15:36:01,929 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2647 states and 4168 transitions. cyclomatic complexity: 1555 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-04 15:36:02,166 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2647 states and 4168 transitions. cyclomatic complexity: 1555. 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 6539 states and 10282 transitions. Complement of second has 69 states. [2025-03-04 15:36:02,167 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-04 15:36:02,167 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-04 15:36:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2025-03-04 15:36:02,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 85 letters. Loop has 60 letters. [2025-03-04 15:36:02,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:02,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 145 letters. Loop has 60 letters. [2025-03-04 15:36:02,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:02,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 85 letters. Loop has 120 letters. [2025-03-04 15:36:02,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:02,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6539 states and 10282 transitions. [2025-03-04 15:36:02,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 155 [2025-03-04 15:36:02,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6539 states to 6206 states and 9615 transitions. [2025-03-04 15:36:02,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2025-03-04 15:36:02,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2025-03-04 15:36:02,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6206 states and 9615 transitions. [2025-03-04 15:36:02,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:02,244 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6206 states and 9615 transitions. [2025-03-04 15:36:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states and 9615 transitions. [2025-03-04 15:36:02,299 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Exception during sending of exit command (exit): Broken pipe [2025-03-04 15:36:02,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 5569. [2025-03-04 15:36:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5569 states, 3652 states have (on average 1.1133625410733845) internal successors, (4066), 3974 states have internal predecessors, (4066), 1172 states have call successors, (1184), 547 states have call predecessors, (1184), 745 states have return successors, (3272), 1047 states have call predecessors, (3272), 1156 states have call successors, (3272) [2025-03-04 15:36:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 8522 transitions. [2025-03-04 15:36:02,396 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5569 states and 8522 transitions. [2025-03-04 15:36:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:02,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:36:02,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:36:02,396 INFO L87 Difference]: Start difference. First operand 5569 states and 8522 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 12 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-04 15:36:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:02,632 INFO L93 Difference]: Finished difference Result 5796 states and 8845 transitions. [2025-03-04 15:36:02,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5796 states and 8845 transitions. [2025-03-04 15:36:02,665 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 153 [2025-03-04 15:36:02,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5796 states to 3015 states and 4629 transitions. [2025-03-04 15:36:02,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2025-03-04 15:36:02,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 518 [2025-03-04 15:36:02,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3015 states and 4629 transitions. [2025-03-04 15:36:02,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:02,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3015 states and 4629 transitions. [2025-03-04 15:36:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states and 4629 transitions. [2025-03-04 15:36:02,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 2901. [2025-03-04 15:36:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 1903 states have (on average 1.115081450341566) internal successors, (2122), 2076 states have internal predecessors, (2122), 612 states have call successors, (620), 285 states have call predecessors, (620), 386 states have return successors, (1724), 539 states have call predecessors, (1724), 596 states have call successors, (1724) [2025-03-04 15:36:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 4466 transitions. [2025-03-04 15:36:02,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2901 states and 4466 transitions. [2025-03-04 15:36:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:36:02,739 INFO L432 stractBuchiCegarLoop]: Abstraction has 2901 states and 4466 transitions. [2025-03-04 15:36:02,739 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-04 15:36:02,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2901 states and 4466 transitions. [2025-03-04 15:36:02,748 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 152 [2025-03-04 15:36:02,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:02,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:02,750 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 15, 9, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:36:02,750 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-04 15:36:02,750 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);" "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;" >"#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-04 15:36:02,750 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);" "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;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-04 15:36:02,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:02,751 INFO L85 PathProgramCache]: Analyzing trace with hash -942282511, now seen corresponding path program 5 times [2025-03-04 15:36:02,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:02,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207392288] [2025-03-04 15:36:02,751 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:02,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:02,756 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 161 statements into 10 equivalence classes. [2025-03-04 15:36:02,761 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 51 of 161 statements. [2025-03-04 15:36:02,761 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 15:36:02,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 277 proven. 128 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2025-03-04 15:36:02,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:02,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207392288] [2025-03-04 15:36:02,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207392288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:02,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030810454] [2025-03-04 15:36:02,926 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:02,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:02,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:02,928 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:02,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2025-03-04 15:36:02,978 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 161 statements into 10 equivalence classes. [2025-03-04 15:36:02,990 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 51 of 161 statements. [2025-03-04 15:36:02,991 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 15:36:02,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:02,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 15:36:02,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 279 proven. 120 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2025-03-04 15:36:03,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 279 proven. 122 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-03-04 15:36:03,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030810454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:03,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:03,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 24 [2025-03-04 15:36:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431892417] [2025-03-04 15:36:03,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:03,796 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:03,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash -429571210, now seen corresponding path program 2 times [2025-03-04 15:36:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:03,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818899457] [2025-03-04 15:36:03,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:03,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-04 15:36:03,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 15:36:03,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:03,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 82 proven. 212 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-04 15:36:03,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:03,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818899457] [2025-03-04 15:36:03,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818899457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:03,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406544019] [2025-03-04 15:36:03,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:03,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:03,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,971 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2025-03-04 15:36:04,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-04 15:36:04,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 15:36:04,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:04,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:04,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:36:04,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 405 proven. 3 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-04 15:36:04,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 81 proven. 69 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-03-04 15:36:04,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406544019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:04,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:04,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 21 [2025-03-04 15:36:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117375216] [2025-03-04 15:36:04,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:04,265 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:04,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:36:04,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:36:04,266 INFO L87 Difference]: Start difference. First operand 2901 states and 4466 transitions. cyclomatic complexity: 1601 Second operand has 21 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 13 states have call successors, (23), 2 states have call predecessors, (23), 8 states have return successors, (24), 13 states have call predecessors, (24), 13 states have call successors, (24) [2025-03-04 15:36:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:04,675 INFO L93 Difference]: Finished difference Result 3460 states and 5489 transitions. [2025-03-04 15:36:04,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3460 states and 5489 transitions. [2025-03-04 15:36:04,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 159 [2025-03-04 15:36:04,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3460 states to 3339 states and 5283 transitions. [2025-03-04 15:36:04,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 587 [2025-03-04 15:36:04,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 587 [2025-03-04 15:36:04,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3339 states and 5283 transitions. [2025-03-04 15:36:04,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:04,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3339 states and 5283 transitions. [2025-03-04 15:36:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states and 5283 transitions. [2025-03-04 15:36:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2919. [2025-03-04 15:36:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 1921 states have (on average 1.112441436751692) internal successors, (2137), 2089 states have internal predecessors, (2137), 615 states have call successors, (624), 292 states have call predecessors, (624), 383 states have return successors, (1721), 537 states have call predecessors, (1721), 593 states have call successors, (1721) [2025-03-04 15:36:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4482 transitions. [2025-03-04 15:36:04,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2919 states and 4482 transitions. [2025-03-04 15:36:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 15:36:04,813 INFO L432 stractBuchiCegarLoop]: Abstraction has 2919 states and 4482 transitions. [2025-03-04 15:36:04,813 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-04 15:36:04,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2919 states and 4482 transitions. [2025-03-04 15:36:04,819 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 152 [2025-03-04 15:36:04,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:04,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:04,821 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-04 15:36:04,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 24, 14, 12, 12, 12, 12, 12, 12, 10, 6, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1] [2025-03-04 15:36:04,821 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-04 15:36:04,821 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);" "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~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;" >"#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;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-04 15:36:04,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 6 times [2025-03-04 15:36:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76554567] [2025-03-04 15:36:04,822 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:04,825 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 85 statements into 5 equivalence classes. [2025-03-04 15:36:04,831 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:36:04,832 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 15:36:04,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:04,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:04,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 15:36:04,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:36:04,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:04,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:04,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:04,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash 598607385, now seen corresponding path program 3 times [2025-03-04 15:36:04,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:04,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565329862] [2025-03-04 15:36:04,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:04,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 212 statements into 12 equivalence classes. [2025-03-04 15:36:04,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 164 of 212 statements. [2025-03-04 15:36:04,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 15:36:04,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2329 backedges. 632 proven. 70 refuted. 0 times theorem prover too weak. 1627 trivial. 0 not checked. [2025-03-04 15:36:05,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:05,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565329862] [2025-03-04 15:36:05,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565329862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:05,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315439129] [2025-03-04 15:36:05,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:05,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:05,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,108 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-04 15:36:05,109 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-04 15:36:05,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 212 statements into 12 equivalence classes. [2025-03-04 15:36:05,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 164 of 212 statements. [2025-03-04 15:36:05,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 15:36:05,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:05,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 15:36:05,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2329 backedges. 627 proven. 71 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2025-03-04 15:36:05,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2329 backedges. 627 proven. 75 refuted. 0 times theorem prover too weak. 1627 trivial. 0 not checked. [2025-03-04 15:36:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315439129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:06,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:06,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 29 [2025-03-04 15:36:06,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071523564] [2025-03-04 15:36:06,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:06,202 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:06,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 15:36:06,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2025-03-04 15:36:06,202 INFO L87 Difference]: Start difference. First operand 2919 states and 4482 transitions. cyclomatic complexity: 1602 Second operand has 29 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 15 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (23), 12 states have call predecessors, (23), 15 states have call successors, (23) [2025-03-04 15:36:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:06,883 INFO L93 Difference]: Finished difference Result 3517 states and 5081 transitions. [2025-03-04 15:36:06,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3517 states and 5081 transitions. [2025-03-04 15:36:06,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 150 [2025-03-04 15:36:06,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3517 states to 3278 states and 4753 transitions. [2025-03-04 15:36:06,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2025-03-04 15:36:06,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 657 [2025-03-04 15:36:06,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3278 states and 4753 transitions. [2025-03-04 15:36:06,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:06,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3278 states and 4753 transitions. [2025-03-04 15:36:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states and 4753 transitions. [2025-03-04 15:36:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 2497. [2025-03-04 15:36:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2497 states, 1679 states have (on average 1.0810005955926147) internal successors, (1815), 1769 states have internal predecessors, (1815), 462 states have call successors, (471), 269 states have call predecessors, (471), 356 states have return successors, (1336), 458 states have call predecessors, (1336), 449 states have call successors, (1336) [2025-03-04 15:36:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 3622 transitions. [2025-03-04 15:36:06,953 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2497 states and 3622 transitions. [2025-03-04 15:36:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 15:36:06,953 INFO L432 stractBuchiCegarLoop]: Abstraction has 2497 states and 3622 transitions. [2025-03-04 15:36:06,954 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-04 15:36:06,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2497 states and 3622 transitions. [2025-03-04 15:36:06,958 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2025-03-04 15:36:06,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:06,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:06,960 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-04 15:36:06,960 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-04 15:36:06,960 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-04 15:36:06,960 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-04 15:36:06,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 7 times [2025-03-04 15:36:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110169333] [2025-03-04 15:36:06,961 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 15:36:06,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:36:06,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,969 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:06,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 15:36:06,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:36:06,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:06,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash -672660034, now seen corresponding path program 4 times [2025-03-04 15:36:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533079165] [2025-03-04 15:36:06,978 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,984 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 149 statements into 2 equivalence classes. [2025-03-04 15:36:06,992 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 15:36:06,992 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:06,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:06,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 15:36:07,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 15:36:07,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:07,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:07,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1279671858, now seen corresponding path program 8 times [2025-03-04 15:36:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:07,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754689365] [2025-03-04 15:36:07,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:07,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 234 statements into 2 equivalence classes. [2025-03-04 15:36:07,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 234 of 234 statements. [2025-03-04 15:36:07,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:07,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 23 proven. 114 refuted. 0 times theorem prover too weak. 2431 trivial. 0 not checked. [2025-03-04 15:36:07,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754689365] [2025-03-04 15:36:07,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754689365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117472682] [2025-03-04 15:36:07,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:07,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:07,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,179 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-04 15:36:07,181 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-04 15:36:07,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 234 statements into 2 equivalence classes. [2025-03-04 15:36:07,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 234 of 234 statements. [2025-03-04 15:36:07,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:07,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 1018 proven. 80 refuted. 0 times theorem prover too weak. 1470 trivial. 0 not checked. [2025-03-04 15:36:07,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 23 proven. 114 refuted. 0 times theorem prover too weak. 2431 trivial. 0 not checked. [2025-03-04 15:36:07,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117472682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:07,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:07,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2025-03-04 15:36:07,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770276504] [2025-03-04 15:36:07,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:08,565 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:08,566 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:08,566 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:08,566 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:08,566 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:08,566 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,566 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:08,566 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:08,566 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration23_Loop [2025-03-04 15:36:08,566 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:08,566 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:08,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,592 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:08,592 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:08,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,594 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-04 15:36:08,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:08,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,607 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:08,607 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-04 15:36:08,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-03-04 15:36:08,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,614 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-04 15:36:08,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:08,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,627 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:08,627 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-04 15:36:08,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-04 15:36:08,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,634 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-03-04 15:36:08,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:08,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-03-04 15:36:08,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,655 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-04 15:36:08,656 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-04 15:36:08,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:08,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,841 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:08,847 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-04 15:36:08,848 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:08,848 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:08,848 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:08,848 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:08,848 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:08,848 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,848 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:08,848 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:08,848 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration23_Loop [2025-03-04 15:36:08,848 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:08,848 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:08,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,874 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:08,874 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:08,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,892 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-04 15:36:08,893 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-04 15:36:08,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:08,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-03-04 15:36:08,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,911 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-04 15:36:08,912 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-04 15:36:08,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:08,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-03-04 15:36:08,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,931 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-04 15:36:08,932 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-04 15:36:08,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:08,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,946 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:08,947 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:08,947 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:08,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,949 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-04 15:36:08,950 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:08,950 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:08,950 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:08,950 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-04 15:36:08,956 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-04 15:36:08,956 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:08,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:08,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 15:36:09,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 15:36:09,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 15:36:09,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 15:36:09,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,697 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-04 15:36:09,698 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-04 15:36:09,698 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2497 states and 3622 transitions. cyclomatic complexity: 1157 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-04 15:36:10,010 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2497 states and 3622 transitions. cyclomatic complexity: 1157. 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 6890 states and 10093 transitions. Complement of second has 105 states. [2025-03-04 15:36:10,011 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-04 15:36:10,011 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-04 15:36:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 88 transitions. [2025-03-04 15:36:10,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 88 transitions. Stem has 85 letters. Loop has 149 letters. [2025-03-04 15:36:10,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:10,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 88 transitions. Stem has 234 letters. Loop has 149 letters. [2025-03-04 15:36:10,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:10,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 88 transitions. Stem has 85 letters. Loop has 298 letters. [2025-03-04 15:36:10,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:10,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6890 states and 10093 transitions. [2025-03-04 15:36:10,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:10,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 174 [2025-03-04 15:36:10,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6890 states to 6591 states and 9700 transitions. [2025-03-04 15:36:10,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 673 [2025-03-04 15:36:10,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 673 [2025-03-04 15:36:10,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6591 states and 9700 transitions. [2025-03-04 15:36:10,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:10,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6591 states and 9700 transitions. [2025-03-04 15:36:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states and 9700 transitions. [2025-03-04 15:36:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 5385. [2025-03-04 15:36:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5385 states, 3577 states have (on average 1.0757618115739447) internal successors, (3848), 3758 states have internal predecessors, (3848), 1017 states have call successors, (1032), 567 states have call predecessors, (1032), 791 states have return successors, (2863), 1059 states have call predecessors, (2863), 1003 states have call successors, (2863) [2025-03-04 15:36:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 7743 transitions. [2025-03-04 15:36:10,196 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5385 states and 7743 transitions. [2025-03-04 15:36:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:10,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:36:10,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:36:10,197 INFO L87 Difference]: Start difference. First operand 5385 states and 7743 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 12 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-04 15:36:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:10,293 INFO L93 Difference]: Finished difference Result 5540 states and 7979 transitions. [2025-03-04 15:36:10,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5540 states and 7979 transitions. [2025-03-04 15:36:10,315 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 174 [2025-03-04 15:36:10,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5540 states to 5514 states and 7945 transitions. [2025-03-04 15:36:10,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 529 [2025-03-04 15:36:10,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 539 [2025-03-04 15:36:10,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5514 states and 7945 transitions. [2025-03-04 15:36:10,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:10,350 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5514 states and 7945 transitions. [2025-03-04 15:36:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5514 states and 7945 transitions. [2025-03-04 15:36:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5514 to 5445. [2025-03-04 15:36:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5445 states, 3620 states have (on average 1.0751381215469613) internal successors, (3892), 3802 states have internal predecessors, (3892), 1034 states have call successors, (1052), 567 states have call predecessors, (1052), 791 states have return successors, (2883), 1075 states have call predecessors, (2883), 1018 states have call successors, (2883) [2025-03-04 15:36:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5445 states to 5445 states and 7827 transitions. [2025-03-04 15:36:10,418 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5445 states and 7827 transitions. [2025-03-04 15:36:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:36:10,418 INFO L432 stractBuchiCegarLoop]: Abstraction has 5445 states and 7827 transitions. [2025-03-04 15:36:10,418 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-04 15:36:10,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5445 states and 7827 transitions. [2025-03-04 15:36:10,428 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 162 [2025-03-04 15:36:10,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:10,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:10,429 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 12, 10, 7, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:10,429 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 8, 7, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1] [2025-03-04 15:36:10,430 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~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);" [2025-03-04 15:36:10,430 INFO L754 eck$LassoCheckResult]: Loop: "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);" "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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-03-04 15:36:10,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:10,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1589979712, now seen corresponding path program 9 times [2025-03-04 15:36:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:10,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816793393] [2025-03-04 15:36:10,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:10,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-03-04 15:36:10,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 15:36:10,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 15:36:10,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 159 proven. 101 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-04 15:36:10,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:10,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816793393] [2025-03-04 15:36:10,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816793393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:10,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842471860] [2025-03-04 15:36:10,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:10,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:10,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:10,599 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:10,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2025-03-04 15:36:10,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-03-04 15:36:10,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 15:36:10,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 15:36:10,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:10,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:36:10,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 183 proven. 96 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 15:36:10,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 185 proven. 94 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 15:36:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842471860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:11,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:11,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 19 [2025-03-04 15:36:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27311164] [2025-03-04 15:36:11,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:11,043 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:11,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash 691978533, now seen corresponding path program 3 times [2025-03-04 15:36:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:11,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847077893] [2025-03-04 15:36:11,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:11,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 5 equivalence classes. [2025-03-04 15:36:11,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:36:11,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 15:36:11,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:11,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:11,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 15:36:11,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:36:11,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:11,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:11,548 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:11,549 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:11,549 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:11,549 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:11,549 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:11,549 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,549 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:11,549 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:11,549 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration24_Loop [2025-03-04 15:36:11,549 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:11,549 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:11,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,587 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:11,587 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:11,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,589 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-04 15:36:11,591 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-04 15:36:11,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,601 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:11,602 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:11,607 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-04 15:36:11,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,609 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-04 15:36:11,609 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-04 15:36:11,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,621 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:11,621 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-04 15:36:11,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:11,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,628 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-04 15:36:11,629 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-04 15:36:11,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,640 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:11,640 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-04 15:36:11,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:11,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,648 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-04 15:36:11,648 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-04 15:36:11,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,660 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:11,660 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-04 15:36:11,665 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-04 15:36:11,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,668 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-04 15:36:11,668 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-04 15:36:11,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,695 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-04 15:36:11,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,697 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-04 15:36:11,698 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-04 15:36:11,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:11,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,879 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:11,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-03-04 15:36:11,886 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:11,887 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:11,887 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:11,887 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:11,887 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:11,887 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,887 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:11,887 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:11,887 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration24_Loop [2025-03-04 15:36:11,887 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:11,887 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:11,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,926 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:11,926 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:11,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,928 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-04 15:36:11,929 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-04 15:36:11,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-04 15:36:11,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:11,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:11,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:11,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:11,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:11,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:11,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:11,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:11,946 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-04 15:36:11,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,949 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:11,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-03-04 15:36:11,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:11,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:11,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:11,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:11,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:11,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:11,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:11,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:11,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:11,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:11,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,976 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:11,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-03-04 15:36:11,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:11,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:11,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:11,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:11,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:11,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:11,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:11,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:11,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:11,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-03-04 15:36:11,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,997 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:11,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-04 15:36:11,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:12,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:12,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:12,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:12,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:12,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:12,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:12,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:12,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:12,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-03-04 15:36:12,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:12,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:12,016 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:12,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-03-04 15:36:12,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:12,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:12,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:12,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:12,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:12,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:12,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:12,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:12,031 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:12,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:12,034 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:12,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:12,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:12,036 INFO L229 MonitoredProcess]: Starting monitored process 115 with /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-04 15:36:12,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-03-04 15:36:12,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:12,037 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:12,037 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:12,037 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2025-03-04 15:36:12,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-03-04 15:36:12,043 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:12,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 15:36:12,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 15:36:12,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:12,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:36:12,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:12,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-03-04 15:36:12,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 15:36:12,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:36:12,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:12,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:36:12,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 41 proven. 65 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 15:36:12,714 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-04 15:36:12,714 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5445 states and 7827 transitions. cyclomatic complexity: 2441 Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:12,818 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5445 states and 7827 transitions. cyclomatic complexity: 2441. Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Result 5581 states and 7973 transitions. Complement of second has 22 states. [2025-03-04 15:36:12,818 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-04 15:36:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2025-03-04 15:36:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 110 letters. Loop has 59 letters. [2025-03-04 15:36:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:12,819 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:12,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 15:36:12,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 15:36:12,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:12,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:36:12,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 15:36:13,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:36:13,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 41 proven. 65 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 15:36:13,441 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2025-03-04 15:36:13,441 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5445 states and 7827 transitions. cyclomatic complexity: 2441 Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:13,537 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5445 states and 7827 transitions. cyclomatic complexity: 2441. Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Result 5581 states and 7973 transitions. Complement of second has 22 states. [2025-03-04 15:36:13,538 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-04 15:36:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2025-03-04 15:36:13,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 110 letters. Loop has 59 letters. [2025-03-04 15:36:13,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:13,538 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:13,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:13,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 15:36:13,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 15:36:13,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 15:36:13,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:36:13,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 41 proven. 65 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 15:36:14,116 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 10 loop predicates [2025-03-04 15:36:14,116 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5445 states and 7827 transitions. cyclomatic complexity: 2441 Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:14,480 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5445 states and 7827 transitions. cyclomatic complexity: 2441. Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Result 13654 states and 18163 transitions. Complement of second has 121 states. [2025-03-04 15:36:14,481 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-04 15:36:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 86 transitions. [2025-03-04 15:36:14,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 86 transitions. Stem has 110 letters. Loop has 59 letters. [2025-03-04 15:36:14,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:14,482 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:14,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:14,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 15:36:14,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 15:36:14,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:14,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:14,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:36:14,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:14,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 15:36:14,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:36:14,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:14,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:14,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:36:14,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 41 proven. 65 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 15:36:15,131 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2025-03-04 15:36:15,131 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5445 states and 7827 transitions. cyclomatic complexity: 2441 Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:15,551 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5445 states and 7827 transitions. cyclomatic complexity: 2441. Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Result 14570 states and 19695 transitions. Complement of second has 124 states. [2025-03-04 15:36:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 93 transitions. [2025-03-04 15:36:15,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 93 transitions. Stem has 110 letters. Loop has 59 letters. [2025-03-04 15:36:15,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:15,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 93 transitions. Stem has 169 letters. Loop has 59 letters. [2025-03-04 15:36:15,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:15,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 93 transitions. Stem has 110 letters. Loop has 118 letters. [2025-03-04 15:36:15,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:15,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14570 states and 19695 transitions. [2025-03-04 15:36:15,635 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 164 [2025-03-04 15:36:15,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14570 states to 5734 states and 7966 transitions. [2025-03-04 15:36:15,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 956 [2025-03-04 15:36:15,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 962 [2025-03-04 15:36:15,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5734 states and 7966 transitions. [2025-03-04 15:36:15,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:15,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5734 states and 7966 transitions. [2025-03-04 15:36:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5734 states and 7966 transitions. [2025-03-04 15:36:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5734 to 4342. [2025-03-04 15:36:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4342 states, 2845 states have (on average 1.0625659050966607) internal successors, (3023), 2952 states have internal predecessors, (3023), 877 states have call successors, (895), 455 states have call predecessors, (895), 620 states have return successors, (1806), 934 states have call predecessors, (1806), 857 states have call successors, (1806) [2025-03-04 15:36:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4342 states to 4342 states and 5724 transitions. [2025-03-04 15:36:15,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4342 states and 5724 transitions. [2025-03-04 15:36:15,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:15,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:36:15,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:36:15,766 INFO L87 Difference]: Start difference. First operand 4342 states and 5724 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 14 states have internal predecessors, (63), 11 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-04 15:36:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:16,174 INFO L93 Difference]: Finished difference Result 4079 states and 5226 transitions. [2025-03-04 15:36:16,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4079 states and 5226 transitions. [2025-03-04 15:36:16,188 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 162 [2025-03-04 15:36:16,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4079 states to 3746 states and 4869 transitions. [2025-03-04 15:36:16,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 663 [2025-03-04 15:36:16,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 664 [2025-03-04 15:36:16,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3746 states and 4869 transitions. [2025-03-04 15:36:16,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:16,206 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3746 states and 4869 transitions. [2025-03-04 15:36:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states and 4869 transitions. [2025-03-04 15:36:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3466. [2025-03-04 15:36:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 2212 states have (on average 1.0583182640144666) internal successors, (2341), 2280 states have internal predecessors, (2341), 727 states have call successors, (739), 341 states have call predecessors, (739), 527 states have return successors, (1432), 844 states have call predecessors, (1432), 714 states have call successors, (1432) [2025-03-04 15:36:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 4512 transitions. [2025-03-04 15:36:16,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3466 states and 4512 transitions. [2025-03-04 15:36:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 15:36:16,244 INFO L432 stractBuchiCegarLoop]: Abstraction has 3466 states and 4512 transitions. [2025-03-04 15:36:16,245 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-04 15:36:16,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3466 states and 4512 transitions. [2025-03-04 15:36:16,251 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 162 [2025-03-04 15:36:16,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:16,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:16,252 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 19, 15, 9, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:16,252 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 9, 8, 7, 6, 6, 5, 5, 3, 3, 3, 2, 1, 1] [2025-03-04 15:36:16,252 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;" "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;" [2025-03-04 15:36:16,252 INFO L754 eck$LassoCheckResult]: Loop: "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~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;" >"#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-04 15:36:16,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1445797653, now seen corresponding path program 10 times [2025-03-04 15:36:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519836983] [2025-03-04 15:36:16,253 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:16,257 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 156 statements into 2 equivalence classes. [2025-03-04 15:36:16,262 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 15:36:16,263 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:36:16,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 324 proven. 117 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2025-03-04 15:36:16,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:16,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519836983] [2025-03-04 15:36:16,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519836983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:16,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656238244] [2025-03-04 15:36:16,390 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:16,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:16,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:16,392 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-04 15:36:16,394 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-04 15:36:16,449 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 156 statements into 2 equivalence classes. [2025-03-04 15:36:16,476 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 15:36:16,476 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:36:16,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:16,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:36:16,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 330 proven. 104 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-03-04 15:36:16,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 330 proven. 110 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 15:36:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656238244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:16,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:16,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 13] total 20 [2025-03-04 15:36:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684697506] [2025-03-04 15:36:16,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:16,866 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:16,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:16,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1766162805, now seen corresponding path program 1 times [2025-03-04 15:36:16,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:16,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857250931] [2025-03-04 15:36:16,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:16,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:16,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 15:36:16,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 15:36:16,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:16,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 115 proven. 88 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:36:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:16,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857250931] [2025-03-04 15:36:16,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857250931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:16,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491125125] [2025-03-04 15:36:16,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:16,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:16,949 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-04 15:36:16,950 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-04 15:36:17,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 15:36:17,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 15:36:17,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:17,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:17,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:36:17,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 105 proven. 88 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 15:36:17,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 105 proven. 88 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 15:36:17,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491125125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:17,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:17,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 18 [2025-03-04 15:36:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421966354] [2025-03-04 15:36:17,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:17,250 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:17,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:17,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:36:17,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:36:17,251 INFO L87 Difference]: Start difference. First operand 3466 states and 4512 transitions. cyclomatic complexity: 1068 Second operand has 18 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 12 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (17), 10 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 15:36:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:17,532 INFO L93 Difference]: Finished difference Result 3701 states and 4759 transitions. [2025-03-04 15:36:17,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3701 states and 4759 transitions. [2025-03-04 15:36:17,545 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 162 [2025-03-04 15:36:17,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3701 states to 2889 states and 3695 transitions. [2025-03-04 15:36:17,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 537 [2025-03-04 15:36:17,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 537 [2025-03-04 15:36:17,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2889 states and 3695 transitions. [2025-03-04 15:36:17,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:17,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2889 states and 3695 transitions. [2025-03-04 15:36:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states and 3695 transitions. [2025-03-04 15:36:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2708. [2025-03-04 15:36:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 1760 states have (on average 1.0585227272727273) internal successors, (1863), 1815 states have internal predecessors, (1863), 551 states have call successors, (563), 276 states have call predecessors, (563), 397 states have return successors, (1025), 616 states have call predecessors, (1025), 537 states have call successors, (1025) [2025-03-04 15:36:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3451 transitions. [2025-03-04 15:36:17,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2708 states and 3451 transitions. [2025-03-04 15:36:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:36:17,613 INFO L432 stractBuchiCegarLoop]: Abstraction has 2708 states and 3451 transitions. [2025-03-04 15:36:17,613 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-04 15:36:17,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2708 states and 3451 transitions. [2025-03-04 15:36:17,618 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 141 [2025-03-04 15:36:17,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:17,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:17,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 13, 9, 9, 8, 8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:17,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 10, 9, 8, 7, 7, 6, 6, 4, 3, 3, 2, 1, 1] [2025-03-04 15:36:17,619 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;" "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);" "assume !(~q <= 0);" "assume ~q > ~p;" [2025-03-04 15:36:17,619 INFO L754 eck$LassoCheckResult]: Loop: "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);" "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~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;" >"#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-04 15:36:17,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1884255283, now seen corresponding path program 11 times [2025-03-04 15:36:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:17,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581088019] [2025-03-04 15:36:17,620 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:17,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:17,624 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 142 statements into 9 equivalence classes. [2025-03-04 15:36:17,637 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 15:36:17,637 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-04 15:36:17,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 307 proven. 60 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-04 15:36:17,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581088019] [2025-03-04 15:36:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581088019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553266149] [2025-03-04 15:36:17,841 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:17,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:17,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:17,844 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:17,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2025-03-04 15:36:17,900 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 142 statements into 9 equivalence classes. [2025-03-04 15:36:17,927 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 15:36:17,927 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-04 15:36:17,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:17,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:36:17,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 301 proven. 54 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-04 15:36:17,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 301 proven. 55 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2025-03-04 15:36:18,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553266149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:18,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:18,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 22 [2025-03-04 15:36:18,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921909639] [2025-03-04 15:36:18,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:18,341 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:18,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash 589679704, now seen corresponding path program 2 times [2025-03-04 15:36:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303628129] [2025-03-04 15:36:18,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-04 15:36:18,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 15:36:18,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:18,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 97 proven. 113 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-04 15:36:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303628129] [2025-03-04 15:36:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303628129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520760464] [2025-03-04 15:36:18,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:18,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:18,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:18,400 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:18,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2025-03-04 15:36:18,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-04 15:36:18,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 15:36:18,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:18,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:18,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:36:18,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 161 proven. 6 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-03-04 15:36:18,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 102 proven. 108 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-04 15:36:18,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520760464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:18,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:18,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-04 15:36:18,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470058835] [2025-03-04 15:36:18,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:18,602 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:18,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:18,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:36:18,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:36:18,602 INFO L87 Difference]: Start difference. First operand 2708 states and 3451 transitions. cyclomatic complexity: 762 Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 15:36:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:18,772 INFO L93 Difference]: Finished difference Result 2805 states and 3575 transitions. [2025-03-04 15:36:18,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2805 states and 3575 transitions. [2025-03-04 15:36:18,782 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2025-03-04 15:36:18,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2805 states to 2790 states and 3560 transitions. [2025-03-04 15:36:18,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 510 [2025-03-04 15:36:18,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 510 [2025-03-04 15:36:18,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2790 states and 3560 transitions. [2025-03-04 15:36:18,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:18,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2790 states and 3560 transitions. [2025-03-04 15:36:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states and 3560 transitions. [2025-03-04 15:36:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2681. [2025-03-04 15:36:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 1742 states have (on average 1.0562571756601606) internal successors, (1840), 1792 states have internal predecessors, (1840), 547 states have call successors, (559), 274 states have call predecessors, (559), 392 states have return successors, (1006), 614 states have call predecessors, (1006), 534 states have call successors, (1006) [2025-03-04 15:36:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3405 transitions. [2025-03-04 15:36:18,831 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2681 states and 3405 transitions. [2025-03-04 15:36:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:36:18,831 INFO L432 stractBuchiCegarLoop]: Abstraction has 2681 states and 3405 transitions. [2025-03-04 15:36:18,831 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-04 15:36:18,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2681 states and 3405 transitions. [2025-03-04 15:36:18,835 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2025-03-04 15:36:18,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:18,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:18,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 19, 15, 9, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:18,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 11, 9, 9, 8, 8, 6, 6, 4, 3, 3, 2, 1, 1] [2025-03-04 15:36:18,836 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;" "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;" [2025-03-04 15:36:18,836 INFO L754 eck$LassoCheckResult]: Loop: "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~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;" >"#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-04 15:36:18,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1445797653, now seen corresponding path program 12 times [2025-03-04 15:36:18,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:18,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225509945] [2025-03-04 15:36:18,837 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:18,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:18,840 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 156 statements into 9 equivalence classes. [2025-03-04 15:36:18,842 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 156 statements. [2025-03-04 15:36:18,842 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-04 15:36:18,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 119 proven. 95 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-03-04 15:36:18,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:18,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225509945] [2025-03-04 15:36:18,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225509945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:18,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440025218] [2025-03-04 15:36:18,893 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:18,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:18,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:18,896 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:18,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2025-03-04 15:36:18,956 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 156 statements into 9 equivalence classes. [2025-03-04 15:36:18,964 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 156 statements. [2025-03-04 15:36:18,964 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-04 15:36:18,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:18,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:36:18,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 119 proven. 95 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-03-04 15:36:19,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 119 proven. 95 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-03-04 15:36:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440025218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:19,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:19,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-04 15:36:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705993313] [2025-03-04 15:36:19,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:19,130 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:19,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1157722043, now seen corresponding path program 3 times [2025-03-04 15:36:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:19,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466438843] [2025-03-04 15:36:19,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:19,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 11 equivalence classes. [2025-03-04 15:36:19,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 81 of 86 statements. [2025-03-04 15:36:19,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 15:36:19,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 180 proven. 67 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 15:36:19,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466438843] [2025-03-04 15:36:19,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466438843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918679835] [2025-03-04 15:36:19,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:19,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:19,272 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:19,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-03-04 15:36:19,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 11 equivalence classes. [2025-03-04 15:36:19,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 81 of 86 statements. [2025-03-04 15:36:19,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 15:36:19,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:19,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 15:36:19,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 195 proven. 83 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-04 15:36:19,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 194 proven. 84 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-04 15:36:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918679835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:19,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:19,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 29 [2025-03-04 15:36:19,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76537774] [2025-03-04 15:36:19,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:19,778 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:19,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:19,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 15:36:19,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2025-03-04 15:36:19,778 INFO L87 Difference]: Start difference. First operand 2681 states and 3405 transitions. cyclomatic complexity: 742 Second operand has 29 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 23 states have internal predecessors, (70), 15 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (21), 14 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-04 15:36:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:20,699 INFO L93 Difference]: Finished difference Result 3602 states and 4686 transitions. [2025-03-04 15:36:20,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3602 states and 4686 transitions. [2025-03-04 15:36:20,713 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 107 [2025-03-04 15:36:20,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3602 states to 3386 states and 4401 transitions. [2025-03-04 15:36:20,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 579 [2025-03-04 15:36:20,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 579 [2025-03-04 15:36:20,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3386 states and 4401 transitions. [2025-03-04 15:36:20,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:20,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3386 states and 4401 transitions. [2025-03-04 15:36:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states and 4401 transitions. [2025-03-04 15:36:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2726. [2025-03-04 15:36:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 1780 states have (on average 1.0488764044943821) internal successors, (1867), 1829 states have internal predecessors, (1867), 547 states have call successors, (559), 290 states have call predecessors, (559), 399 states have return successors, (953), 606 states have call predecessors, (953), 531 states have call successors, (953) [2025-03-04 15:36:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3379 transitions. [2025-03-04 15:36:20,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2726 states and 3379 transitions. [2025-03-04 15:36:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 15:36:20,764 INFO L432 stractBuchiCegarLoop]: Abstraction has 2726 states and 3379 transitions. [2025-03-04 15:36:20,764 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-04 15:36:20,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2726 states and 3379 transitions. [2025-03-04 15:36:20,770 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 97 [2025-03-04 15:36:20,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:20,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:20,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 19, 16, 9, 9, 9, 8, 8, 8, 7, 7, 6, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:20,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:36:20,771 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;" "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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-03-04 15:36:20,771 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-03-04 15:36:20,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:20,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1949865203, now seen corresponding path program 13 times [2025-03-04 15:36:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:20,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222019731] [2025-03-04 15:36:20,771 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:20,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 15:36:20,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 15:36:20,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:20,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 386 proven. 117 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2025-03-04 15:36:20,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:20,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222019731] [2025-03-04 15:36:20,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222019731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:20,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271701744] [2025-03-04 15:36:20,890 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:20,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:20,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:20,892 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:20,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2025-03-04 15:36:20,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 15:36:20,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 15:36:20,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:20,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:20,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:36:20,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 392 proven. 104 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2025-03-04 15:36:21,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 392 proven. 110 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2025-03-04 15:36:21,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271701744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:21,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:21,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 13] total 20 [2025-03-04 15:36:21,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407707966] [2025-03-04 15:36:21,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:21,338 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:21,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash 63137026, now seen corresponding path program 3 times [2025-03-04 15:36:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:21,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114684561] [2025-03-04 15:36:21,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:21,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:21,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:21,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:36:21,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:21,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:21,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:21,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:21,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:21,402 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:21,402 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:21,402 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:21,402 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:21,402 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:21,402 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,402 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:21,402 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:21,402 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration28_Loop [2025-03-04 15:36:21,402 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:21,402 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:21,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,445 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:21,445 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:21,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,447 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-04 15:36:21,448 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-04 15:36:21,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:21,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:21,459 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:21,459 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-04 15:36:21,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-03-04 15:36:21,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,467 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-04 15:36:21,467 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-04 15:36:21,468 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:21,468 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:21,492 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-04 15:36:21,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,494 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-04 15:36:21,495 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-04 15:36:21,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:21,496 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:21,803 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:21,811 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-04 15:36:21,812 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:21,812 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:21,812 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:21,812 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:21,812 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:21,812 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,812 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:21,812 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:21,812 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration28_Loop [2025-03-04 15:36:21,812 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:21,812 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:21,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:21,849 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:21,850 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:21,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,852 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-04 15:36:21,852 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-04 15:36:21,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-04 15:36:21,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:21,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:21,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:21,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:21,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:21,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:21,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:21,866 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:21,869 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 15:36:21,869 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-04 15:36:21,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:21,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,872 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:21,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-03-04 15:36:21,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:21,873 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:21,873 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:21,873 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-03-04 15:36:21,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-03-04 15:36:21,879 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:21,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:21,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 15:36:21,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 15:36:21,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:21,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:21,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 15:36:21,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:22,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:22,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:22,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:22,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:22,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:36:22,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:22,535 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-04 15:36:22,535 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-04 15:36:22,536 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2726 states and 3379 transitions. cyclomatic complexity: 671 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:22,581 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2726 states and 3379 transitions. cyclomatic complexity: 671. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2731 states and 3384 transitions. Complement of second has 10 states. [2025-03-04 15:36:22,582 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-04 15:36:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2025-03-04 15:36:22,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 161 letters. Loop has 5 letters. [2025-03-04 15:36:22,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:22,583 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:22,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:22,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 15:36:22,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 15:36:22,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:22,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:22,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 15:36:22,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:23,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:23,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-03-04 15:36:23,260 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-04 15:36:23,260 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-04 15:36:23,260 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2726 states and 3379 transitions. cyclomatic complexity: 671 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:23,298 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2726 states and 3379 transitions. cyclomatic complexity: 671. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2731 states and 3384 transitions. Complement of second has 10 states. [2025-03-04 15:36:23,298 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-04 15:36:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2025-03-04 15:36:23,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 161 letters. Loop has 5 letters. [2025-03-04 15:36:23,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,298 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:23,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:23,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 15:36:23,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 15:36:23,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:23,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:23,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:23,908 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-04 15:36:23,909 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-04 15:36:23,909 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2726 states and 3379 transitions. cyclomatic complexity: 671 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:23,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2726 states and 3379 transitions. cyclomatic complexity: 671. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 3517 states and 4373 transitions. Complement of second has 40 states. [2025-03-04 15:36:23,985 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-04 15:36:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2025-03-04 15:36:23,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 161 letters. Loop has 5 letters. [2025-03-04 15:36:23,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 166 letters. Loop has 5 letters. [2025-03-04 15:36:23,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 161 letters. Loop has 10 letters. [2025-03-04 15:36:23,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:23,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3517 states and 4373 transitions. [2025-03-04 15:36:23,996 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2025-03-04 15:36:24,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3517 states to 2819 states and 3553 transitions. [2025-03-04 15:36:24,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 448 [2025-03-04 15:36:24,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 467 [2025-03-04 15:36:24,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2819 states and 3553 transitions. [2025-03-04 15:36:24,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:24,006 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2819 states and 3553 transitions. [2025-03-04 15:36:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states and 3553 transitions. [2025-03-04 15:36:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2782. [2025-03-04 15:36:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 1808 states have (on average 1.0547566371681416) internal successors, (1907), 1870 states have internal predecessors, (1907), 573 states have call successors, (589), 301 states have call predecessors, (589), 401 states have return successors, (933), 610 states have call predecessors, (933), 555 states have call successors, (933) [2025-03-04 15:36:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 3429 transitions. [2025-03-04 15:36:24,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2782 states and 3429 transitions. [2025-03-04 15:36:24,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:24,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:36:24,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:36:24,031 INFO L87 Difference]: Start difference. First operand 2782 states and 3429 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 16 states have call successors, (20), 2 states have call predecessors, (20), 5 states have return successors, (20), 10 states have call predecessors, (20), 15 states have call successors, (20) [2025-03-04 15:36:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:24,277 INFO L93 Difference]: Finished difference Result 3052 states and 3797 transitions. [2025-03-04 15:36:24,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3052 states and 3797 transitions. [2025-03-04 15:36:24,286 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2025-03-04 15:36:24,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3052 states to 2923 states and 3654 transitions. [2025-03-04 15:36:24,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 464 [2025-03-04 15:36:24,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 464 [2025-03-04 15:36:24,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2923 states and 3654 transitions. [2025-03-04 15:36:24,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:24,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2923 states and 3654 transitions. [2025-03-04 15:36:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states and 3654 transitions. [2025-03-04 15:36:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2675. [2025-03-04 15:36:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 1728 states have (on average 1.0549768518518519) internal successors, (1823), 1788 states have internal predecessors, (1823), 553 states have call successors, (567), 285 states have call predecessors, (567), 394 states have return successors, (942), 601 states have call predecessors, (942), 535 states have call successors, (942) [2025-03-04 15:36:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3332 transitions. [2025-03-04 15:36:24,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2675 states and 3332 transitions. [2025-03-04 15:36:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:36:24,325 INFO L432 stractBuchiCegarLoop]: Abstraction has 2675 states and 3332 transitions. [2025-03-04 15:36:24,325 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-04 15:36:24,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2675 states and 3332 transitions. [2025-03-04 15:36:24,330 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2025-03-04 15:36:24,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:24,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:24,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 17, 14, 9, 9, 8, 8, 8, 7, 6, 6, 6, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:24,331 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:36:24,331 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;" "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);" "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-04 15:36:24,331 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-03-04 15:36:24,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:24,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1241278289, now seen corresponding path program 14 times [2025-03-04 15:36:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:24,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997031376] [2025-03-04 15:36:24,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:24,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-04 15:36:24,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 15:36:24,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:24,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 174 proven. 93 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2025-03-04 15:36:24,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:24,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997031376] [2025-03-04 15:36:24,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997031376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:24,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954002259] [2025-03-04 15:36:24,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:24,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:24,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:24,435 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-04 15:36:24,436 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-04 15:36:24,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-04 15:36:24,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 15:36:24,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:24,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:24,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:36:24,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 174 proven. 93 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2025-03-04 15:36:24,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 174 proven. 93 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2025-03-04 15:36:24,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954002259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:24,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:24,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-03-04 15:36:24,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125908066] [2025-03-04 15:36:24,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:24,734 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:24,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:24,734 INFO L85 PathProgramCache]: Analyzing trace with hash 63137026, now seen corresponding path program 4 times [2025-03-04 15:36:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:24,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020841621] [2025-03-04 15:36:24,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:24,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:24,736 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-04 15:36:24,737 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:24,737 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:24,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:24,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:24,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:24,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:24,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:24,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:24,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:24,792 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:24,792 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:24,792 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:24,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:24,793 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:24,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:24,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:24,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:24,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration29_Loop [2025-03-04 15:36:24,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:24,793 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:24,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:24,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:24,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:24,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:24,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:24,832 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:24,832 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:24,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:24,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:24,834 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:24,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-03-04 15:36:24,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:24,836 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:24,846 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:24,846 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-04 15:36:24,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-03-04 15:36:24,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:24,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:24,853 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:24,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-03-04 15:36:24,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:24,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:24,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-03-04 15:36:24,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:24,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:24,881 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-04 15:36:24,882 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-04 15:36:24,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:24,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:25,195 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:25,205 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-04 15:36:25,205 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:25,205 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:25,205 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:25,205 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:25,205 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:25,205 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:25,205 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:25,205 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:25,205 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration29_Loop [2025-03-04 15:36:25,205 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:25,205 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:25,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:25,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:25,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:25,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:25,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:25,243 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:25,243 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:25,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:25,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:25,245 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-04 15:36:25,246 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-04 15:36:25,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:25,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:25,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:25,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:25,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:25,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:25,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:25,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:25,257 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:25,262 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-04 15:36:25,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:25,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:25,264 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-04 15:36:25,265 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-04 15:36:25,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:25,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:25,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:25,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:25,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:25,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:25,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:25,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:25,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:25,282 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-04 15:36:25,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:25,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:25,284 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-04 15:36:25,285 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-04 15:36:25,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:25,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:25,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:25,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:25,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:25,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:25,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:25,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:25,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:25,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:25,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:25,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:25,305 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-04 15:36:25,305 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-04 15:36:25,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:25,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:25,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:25,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:25,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:25,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:25,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:25,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:25,319 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:25,323 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 15:36:25,323 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-04 15:36:25,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:25,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:25,325 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-04 15:36:25,326 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-04 15:36:25,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:25,326 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:25,326 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:25,326 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-03-04 15:36:25,332 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-04 15:36:25,332 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:25,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:25,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 15:36:25,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 15:36:25,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:25,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:25,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 15:36:25,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:25,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:25,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:25,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:25,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:25,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:36:25,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:25,911 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-04 15:36:25,911 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-04 15:36:25,911 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2675 states and 3332 transitions. cyclomatic complexity: 674 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:25,947 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2675 states and 3332 transitions. cyclomatic complexity: 674. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2680 states and 3337 transitions. Complement of second has 10 states. [2025-03-04 15:36:25,947 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-04 15:36:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2025-03-04 15:36:25,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 147 letters. Loop has 5 letters. [2025-03-04 15:36:25,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:25,948 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:25,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:25,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 15:36:26,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 15:36:26,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:26,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:26,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 15:36:26,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:26,280 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-04 15:36:26,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:26,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:26,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:26,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:26,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:36:26,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:26,553 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-04 15:36:26,554 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-04 15:36:26,554 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2675 states and 3332 transitions. cyclomatic complexity: 674 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:26,590 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2675 states and 3332 transitions. cyclomatic complexity: 674. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2680 states and 3337 transitions. Complement of second has 10 states. [2025-03-04 15:36:26,590 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-04 15:36:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2025-03-04 15:36:26,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 147 letters. Loop has 5 letters. [2025-03-04 15:36:26,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:26,591 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:26,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 15:36:26,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 15:36:26,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:26,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:26,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 15:36:26,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:27,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:27,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:27,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:27,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:27,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:36:27,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:27,126 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-04 15:36:27,126 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-04 15:36:27,127 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2675 states and 3332 transitions. cyclomatic complexity: 674 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:27,189 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2675 states and 3332 transitions. cyclomatic complexity: 674. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 3473 states and 4341 transitions. Complement of second has 40 states. [2025-03-04 15:36:27,191 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-04 15:36:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:36:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2025-03-04 15:36:27,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 147 letters. Loop has 5 letters. [2025-03-04 15:36:27,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:27,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 152 letters. Loop has 5 letters. [2025-03-04 15:36:27,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:27,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 147 letters. Loop has 10 letters. [2025-03-04 15:36:27,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:27,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3473 states and 4341 transitions. [2025-03-04 15:36:27,204 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 109 [2025-03-04 15:36:27,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3473 states to 2698 states and 3422 transitions. [2025-03-04 15:36:27,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 400 [2025-03-04 15:36:27,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 415 [2025-03-04 15:36:27,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2698 states and 3422 transitions. [2025-03-04 15:36:27,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:27,216 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2698 states and 3422 transitions. [2025-03-04 15:36:27,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states and 3422 transitions. [2025-03-04 15:36:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2675. [2025-03-04 15:36:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 1728 states have (on average 1.0549768518518519) internal successors, (1823), 1788 states have internal predecessors, (1823), 553 states have call successors, (567), 285 states have call predecessors, (567), 394 states have return successors, (942), 601 states have call predecessors, (942), 535 states have call successors, (942) [2025-03-04 15:36:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3332 transitions. [2025-03-04 15:36:27,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2675 states and 3332 transitions. [2025-03-04 15:36:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:27,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:36:27,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:36:27,245 INFO L87 Difference]: Start difference. First operand 2675 states and 3332 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 14 states have internal predecessors, (48), 12 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-04 15:36:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:27,454 INFO L93 Difference]: Finished difference Result 2698 states and 3353 transitions. [2025-03-04 15:36:27,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2698 states and 3353 transitions. [2025-03-04 15:36:27,462 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2025-03-04 15:36:27,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2698 states to 2695 states and 3350 transitions. [2025-03-04 15:36:27,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 415 [2025-03-04 15:36:27,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 415 [2025-03-04 15:36:27,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2695 states and 3350 transitions. [2025-03-04 15:36:27,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:27,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2695 states and 3350 transitions. [2025-03-04 15:36:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states and 3350 transitions. [2025-03-04 15:36:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2687. [2025-03-04 15:36:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 1737 states have (on average 1.0546919976971791) internal successors, (1832), 1797 states have internal predecessors, (1832), 553 states have call successors, (566), 288 states have call predecessors, (566), 397 states have return successors, (942), 601 states have call predecessors, (942), 535 states have call successors, (942) [2025-03-04 15:36:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3340 transitions. [2025-03-04 15:36:27,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2687 states and 3340 transitions. [2025-03-04 15:36:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:36:27,496 INFO L432 stractBuchiCegarLoop]: Abstraction has 2687 states and 3340 transitions. [2025-03-04 15:36:27,496 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-03-04 15:36:27,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2687 states and 3340 transitions. [2025-03-04 15:36:27,499 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2025-03-04 15:36:27,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:27,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:27,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [25, 19, 16, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:27,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:27,500 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;" "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~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;" [2025-03-04 15:36:27,500 INFO L754 eck$LassoCheckResult]: Loop: "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;" [2025-03-04 15:36:27,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash 964570092, now seen corresponding path program 15 times [2025-03-04 15:36:27,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:27,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91542389] [2025-03-04 15:36:27,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:27,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:27,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 169 statements into 9 equivalence classes. [2025-03-04 15:36:27,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 153 of 169 statements. [2025-03-04 15:36:27,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 15:36:27,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 383 proven. 38 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2025-03-04 15:36:27,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:27,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91542389] [2025-03-04 15:36:27,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91542389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:27,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230070398] [2025-03-04 15:36:27,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:27,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:27,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:27,598 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-04 15:36:27,598 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-04 15:36:27,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 169 statements into 9 equivalence classes. [2025-03-04 15:36:27,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 153 of 169 statements. [2025-03-04 15:36:27,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 15:36:27,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:27,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:36:27,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 422 proven. 201 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2025-03-04 15:36:27,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 429 proven. 196 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 15:36:28,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230070398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:28,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:28,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 17] total 35 [2025-03-04 15:36:28,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465854667] [2025-03-04 15:36:28,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:28,299 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:28,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash -495350901, now seen corresponding path program 1 times [2025-03-04 15:36:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366993612] [2025-03-04 15:36:28,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:28,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:36:28,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:36:28,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:28,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:28,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:28,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:36:28,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:36:28,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:28,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:28,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:28,533 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:28,533 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:28,533 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:28,533 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:28,533 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:28,533 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:28,533 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:28,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:28,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration30_Loop [2025-03-04 15:36:28,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:28,533 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:28,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:28,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:28,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:28,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:28,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:28,577 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:28,577 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:28,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:28,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:28,579 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-04 15:36:28,583 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-04 15:36:28,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:28,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:28,593 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:28,593 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-04 15:36:28,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:28,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:28,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:28,601 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-04 15:36:28,601 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-04 15:36:28,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:28,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:28,612 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:28,612 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-04 15:36:28,617 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-04 15:36:28,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:28,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:28,619 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-04 15:36:28,620 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-04 15:36:28,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:28,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:28,645 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-04 15:36:28,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:28,647 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-04 15:36:28,648 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-04 15:36:28,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:28,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:28,942 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:28,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-03-04 15:36:28,950 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:28,950 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:28,950 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:28,950 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:28,950 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:28,951 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:28,951 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:28,951 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:28,951 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration30_Loop [2025-03-04 15:36:28,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:28,951 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:28,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:28,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:28,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:28,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:28,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:28,988 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:28,988 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:28,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:28,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:28,991 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-04 15:36:28,991 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-04 15:36:28,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:29,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:29,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:29,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:29,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:29,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:29,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:29,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:29,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:29,008 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-04 15:36:29,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:29,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:29,010 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-04 15:36:29,011 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-04 15:36:29,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:29,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:29,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:29,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:29,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:29,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:29,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:29,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:29,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:29,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:29,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:29,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:29,032 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-04 15:36:29,033 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-04 15:36:29,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:29,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:29,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:29,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:29,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:29,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:29,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:29,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:29,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:29,050 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:29,050 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:29,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:29,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:29,052 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-04 15:36:29,053 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-04 15:36:29,054 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:29,054 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:29,054 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:29,054 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-03-04 15:36:29,059 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-04 15:36:29,060 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:29,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:29,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 15:36:29,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 15:36:29,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:29,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:29,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 15:36:29,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:29,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-03-04 15:36:29,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:36:29,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:36:29,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:29,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:29,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:36:29,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:29,738 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2025-03-04 15:36:29,738 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2687 states and 3340 transitions. cyclomatic complexity: 670 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 15:36:29,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2687 states and 3340 transitions. cyclomatic complexity: 670. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Result 2687 states and 3340 transitions. Complement of second has 4 states. [2025-03-04 15:36:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 15:36:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:36:29,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 169 letters. Loop has 20 letters. [2025-03-04 15:36:29,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:29,761 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:29,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:29,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 15:36:29,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 15:36:29,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:29,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:29,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 15:36:29,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:30,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:36:30,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:36:30,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:30,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:30,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:36:30,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:30,426 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2025-03-04 15:36:30,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2687 states and 3340 transitions. cyclomatic complexity: 670 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 15:36:30,456 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2687 states and 3340 transitions. cyclomatic complexity: 670. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Result 2687 states and 3340 transitions. Complement of second has 4 states. [2025-03-04 15:36:30,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 15:36:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:36:30,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 169 letters. Loop has 20 letters. [2025-03-04 15:36:30,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:30,457 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:30,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:30,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 15:36:30,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 15:36:30,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:30,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:30,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 15:36:30,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:31,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:36:31,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:36:31,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:31,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:31,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:36:31,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:31,222 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 8 loop predicates [2025-03-04 15:36:31,222 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2687 states and 3340 transitions. cyclomatic complexity: 670 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 15:36:31,525 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2687 states and 3340 transitions. cyclomatic complexity: 670. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Result 8202 states and 9106 transitions. Complement of second has 296 states. [2025-03-04 15:36:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 15:36:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2025-03-04 15:36:31,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 76 transitions. Stem has 169 letters. Loop has 20 letters. [2025-03-04 15:36:31,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:31,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 76 transitions. Stem has 189 letters. Loop has 20 letters. [2025-03-04 15:36:31,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:31,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 76 transitions. Stem has 169 letters. Loop has 40 letters. [2025-03-04 15:36:31,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:31,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8202 states and 9106 transitions. [2025-03-04 15:36:31,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-04 15:36:31,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8202 states to 1817 states and 1976 transitions. [2025-03-04 15:36:31,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2025-03-04 15:36:31,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2025-03-04 15:36:31,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1817 states and 1976 transitions. [2025-03-04 15:36:31,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:31,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1817 states and 1976 transitions. [2025-03-04 15:36:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states and 1976 transitions. [2025-03-04 15:36:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1523. [2025-03-04 15:36:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1056 states have (on average 1.0388257575757576) internal successors, (1097), 1075 states have internal predecessors, (1097), 259 states have call successors, (267), 196 states have call predecessors, (267), 208 states have return successors, (281), 251 states have call predecessors, (281), 259 states have call successors, (281) [2025-03-04 15:36:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1645 transitions. [2025-03-04 15:36:31,566 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1523 states and 1645 transitions. [2025-03-04 15:36:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:31,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 15:36:31,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 15:36:31,567 INFO L87 Difference]: Start difference. First operand 1523 states and 1645 transitions. Second operand has 35 states, 34 states have (on average 3.0) internal successors, (102), 28 states have internal predecessors, (102), 18 states have call successors, (36), 11 states have call predecessors, (36), 5 states have return successors, (22), 18 states have call predecessors, (22), 15 states have call successors, (22) [2025-03-04 15:36:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:32,896 INFO L93 Difference]: Finished difference Result 2652 states and 2923 transitions. [2025-03-04 15:36:32,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2652 states and 2923 transitions. [2025-03-04 15:36:32,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-03-04 15:36:32,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2652 states to 2466 states and 2718 transitions. [2025-03-04 15:36:32,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2025-03-04 15:36:32,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2025-03-04 15:36:32,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2466 states and 2718 transitions. [2025-03-04 15:36:32,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:32,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2466 states and 2718 transitions. [2025-03-04 15:36:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states and 2718 transitions. [2025-03-04 15:36:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2127. [2025-03-04 15:36:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1473 states have (on average 1.031907671418873) internal successors, (1520), 1501 states have internal predecessors, (1520), 344 states have call successors, (356), 273 states have call predecessors, (356), 310 states have return successors, (426), 352 states have call predecessors, (426), 344 states have call successors, (426) [2025-03-04 15:36:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2302 transitions. [2025-03-04 15:36:32,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2127 states and 2302 transitions. [2025-03-04 15:36:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-03-04 15:36:32,922 INFO L432 stractBuchiCegarLoop]: Abstraction has 2127 states and 2302 transitions. [2025-03-04 15:36:32,922 INFO L338 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-03-04 15:36:32,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2127 states and 2302 transitions. [2025-03-04 15:36:32,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-04 15:36:32,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:32,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:32,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 15:36:32,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [23, 23, 18, 10, 9, 9, 9, 9, 9, 9, 8, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:32,926 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;" [2025-03-04 15:36:32,926 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~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-04 15:36:32,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2066472244, now seen corresponding path program 16 times [2025-03-04 15:36:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:32,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508267767] [2025-03-04 15:36:32,927 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:32,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:32,931 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 270 statements into 2 equivalence classes. [2025-03-04 15:36:32,942 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 15:36:32,942 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:32,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:32,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:32,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 15:36:32,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 15:36:32,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:32,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:32,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:32,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash -355453792, now seen corresponding path program 5 times [2025-03-04 15:36:32,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:32,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949470331] [2025-03-04 15:36:32,960 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:32,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:32,963 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 163 statements into 8 equivalence classes. [2025-03-04 15:36:32,970 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 155 of 163 statements. [2025-03-04 15:36:32,970 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 15:36:32,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 158 proven. 480 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2025-03-04 15:36:33,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949470331] [2025-03-04 15:36:33,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949470331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390558591] [2025-03-04 15:36:33,217 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:33,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:33,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:33,219 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-04 15:36:33,220 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-04 15:36:33,280 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 163 statements into 8 equivalence classes. [2025-03-04 15:36:33,304 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 155 of 163 statements. [2025-03-04 15:36:33,304 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 15:36:33,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:33,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 15:36:33,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 767 proven. 205 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-04 15:36:33,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 135 proven. 511 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2025-03-04 15:36:34,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390558591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:34,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:34,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 20] total 37 [2025-03-04 15:36:34,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460319611] [2025-03-04 15:36:34,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:34,108 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:34,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:34,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 15:36:34,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 15:36:34,109 INFO L87 Difference]: Start difference. First operand 2127 states and 2302 transitions. cyclomatic complexity: 189 Second operand has 37 states, 31 states have (on average 3.6129032258064515) internal successors, (112), 32 states have internal predecessors, (112), 28 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (42), 19 states have call predecessors, (42), 28 states have call successors, (42) [2025-03-04 15:36:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:35,429 INFO L93 Difference]: Finished difference Result 2634 states and 2854 transitions. [2025-03-04 15:36:35,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2634 states and 2854 transitions. [2025-03-04 15:36:35,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-04 15:36:35,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2634 states to 1548 states and 1667 transitions. [2025-03-04 15:36:35,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2025-03-04 15:36:35,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2025-03-04 15:36:35,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1548 states and 1667 transitions. [2025-03-04 15:36:35,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:35,438 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1548 states and 1667 transitions. [2025-03-04 15:36:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states and 1667 transitions. [2025-03-04 15:36:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1191. [2025-03-04 15:36:35,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 829 states have (on average 1.0253317249698433) internal successors, (850), 844 states have internal predecessors, (850), 188 states have call successors, (194), 156 states have call predecessors, (194), 174 states have return successors, (226), 190 states have call predecessors, (226), 188 states have call successors, (226) [2025-03-04 15:36:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1270 transitions. [2025-03-04 15:36:35,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1191 states and 1270 transitions. [2025-03-04 15:36:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 15:36:35,448 INFO L432 stractBuchiCegarLoop]: Abstraction has 1191 states and 1270 transitions. [2025-03-04 15:36:35,448 INFO L338 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2025-03-04 15:36:35,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1270 transitions. [2025-03-04 15:36:35,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-04 15:36:35,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:35,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:35,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 15:36:35,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [29, 29, 24, 14, 11, 11, 11, 11, 11, 11, 10, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1] [2025-03-04 15:36:35,451 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;" [2025-03-04 15:36:35,451 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);" "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~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;#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-04 15:36:35,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2066472244, now seen corresponding path program 17 times [2025-03-04 15:36:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:35,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379921832] [2025-03-04 15:36:35,451 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:35,456 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 270 statements into 12 equivalence classes. [2025-03-04 15:36:35,473 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 15:36:35,473 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-04 15:36:35,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:35,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:35,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 15:36:35,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 15:36:35,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:35,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:35,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:35,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash -290645856, now seen corresponding path program 6 times [2025-03-04 15:36:35,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:35,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519745266] [2025-03-04 15:36:35,524 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:35,528 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 207 statements into 11 equivalence classes. [2025-03-04 15:36:35,540 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 184 of 207 statements. [2025-03-04 15:36:35,541 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-04 15:36:35,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 253 proven. 270 refuted. 0 times theorem prover too weak. 1661 trivial. 0 not checked. [2025-03-04 15:36:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519745266] [2025-03-04 15:36:35,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519745266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:35,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260838985] [2025-03-04 15:36:35,712 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:35,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:35,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:35,714 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:35,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2025-03-04 15:36:35,790 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 207 statements into 11 equivalence classes. [2025-03-04 15:36:35,820 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 184 of 207 statements. [2025-03-04 15:36:35,820 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-04 15:36:35,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:35,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 15:36:35,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 247 proven. 273 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2025-03-04 15:36:35,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 249 proven. 271 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2025-03-04 15:36:36,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260838985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:36,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:36,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 18 [2025-03-04 15:36:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583745100] [2025-03-04 15:36:36,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:36,243 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:36,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:36,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:36:36,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:36:36,243 INFO L87 Difference]: Start difference. First operand 1191 states and 1270 transitions. cyclomatic complexity: 88 Second operand has 19 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 13 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-04 15:36:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:36,462 INFO L93 Difference]: Finished difference Result 1219 states and 1305 transitions. [2025-03-04 15:36:36,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1219 states and 1305 transitions. [2025-03-04 15:36:36,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2025-03-04 15:36:36,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1219 states to 1219 states and 1304 transitions. [2025-03-04 15:36:36,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2025-03-04 15:36:36,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 225 [2025-03-04 15:36:36,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1219 states and 1304 transitions. [2025-03-04 15:36:36,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:36,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1219 states and 1304 transitions. [2025-03-04 15:36:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states and 1304 transitions. [2025-03-04 15:36:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1196. [2025-03-04 15:36:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 832 states have (on average 1.0252403846153846) internal successors, (853), 848 states have internal predecessors, (853), 189 states have call successors, (195), 156 states have call predecessors, (195), 175 states have return successors, (229), 191 states have call predecessors, (229), 189 states have call successors, (229) [2025-03-04 15:36:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1277 transitions. [2025-03-04 15:36:36,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1196 states and 1277 transitions. [2025-03-04 15:36:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:36:36,475 INFO L432 stractBuchiCegarLoop]: Abstraction has 1196 states and 1277 transitions. [2025-03-04 15:36:36,475 INFO L338 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2025-03-04 15:36:36,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1196 states and 1277 transitions. [2025-03-04 15:36:36,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-04 15:36:36,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:36,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:36,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 15:36:36,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [37, 37, 30, 18, 14, 14, 14, 14, 14, 14, 12, 7, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1] [2025-03-04 15:36:36,478 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;" [2025-03-04 15:36:36,478 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);" "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;#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~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;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-03-04 15:36:36,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:36,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2066472244, now seen corresponding path program 18 times [2025-03-04 15:36:36,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:36,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998309776] [2025-03-04 15:36:36,479 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:36,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:36,484 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 270 statements into 12 equivalence classes. [2025-03-04 15:36:36,503 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 15:36:36,504 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-04 15:36:36,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:36,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:36,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 15:36:36,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 15:36:36,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:36,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:36,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:36,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2111222491, now seen corresponding path program 7 times [2025-03-04 15:36:36,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:36,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669516618] [2025-03-04 15:36:36,521 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:36,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:36,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-04 15:36:36,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-04 15:36:36,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:36,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3572 backedges. 374 proven. 159 refuted. 0 times theorem prover too weak. 3039 trivial. 0 not checked. [2025-03-04 15:36:36,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:36,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669516618] [2025-03-04 15:36:36,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669516618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:36,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717045843] [2025-03-04 15:36:36,630 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:36,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:36,634 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:36,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2025-03-04 15:36:36,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-04 15:36:36,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-04 15:36:36,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:36,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:36,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:36:36,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3572 backedges. 1715 proven. 29 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2025-03-04 15:36:36,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3572 backedges. 374 proven. 168 refuted. 0 times theorem prover too weak. 3030 trivial. 0 not checked. [2025-03-04 15:36:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717045843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:37,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:37,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 13 [2025-03-04 15:36:37,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908908163] [2025-03-04 15:36:37,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:37,114 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:37,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:36:37,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:36:37,114 INFO L87 Difference]: Start difference. First operand 1196 states and 1277 transitions. cyclomatic complexity: 90 Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (19), 10 states have call predecessors, (19), 9 states have call successors, (19) [2025-03-04 15:36:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:37,234 INFO L93 Difference]: Finished difference Result 1228 states and 1312 transitions. [2025-03-04 15:36:37,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1312 transitions. [2025-03-04 15:36:37,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-04 15:36:37,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 988 states and 1033 transitions. [2025-03-04 15:36:37,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2025-03-04 15:36:37,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2025-03-04 15:36:37,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 988 states and 1033 transitions. [2025-03-04 15:36:37,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:37,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 988 states and 1033 transitions. [2025-03-04 15:36:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states and 1033 transitions. [2025-03-04 15:36:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 948. [2025-03-04 15:36:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 667 states have (on average 1.0164917541229386) internal successors, (678), 675 states have internal predecessors, (678), 145 states have call successors, (150), 129 states have call predecessors, (150), 136 states have return successors, (160), 143 states have call predecessors, (160), 145 states have call successors, (160) [2025-03-04 15:36:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 988 transitions. [2025-03-04 15:36:37,245 INFO L240 hiAutomatonCegarLoop]: Abstraction has 948 states and 988 transitions. [2025-03-04 15:36:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:36:37,246 INFO L432 stractBuchiCegarLoop]: Abstraction has 948 states and 988 transitions. [2025-03-04 15:36:37,246 INFO L338 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2025-03-04 15:36:37,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 948 states and 988 transitions. [2025-03-04 15:36:37,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-04 15:36:37,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:37,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:37,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 15:36:37,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [49, 49, 40, 24, 20, 20, 20, 20, 20, 20, 16, 9, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1] [2025-03-04 15:36:37,249 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;" [2025-03-04 15:36:37,249 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);" "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;" "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;" [2025-03-04 15:36:37,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2066472244, now seen corresponding path program 19 times [2025-03-04 15:36:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:37,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626740156] [2025-03-04 15:36:37,250 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:37,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 15:36:37,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 15:36:37,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:37,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:37,265 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:37,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 15:36:37,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 15:36:37,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:37,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:37,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:37,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1464293925, now seen corresponding path program 8 times [2025-03-04 15:36:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:37,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169919280] [2025-03-04 15:36:37,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:37,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 345 statements into 2 equivalence classes. [2025-03-04 15:36:37,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 345 of 345 statements. [2025-03-04 15:36:37,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:37,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:37,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:37,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-04 15:36:37,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-04 15:36:37,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:37,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:37,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:37,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:37,334 INFO L85 PathProgramCache]: Analyzing trace with hash 720597000, now seen corresponding path program 20 times [2025-03-04 15:36:37,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:37,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525141783] [2025-03-04 15:36:37,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:37,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 615 statements into 2 equivalence classes. [2025-03-04 15:36:37,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 615 of 615 statements. [2025-03-04 15:36:37,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:37,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19292 backedges. 41 proven. 307 refuted. 0 times theorem prover too weak. 18944 trivial. 0 not checked. [2025-03-04 15:36:37,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:37,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525141783] [2025-03-04 15:36:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525141783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:37,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658612777] [2025-03-04 15:36:37,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:37,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:37,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:37,714 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:37,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2025-03-04 15:36:37,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 615 statements into 2 equivalence classes. [2025-03-04 15:36:37,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 615 of 615 statements. [2025-03-04 15:36:37,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:37,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:37,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 1540 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:36:37,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 19292 backedges. 5761 proven. 193 refuted. 0 times theorem prover too weak. 13338 trivial. 0 not checked. [2025-03-04 15:36:38,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 19292 backedges. 41 proven. 307 refuted. 0 times theorem prover too weak. 18944 trivial. 0 not checked. [2025-03-04 15:36:38,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658612777] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:38,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:38,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-04 15:36:38,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015624054] [2025-03-04 15:36:38,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:41,010 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:41,010 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:41,010 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:41,010 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:41,010 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:41,010 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:41,010 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:41,010 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:41,010 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration34_Loop [2025-03-04 15:36:41,010 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:41,010 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:41,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:41,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:41,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:41,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:41,037 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:41,037 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:41,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:41,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:41,039 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-04 15:36:41,040 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-04 15:36:41,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:41,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:41,058 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:41,058 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=4, ULTIMATE.start_main_~q~0#1=4} Honda state: {ULTIMATE.start_main_~x~0#1=4, ULTIMATE.start_main_~q~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:41,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-03-04 15:36:41,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:41,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:41,065 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:41,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-03-04 15:36:41,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:41,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:41,077 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:41,077 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-04 15:36:41,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-03-04 15:36:41,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:41,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:41,084 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:41,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-03-04 15:36:41,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:41,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:41,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2025-03-04 15:36:41,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:41,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:41,111 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:41,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-03-04 15:36:41,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:41,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:41,123 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:41,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-03-04 15:36:41,128 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:41,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:41,129 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:41,129 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:41,129 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:41,129 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:41,129 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:41,129 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:41,129 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration34_Loop [2025-03-04 15:36:41,129 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:41,129 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:41,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:41,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:41,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:41,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:41,156 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:41,157 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:41,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:41,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:41,158 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:41,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-03-04 15:36:41,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:41,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:41,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:41,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:41,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:41,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:41,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:41,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:41,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:41,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-03-04 15:36:41,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:41,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:41,179 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:41,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-03-04 15:36:41,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:41,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:41,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:41,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:41,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:41,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:41,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:41,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:41,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:41,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-03-04 15:36:41,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:41,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:41,200 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:41,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-03-04 15:36:41,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:36:41,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:41,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:41,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:41,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:41,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:41,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:41,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:41,214 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:41,215 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:41,215 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:41,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:41,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:41,217 INFO L229 MonitoredProcess]: Starting monitored process 157 with /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-04 15:36:41,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-03-04 15:36:41,218 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:41,218 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:41,218 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:41,218 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 5 Supporting invariants [] [2025-03-04 15:36:41,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-03-04 15:36:41,224 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:41,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:41,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-04 15:36:41,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-04 15:36:41,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:41,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:41,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-04 15:36:41,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:42,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-04 15:36:42,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-04 15:36:42,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:42,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:42,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 2238 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-03-04 15:36:42,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6377 backedges. 36 proven. 878 refuted. 0 times theorem prover too weak. 5463 trivial. 0 not checked. [2025-03-04 15:36:43,024 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2025-03-04 15:36:43,024 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 948 states and 988 transitions. cyclomatic complexity: 47 Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-04 15:36:43,366 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 948 states and 988 transitions. cyclomatic complexity: 47. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Result 2203 states and 2312 transitions. Complement of second has 117 states. [2025-03-04 15:36:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 2 stem states 16 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-04 15:36:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2025-03-04 15:36:43,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 98 transitions. Stem has 270 letters. Loop has 345 letters. [2025-03-04 15:36:43,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:43,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 98 transitions. Stem has 615 letters. Loop has 345 letters. [2025-03-04 15:36:43,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:43,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 98 transitions. Stem has 270 letters. Loop has 690 letters. [2025-03-04 15:36:43,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:43,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2203 states and 2312 transitions. [2025-03-04 15:36:43,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-04 15:36:43,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2203 states to 1882 states and 1981 transitions. [2025-03-04 15:36:43,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2025-03-04 15:36:43,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2025-03-04 15:36:43,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1882 states and 1981 transitions. [2025-03-04 15:36:43,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:43,381 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1882 states and 1981 transitions. [2025-03-04 15:36:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states and 1981 transitions. [2025-03-04 15:36:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1580. [2025-03-04 15:36:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1113 states have (on average 1.0188679245283019) internal successors, (1134), 1125 states have internal predecessors, (1134), 239 states have call successors, (246), 217 states have call predecessors, (246), 228 states have return successors, (257), 237 states have call predecessors, (257), 239 states have call successors, (257) [2025-03-04 15:36:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 1637 transitions. [2025-03-04 15:36:43,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1580 states and 1637 transitions. [2025-03-04 15:36:43,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:43,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:36:43,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:36:43,392 INFO L87 Difference]: Start difference. First operand 1580 states and 1637 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 15 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 15 states have call predecessors, (21), 15 states have call successors, (21) [2025-03-04 15:36:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:43,462 INFO L93 Difference]: Finished difference Result 1712 states and 1833 transitions. [2025-03-04 15:36:43,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1712 states and 1833 transitions. [2025-03-04 15:36:43,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-04 15:36:43,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1712 states to 1627 states and 1712 transitions. [2025-03-04 15:36:43,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 224 [2025-03-04 15:36:43,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2025-03-04 15:36:43,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1627 states and 1712 transitions. [2025-03-04 15:36:43,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:43,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1627 states and 1712 transitions. [2025-03-04 15:36:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states and 1712 transitions. [2025-03-04 15:36:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1595. [2025-03-04 15:36:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1123 states have (on average 1.018699910952805) internal successors, (1144), 1135 states have internal predecessors, (1144), 244 states have call successors, (251), 217 states have call predecessors, (251), 228 states have return successors, (262), 242 states have call predecessors, (262), 244 states have call successors, (262) [2025-03-04 15:36:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 1657 transitions. [2025-03-04 15:36:43,477 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1595 states and 1657 transitions. [2025-03-04 15:36:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:36:43,478 INFO L432 stractBuchiCegarLoop]: Abstraction has 1595 states and 1657 transitions. [2025-03-04 15:36:43,478 INFO L338 stractBuchiCegarLoop]: ======== Iteration 35 ============ [2025-03-04 15:36:43,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1595 states and 1657 transitions. [2025-03-04 15:36:43,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-03-04 15:36:43,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:43,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:43,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 34, 20, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1] [2025-03-04 15:36:43,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [51, 51, 42, 25, 21, 21, 21, 21, 21, 21, 17, 9, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1] [2025-03-04 15:36:43,481 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;" "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;" "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;" "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-04 15:36:43,482 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);" "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;" >"#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;" "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;" [2025-03-04 15:36:43,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash 478083247, now seen corresponding path program 21 times [2025-03-04 15:36:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:43,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806348440] [2025-03-04 15:36:43,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:43,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 362 statements into 14 equivalence classes. [2025-03-04 15:36:43,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-03-04 15:36:43,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 362 of 362 statements. [2025-03-04 15:36:43,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-04 15:36:43,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:43,556 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:43,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-04 15:36:43,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-04 15:36:43,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:43,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:43,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:43,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2128696953, now seen corresponding path program 9 times [2025-03-04 15:36:43,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:43,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710064768] [2025-03-04 15:36:43,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:43,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:43,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 359 statements into 15 equivalence classes. [2025-03-04 15:36:43,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 306 of 359 statements. [2025-03-04 15:36:43,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 15:36:43,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6938 backedges. 249 proven. 1075 refuted. 0 times theorem prover too weak. 5614 trivial. 0 not checked. [2025-03-04 15:36:44,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:44,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710064768] [2025-03-04 15:36:44,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710064768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:44,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001240331] [2025-03-04 15:36:44,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:44,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:44,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:44,031 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:44,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2025-03-04 15:36:44,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 359 statements into 15 equivalence classes. [2025-03-04 15:36:44,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 306 of 359 statements. [2025-03-04 15:36:44,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 15:36:44,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:44,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 15:36:44,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6938 backedges. 239 proven. 1042 refuted. 0 times theorem prover too weak. 5657 trivial. 0 not checked. [2025-03-04 15:36:44,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6938 backedges. 237 proven. 1046 refuted. 0 times theorem prover too weak. 5655 trivial. 0 not checked. [2025-03-04 15:36:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001240331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:45,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:45,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 17] total 35 [2025-03-04 15:36:45,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116653849] [2025-03-04 15:36:45,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:45,138 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:45,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:45,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 15:36:45,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 15:36:45,139 INFO L87 Difference]: Start difference. First operand 1595 states and 1657 transitions. cyclomatic complexity: 73 Second operand has 36 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 24 states have call successors, (30), 1 states have call predecessors, (30), 7 states have return successors, (31), 15 states have call predecessors, (31), 24 states have call successors, (31) [2025-03-04 15:36:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:45,680 INFO L93 Difference]: Finished difference Result 1827 states and 1931 transitions. [2025-03-04 15:36:45,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1827 states and 1931 transitions. [2025-03-04 15:36:45,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2025-03-04 15:36:45,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1827 states to 1827 states and 1929 transitions. [2025-03-04 15:36:45,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2025-03-04 15:36:45,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2025-03-04 15:36:45,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1827 states and 1929 transitions. [2025-03-04 15:36:45,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:45,686 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1827 states and 1929 transitions. [2025-03-04 15:36:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states and 1929 transitions. [2025-03-04 15:36:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1605. [2025-03-04 15:36:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1129 states have (on average 1.0186005314437556) internal successors, (1150), 1143 states have internal predecessors, (1150), 248 states have call successors, (255), 217 states have call predecessors, (255), 228 states have return successors, (266), 244 states have call predecessors, (266), 248 states have call successors, (266) [2025-03-04 15:36:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1671 transitions. [2025-03-04 15:36:45,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1605 states and 1671 transitions. [2025-03-04 15:36:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 15:36:45,695 INFO L432 stractBuchiCegarLoop]: Abstraction has 1605 states and 1671 transitions. [2025-03-04 15:36:45,695 INFO L338 stractBuchiCegarLoop]: ======== Iteration 36 ============ [2025-03-04 15:36:45,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1605 states and 1671 transitions. [2025-03-04 15:36:45,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-03-04 15:36:45,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:45,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:45,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 34, 20, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1] [2025-03-04 15:36:45,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [65, 65, 53, 32, 27, 27, 27, 27, 27, 27, 21, 12, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1] [2025-03-04 15:36:45,699 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;" "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;" "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;" "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-04 15:36:45,699 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);" "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;" >"#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;" "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;" "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;" [2025-03-04 15:36:45,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash 478083247, now seen corresponding path program 22 times [2025-03-04 15:36:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:45,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14588489] [2025-03-04 15:36:45,699 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:45,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:45,705 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 362 statements into 2 equivalence classes. [2025-03-04 15:36:45,721 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 362 of 362 statements. [2025-03-04 15:36:45,721 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:45,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:45,721 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:45,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-04 15:36:45,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-04 15:36:45,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:45,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:45,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:45,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:45,745 INFO L85 PathProgramCache]: Analyzing trace with hash 727197497, now seen corresponding path program 10 times [2025-03-04 15:36:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:45,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373614473] [2025-03-04 15:36:45,745 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:45,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:45,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 456 statements into 2 equivalence classes. [2025-03-04 15:36:45,777 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-04 15:36:45,777 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:36:45,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11318 backedges. 180 proven. 1790 refuted. 0 times theorem prover too weak. 9348 trivial. 0 not checked. [2025-03-04 15:36:46,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:46,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373614473] [2025-03-04 15:36:46,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373614473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:46,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916676178] [2025-03-04 15:36:46,114 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:46,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:46,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:46,116 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:46,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2025-03-04 15:36:46,210 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 456 statements into 2 equivalence classes. [2025-03-04 15:36:46,276 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-04 15:36:46,276 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:36:46,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:46,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:36:46,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11318 backedges. 5324 proven. 399 refuted. 0 times theorem prover too weak. 5595 trivial. 0 not checked. [2025-03-04 15:36:46,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 11318 backedges. 180 proven. 1805 refuted. 0 times theorem prover too weak. 9333 trivial. 0 not checked. [2025-03-04 15:36:47,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916676178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:47,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:47,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 21] total 29 [2025-03-04 15:36:47,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680441240] [2025-03-04 15:36:47,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:47,296 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:47,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:47,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 15:36:47,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2025-03-04 15:36:47,297 INFO L87 Difference]: Start difference. First operand 1605 states and 1671 transitions. cyclomatic complexity: 77 Second operand has 29 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 27 states have internal predecessors, (88), 20 states have call successors, (27), 2 states have call predecessors, (27), 8 states have return successors, (32), 11 states have call predecessors, (32), 20 states have call successors, (32) [2025-03-04 15:36:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:47,869 INFO L93 Difference]: Finished difference Result 1915 states and 2013 transitions. [2025-03-04 15:36:47,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1915 states and 2013 transitions. [2025-03-04 15:36:47,872 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:36:47,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1915 states to 0 states and 0 transitions. [2025-03-04 15:36:47,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:36:47,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:36:47,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:36:47,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:47,872 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:36:47,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:36:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 15:36:47,873 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:36:47,873 INFO L338 stractBuchiCegarLoop]: ======== Iteration 37 ============ [2025-03-04 15:36:47,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:36:47,873 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:36:47,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:36:47,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:36:47 BoogieIcfgContainer [2025-03-04 15:36:47,879 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:36:47,880 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:36:47,880 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:36:47,880 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:36:47,881 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:35:37" (3/4) ... [2025-03-04 15:36:47,885 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:36:47,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:36:47,886 INFO L158 Benchmark]: Toolchain (without parser) took 71026.89ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 914.4MB). Free memory was 122.2MB in the beginning and 797.8MB in the end (delta: -675.6MB). Peak memory consumption was 241.6MB. Max. memory is 16.1GB. [2025-03-04 15:36:47,886 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:47,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 136.84ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 112.0MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:47,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.27ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 111.0MB in the end (delta: 941.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:47,887 INFO L158 Benchmark]: Boogie Preprocessor took 20.14ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.0MB in the end (delta: 999.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:47,887 INFO L158 Benchmark]: IcfgBuilder took 218.46ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 98.5MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:36:47,887 INFO L158 Benchmark]: BuchiAutomizer took 70622.60ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 914.4MB). Free memory was 98.5MB in the beginning and 798.0MB in the end (delta: -699.5MB). Peak memory consumption was 208.1MB. Max. memory is 16.1GB. [2025-03-04 15:36:47,887 INFO L158 Benchmark]: Witness Printer took 5.73ms. Allocated memory is still 1.1GB. Free memory was 798.0MB in the beginning and 797.8MB in the end (delta: 216.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:47,888 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 136.84ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 112.0MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.27ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 111.0MB in the end (delta: 941.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.14ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.0MB in the end (delta: 999.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 218.46ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 98.5MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 70622.60ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 914.4MB). Free memory was 98.5MB in the beginning and 798.0MB in the end (delta: -699.5MB). Peak memory consumption was 208.1MB. Max. memory is 16.1GB. * Witness Printer took 5.73ms. Allocated memory is still 1.1GB. Free memory was 798.0MB in the beginning and 797.8MB in the end (delta: 216.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 51 terminating modules (34 trivial, 10 deterministic, 7 nondeterministic). One deterministic module has affine ranking function ((long) -1 * p) and consists of 3 locations. One deterministic module has affine ranking function (((long) -2 * p) + 1) and consists of 8 locations. One deterministic module has affine ranking function (((long) -2 * q) + 1) and consists of 8 locations. One deterministic module has affine ranking function (((long) -1 * q) + x) and consists of 6 locations. One deterministic module has affine ranking function \old(q) and consists of 7 locations. One deterministic module has affine ranking function \old(p) and consists of 8 locations. One deterministic module has affine ranking function q and consists of 7 locations. One deterministic module has affine ranking function (((long) -2 * p) + 1) and consists of 14 locations. One deterministic module has affine ranking function (3 + ((long) -2 * p)) and consists of 16 locations. One deterministic module has affine ranking function (5 + ((long) -2 * p)) and consists of 19 locations. One nondeterministic module has affine ranking function (((long) -1 * q) + x) and consists of 6 locations. One nondeterministic module has affine ranking function \old(p) and consists of 7 locations. One nondeterministic module has affine ranking function \old(q) and consists of 12 locations. One nondeterministic module has affine ranking function q and consists of 15 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 13 locations. 34 modules have a trivial ranking function, the largest among these consists of 37 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 70.5s and 37 iterations. TraceHistogramMax:65. Analysis of lassos took 35.1s. Construction of modules took 6.4s. Büchi inclusion checks took 26.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 49. Automata minimization 2.8s AutomataMinimizationTime, 50 MinimizatonAttempts, 14087 StatesRemovedByMinimization, 49 NontrivialMinimizations. Non-live state removal took 2.5s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [10, 0, 5, 2, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6580/7829 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3520 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3422 mSDsluCounter, 7301 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5487 mSDsCounter, 2613 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13007 IncrementalHoareTripleChecker+Invalid, 15620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2613 mSolverCounterUnsat, 1814 mSDtfsCounter, 13007 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI11 SFLT2 conc0 concLT6 SILN0 SILU0 SILI8 SILT9 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp89 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq163 hnf91 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 17 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:36:47,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:48,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Ended with exit code 0 [2025-03-04 15:36:48,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Ended with exit code 0 [2025-03-04 15:36:48,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Ended with exit code 0 [2025-03-04 15:36:48,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:48,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Ended with exit code 0 [2025-03-04 15:36:49,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2025-03-04 15:36:49,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:49,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2025-03-04 15:36:49,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:49,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2025-03-04 15:36:50,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2025-03-04 15:36:50,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2025-03-04 15:36:50,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:50,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2025-03-04 15:36:50,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:51,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:51,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2025-03-04 15:36:51,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2025-03-04 15:36:51,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:51,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:52,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:52,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2025-03-04 15:36:52,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2025-03-04 15:36:52,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:52,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:53,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2025-03-04 15:36:53,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:53,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-03-04 15:36:53,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:53,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:54,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:54,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-04 15:36:54,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:54,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:54,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE