./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Binomial.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/Binomial.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 c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:35:32,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:35:32,462 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:32,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:35:32,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:35:32,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:35:32,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:35:32,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:35:32,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:35:32,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:35:32,491 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:35:32,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:35:32,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:35:32,492 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:35:32,492 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:35:32,492 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:35:32,492 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:35:32,492 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:35:32,492 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:35:32,492 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:35:32,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:35:32,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:35:32,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:35:32,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:35:32,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:35:32,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:35:32,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:35:32,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:35:32,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:35:32,493 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:35:32,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:35:32,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:35:32,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:35:32,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:35:32,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:35:32,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:35:32,494 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:35:32,495 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 -> c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 [2025-03-04 15:35:32,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:35:32,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:35:32,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:35:32,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:35:32,718 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:35:32,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2025-03-04 15:35:33,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6aae5fd/4de397aa028e473e859c7a1041597d2c/FLAG1009b6398 [2025-03-04 15:35:34,065 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:35:34,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2025-03-04 15:35:34,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6aae5fd/4de397aa028e473e859c7a1041597d2c/FLAG1009b6398 [2025-03-04 15:35:34,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6aae5fd/4de397aa028e473e859c7a1041597d2c [2025-03-04 15:35:34,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:35:34,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:35:34,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:35:34,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:35:34,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:35:34,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:35:34" (1/1) ... [2025-03-04 15:35:34,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375fede8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:34, skipping insertion in model container [2025-03-04 15:35:34,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:35:34" (1/1) ... [2025-03-04 15:35:34,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:35:34,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:35:34,520 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:35:34,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:35:34,536 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:35:34,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:34 WrapperNode [2025-03-04 15:35:34,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:35:34,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:35:34,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:35:34,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:35:34,540 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:34" (1/1) ... [2025-03-04 15:35:34,542 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:34" (1/1) ... [2025-03-04 15:35:34,551 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-03-04 15:35:34,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:35:34,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:35:34,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:35:34,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:35:34,556 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:34" (1/1) ... [2025-03-04 15:35:34,556 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:34" (1/1) ... [2025-03-04 15:35:34,557 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:34" (1/1) ... [2025-03-04 15:35:34,560 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:35:34,560 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:34" (1/1) ... [2025-03-04 15:35:34,561 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:34" (1/1) ... [2025-03-04 15:35:34,562 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:34" (1/1) ... [2025-03-04 15:35:34,562 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:34" (1/1) ... [2025-03-04 15:35:34,562 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:34" (1/1) ... [2025-03-04 15:35:34,563 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:34" (1/1) ... [2025-03-04 15:35:34,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:35:34,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:35:34,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:35:34,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:35:34,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:34" (1/1) ... [2025-03-04 15:35:34,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:34,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:34,589 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:34,591 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:34,607 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2025-03-04 15:35:34,607 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2025-03-04 15:35:34,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:35:34,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:35:34,645 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:35:34,647 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:35:34,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; [2025-03-04 15:35:34,795 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30-6: havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; [2025-03-04 15:35:34,803 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 15:35:34,804 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:35:34,814 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:35:34,815 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:35:34,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:35:34 BoogieIcfgContainer [2025-03-04 15:35:34,816 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:35:34,816 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:35:34,816 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:35:34,822 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:35:34,822 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:35:34,822 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:35:34" (1/3) ... [2025-03-04 15:35:34,823 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9f847f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:35:34, skipping insertion in model container [2025-03-04 15:35:34,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:35:34,824 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:34" (2/3) ... [2025-03-04 15:35:34,824 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9f847f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:35:34, skipping insertion in model container [2025-03-04 15:35:34,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:35:34,824 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:35:34" (3/3) ... [2025-03-04 15:35:34,825 INFO L363 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2025-03-04 15:35:34,865 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:35:34,865 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:35:34,865 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:35:34,865 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:35:34,866 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:35:34,866 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:35:34,866 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:35:34,866 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:35:34,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 15:35:34,885 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-03-04 15:35:34,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:34,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:34,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:35:34,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:35:34,888 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:35:34,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 15:35:34,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-03-04 15:35:34,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:34,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:34,890 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:35:34,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:35:34,894 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" [2025-03-04 15:35:34,894 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-04 15:35:34,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:34,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2123067, now seen corresponding path program 1 times [2025-03-04 15:35:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971531589] [2025-03-04 15:35:34,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:34,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:34,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:34,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:34,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:34,952 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:34,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:34,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:34,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:34,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:34,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:34,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:34,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1806, now seen corresponding path program 1 times [2025-03-04 15:35:34,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:34,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106552379] [2025-03-04 15:35:34,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:34,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:34,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:34,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:34,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:34,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:34,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:34,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:34,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:34,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:34,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:34,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:34,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2040268232, now seen corresponding path program 1 times [2025-03-04 15:35:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:34,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718755006] [2025-03-04 15:35:34,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:34,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:34,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:35:34,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:34,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:34,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:35,053 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:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718755006] [2025-03-04 15:35:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718755006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:35,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:35,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:35:35,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668769500] [2025-03-04 15:35:35,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:35,106 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:35,107 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:35,107 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:35,107 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:35,107 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:35,107 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:35,107 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:35,107 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:35,107 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2025-03-04 15:35:35,107 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:35,107 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:35,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:35,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:35,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:35,173 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:35,173 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:35,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:35,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:35,176 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:35,180 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:35,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:35,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:35,195 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:35,195 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:35,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:35:35,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:35,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:35,204 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:35,205 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:35,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:35,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:35,216 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:35,216 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post10#1=0} Honda state: {ULTIMATE.start_main_#t~post10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:35,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:35:35,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:35,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:35,224 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:35,225 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:35,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:35,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:35,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:35,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:35,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:35,245 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:35,245 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:35,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:35,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:35,303 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:35,307 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:35,308 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:35,308 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:35,308 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:35,308 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:35,308 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:35,308 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:35,308 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:35,308 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:35,308 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2025-03-04 15:35:35,308 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:35,308 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:35,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:35,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:35,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:35,353 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:35,356 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:35,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:35,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:35,359 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:35,360 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:35,360 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:35,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:35,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:35,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:35,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:35,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:35,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:35,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:35,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:35,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 15:35:35,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:35,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:35,384 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:35,385 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:35,386 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:35,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:35,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:35,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:35,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:35,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:35,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:35,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:35,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:35,404 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:35,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:35,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:35,406 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:35,407 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:35,408 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:35,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:35,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:35,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:35,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:35,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:35,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:35,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:35,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:35,424 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 15:35:35,427 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-04 15:35:35,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:35,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:35,431 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:35,432 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:35,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:35,433 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:35,433 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:35,433 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-04 15:35:35,438 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:35,440 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:35,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:35,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:35,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:35,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:35,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:35,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:35:35,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:35,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:35,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:35,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:35,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:35,472 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:35,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:35,491 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:35,510 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:35,511 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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:35,555 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7). 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 41 states and 58 transitions. Complement of second has 5 states. [2025-03-04 15:35:35,558 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:35,561 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:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-03-04 15:35:35,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:35:35,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:35,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:35:35,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:35,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-04 15:35:35,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:35,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2025-03-04 15:35:35,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2025-03-04 15:35:35,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 31 states and 45 transitions. [2025-03-04 15:35:35,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-04 15:35:35,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-04 15:35:35,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2025-03-04 15:35:35,585 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:35,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:35,586 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-03-04 15:35:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2025-03-04 15:35:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-03-04 15:35:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 15:35:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-03-04 15:35:35,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-04 15:35:35,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:35,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:35:35,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:35:35,610 INFO L87 Difference]: Start difference. First operand 28 states and 39 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:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:35,661 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2025-03-04 15:35:35,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2025-03-04 15:35:35,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-04 15:35:35,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2025-03-04 15:35:35,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-04 15:35:35,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-04 15:35:35,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2025-03-04 15:35:35,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:35:35,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-03-04 15:35:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2025-03-04 15:35:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-04 15:35:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 15:35:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-04 15:35:35,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-04 15:35:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:35:35,667 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-04 15:35:35,667 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:35:35,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2025-03-04 15:35:35,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-03-04 15:35:35,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:35,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:35,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:35:35,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:35,670 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" [2025-03-04 15:35:35,670 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-04 15:35:35,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2123067, now seen corresponding path program 2 times [2025-03-04 15:35:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:35,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067741922] [2025-03-04 15:35:35,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:35,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:35,674 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:35,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:35,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:35,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:35,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:35,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:35,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:35,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:35,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:35,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash 114375069, now seen corresponding path program 1 times [2025-03-04 15:35:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:35,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190913142] [2025-03-04 15:35:35,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:35,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:35:35,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:35:35,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:35,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:35:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242939895] [2025-03-04 15:35:35,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:35,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:35,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:35,705 INFO L229 MonitoredProcess]: Starting monitored process 10 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:35,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:35:35,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:35:35,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:35:35,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:35,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:35,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:35,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:35:35,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:35:35,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:35,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:35,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:35,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1885038761, now seen corresponding path program 1 times [2025-03-04 15:35:35,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:35,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722853112] [2025-03-04 15:35:35,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:35,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:35:35,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:35:35,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:35,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:35:35,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931542248] [2025-03-04 15:35:35,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:35,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:35,780 INFO L229 MonitoredProcess]: Starting monitored process 11 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:35,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:35:35,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:35:35,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:35:35,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:35,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:35,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:35,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:35:35,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:35:35,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:35,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:35,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:36,062 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:36,062 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:36,062 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:36,062 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:36,062 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:36,062 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,062 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:36,063 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:36,063 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2025-03-04 15:35:36,063 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:36,063 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:36,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,132 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:36,132 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:36,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,135 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:36,136 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:36,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:36,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:36,148 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:36,148 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:36,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:36,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,155 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:36,156 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:36,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:36,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:36,167 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:36,167 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:36,172 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:36,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,173 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:36,174 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:36,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:36,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:36,185 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:36,185 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:36,190 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:36,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,192 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:36,193 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:36,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:36,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:36,211 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:36,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,214 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:36,215 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:36,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:36,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:36,228 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:36,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:36,234 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:36,234 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:36,234 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:36,234 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:36,234 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:36,234 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,234 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:36,234 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:36,234 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2025-03-04 15:35:36,234 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:36,234 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:36,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:36,316 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:36,316 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:36,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,321 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:36,322 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:36,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:36,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:36,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:36,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:36,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:36,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:36,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:36,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:36,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:36,340 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:36,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,342 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:36,343 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:36,344 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:36,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:36,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:36,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:36,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:36,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:36,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:36,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:36,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:36,361 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:36,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,363 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:36,365 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:36,366 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:36,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:36,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:36,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:36,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:36,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:36,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:36,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:36,378 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:36,383 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:36,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,386 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:36,388 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:36,389 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:36,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:36,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:36,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:36,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:36,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:36,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:36,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:36,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:36,406 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:36,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,409 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:36,409 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:36,411 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:36,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:36,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:36,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:36,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:36,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:36,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:36,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:36,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:36,426 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:35:36,426 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:35:36,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:36,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:36,428 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:36,428 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:36,429 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:36,429 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:36,429 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:36,429 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 1 Supporting invariants [] [2025-03-04 15:35:36,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 15:35:36,435 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:36,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:36,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:35:36,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:35:36,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:36,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:36,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:35:36,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:36,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:35:36,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:35:36,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:36,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:36,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:35:36,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:36,535 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:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:35:36,658 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-04 15:35:36,658 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11 Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 15:35:36,902 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Result 111 states and 174 transitions. Complement of second has 28 states. [2025-03-04 15:35:36,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-03-04 15:35:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 15:35:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2025-03-04 15:35:36,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 4 letters. Loop has 22 letters. [2025-03-04 15:35:36,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:36,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 26 letters. Loop has 22 letters. [2025-03-04 15:35:36,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:36,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 4 letters. Loop has 44 letters. [2025-03-04 15:35:36,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:36,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 174 transitions. [2025-03-04 15:35:36,910 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2025-03-04 15:35:36,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 174 transitions. [2025-03-04 15:35:36,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-03-04 15:35:36,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-03-04 15:35:36,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 174 transitions. [2025-03-04 15:35:36,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:36,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 174 transitions. [2025-03-04 15:35:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 174 transitions. [2025-03-04 15:35:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-03-04 15:35:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 64 states have (on average 1.234375) internal successors, (79), 65 states have internal predecessors, (79), 30 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (42), 30 states have call predecessors, (42), 30 states have call successors, (42) [2025-03-04 15:35:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2025-03-04 15:35:36,922 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-03-04 15:35:36,922 INFO L432 stractBuchiCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-03-04 15:35:36,922 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:35:36,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 151 transitions. [2025-03-04 15:35:36,924 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2025-03-04 15:35:36,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:36,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:36,925 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:35:36,925 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:36,925 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-04 15:35:36,925 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-04 15:35:36,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash 65815104, now seen corresponding path program 1 times [2025-03-04 15:35:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:36,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515039327] [2025-03-04 15:35:36,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:36,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:36,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:36,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:36,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:36,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:36,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:36,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:36,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:36,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:36,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:36,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1761412171, now seen corresponding path program 1 times [2025-03-04 15:35:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:36,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955025374] [2025-03-04 15:35:36,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:36,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:35:36,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:35:36,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:36,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 15:35:37,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955025374] [2025-03-04 15:35:37,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955025374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:37,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:37,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:35:37,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044166224] [2025-03-04 15:35:37,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:37,055 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:37,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:37,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:35:37,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:35:37,055 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. cyclomatic complexity: 54 Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:35:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:37,098 INFO L93 Difference]: Finished difference Result 141 states and 212 transitions. [2025-03-04 15:35:37,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 212 transitions. [2025-03-04 15:35:37,100 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 49 [2025-03-04 15:35:37,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 138 states and 209 transitions. [2025-03-04 15:35:37,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2025-03-04 15:35:37,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2025-03-04 15:35:37,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 209 transitions. [2025-03-04 15:35:37,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:37,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 209 transitions. [2025-03-04 15:35:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 209 transitions. [2025-03-04 15:35:37,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2025-03-04 15:35:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 30 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (42), 30 states have call predecessors, (42), 30 states have call successors, (42) [2025-03-04 15:35:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-03-04 15:35:37,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-03-04 15:35:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:35:37,113 INFO L432 stractBuchiCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-03-04 15:35:37,114 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:35:37,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 155 transitions. [2025-03-04 15:35:37,116 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2025-03-04 15:35:37,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:37,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:37,119 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:35:37,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:37,119 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-04 15:35:37,119 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-04 15:35:37,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash 65815104, now seen corresponding path program 2 times [2025-03-04 15:35:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:37,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570465827] [2025-03-04 15:35:37,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:37,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:37,124 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:37,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:37,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:37,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:37,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:37,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:37,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:37,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:37,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:37,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:37,133 INFO L85 PathProgramCache]: Analyzing trace with hash 743731512, now seen corresponding path program 1 times [2025-03-04 15:35:37,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:37,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561117942] [2025-03-04 15:35:37,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:37,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:35:37,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:35:37,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:37,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 15:35:37,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:37,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561117942] [2025-03-04 15:35:37,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561117942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:37,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594341176] [2025-03-04 15:35:37,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:37,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:37,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:37,419 INFO L229 MonitoredProcess]: Starting monitored process 23 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:37,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 15:35:37,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:35:37,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:35:37,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:37,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:37,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:35:37,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:35:37,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 15:35:37,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594341176] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:37,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:37,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 19 [2025-03-04 15:35:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578966176] [2025-03-04 15:35:37,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:37,762 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:37,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:35:37,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:35:37,763 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. cyclomatic complexity: 54 Second operand has 19 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (13), 10 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-04 15:35:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:38,035 INFO L93 Difference]: Finished difference Result 228 states and 371 transitions. [2025-03-04 15:35:38,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 228 states and 371 transitions. [2025-03-04 15:35:38,038 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 76 [2025-03-04 15:35:38,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 228 states to 228 states and 371 transitions. [2025-03-04 15:35:38,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-03-04 15:35:38,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-03-04 15:35:38,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 228 states and 371 transitions. [2025-03-04 15:35:38,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:38,042 INFO L218 hiAutomatonCegarLoop]: Abstraction has 228 states and 371 transitions. [2025-03-04 15:35:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states and 371 transitions. [2025-03-04 15:35:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 150. [2025-03-04 15:35:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 89 states have internal predecessors, (103), 46 states have call successors, (46), 10 states have call predecessors, (46), 16 states have return successors, (116), 50 states have call predecessors, (116), 46 states have call successors, (116) [2025-03-04 15:35:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 265 transitions. [2025-03-04 15:35:38,067 INFO L240 hiAutomatonCegarLoop]: Abstraction has 150 states and 265 transitions. [2025-03-04 15:35:38,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:35:38,070 INFO L432 stractBuchiCegarLoop]: Abstraction has 150 states and 265 transitions. [2025-03-04 15:35:38,070 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:35:38,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 265 transitions. [2025-03-04 15:35:38,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2025-03-04 15:35:38,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:38,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:38,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:35:38,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:38,072 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-04 15:35:38,072 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-04 15:35:38,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash 65815104, now seen corresponding path program 3 times [2025-03-04 15:35:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:38,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746088415] [2025-03-04 15:35:38,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:38,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:38,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:38,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:35:38,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:35:38,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,078 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:38,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:38,079 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,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:38,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:38,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1578924882, now seen corresponding path program 2 times [2025-03-04 15:35:38,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:38,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116976059] [2025-03-04 15:35:38,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:38,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:38,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 15:35:38,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:35:38,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:38,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 15 proven. 106 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-04 15:35:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116976059] [2025-03-04 15:35:38,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116976059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198431185] [2025-03-04 15:35:38,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:38,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:38,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:38,274 INFO L229 MonitoredProcess]: Starting monitored process 24 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:38,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 15:35:38,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 15:35:38,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:35:38,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:38,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:38,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 15:35:38,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 15 proven. 103 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 15:35:38,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 15:35:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198431185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:38,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:38,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 19 [2025-03-04 15:35:38,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097967101] [2025-03-04 15:35:38,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:38,755 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:38,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:38,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:35:38,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:35:38,756 INFO L87 Difference]: Start difference. First operand 150 states and 265 transitions. cyclomatic complexity: 120 Second operand has 19 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 11 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-04 15:35:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:39,046 INFO L93 Difference]: Finished difference Result 286 states and 517 transitions. [2025-03-04 15:35:39,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 517 transitions. [2025-03-04 15:35:39,049 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2025-03-04 15:35:39,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 286 states and 517 transitions. [2025-03-04 15:35:39,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2025-03-04 15:35:39,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2025-03-04 15:35:39,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 517 transitions. [2025-03-04 15:35:39,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:39,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 286 states and 517 transitions. [2025-03-04 15:35:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 517 transitions. [2025-03-04 15:35:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 176. [2025-03-04 15:35:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 100 states have (on average 1.15) internal successors, (115), 101 states have internal predecessors, (115), 54 states have call successors, (54), 10 states have call predecessors, (54), 22 states have return successors, (186), 64 states have call predecessors, (186), 54 states have call successors, (186) [2025-03-04 15:35:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 355 transitions. [2025-03-04 15:35:39,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 176 states and 355 transitions. [2025-03-04 15:35:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:35:39,080 INFO L432 stractBuchiCegarLoop]: Abstraction has 176 states and 355 transitions. [2025-03-04 15:35:39,080 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:35:39,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 355 transitions. [2025-03-04 15:35:39,081 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2025-03-04 15:35:39,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:39,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:39,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:35:39,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:39,082 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-04 15:35:39,082 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-04 15:35:39,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash 65815104, now seen corresponding path program 4 times [2025-03-04 15:35:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:39,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621009524] [2025-03-04 15:35:39,082 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:39,085 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-04 15:35:39,087 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:35:39,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:35:39,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:39,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:39,088 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,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:39,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,089 INFO L85 PathProgramCache]: Analyzing trace with hash 774969874, now seen corresponding path program 3 times [2025-03-04 15:35:39,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:39,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992828933] [2025-03-04 15:35:39,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:39,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:39,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 9 equivalence classes. [2025-03-04 15:35:39,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:35:39,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 15:35:39,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:35:39,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558278865] [2025-03-04 15:35:39,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:39,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,115 INFO L229 MonitoredProcess]: Starting monitored process 25 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:39,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 15:35:39,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 9 equivalence classes. [2025-03-04 15:35:39,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:35:39,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 15:35:39,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:39,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:39,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 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 44 of 44 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,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:39,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2144483793, now seen corresponding path program 1 times [2025-03-04 15:35:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:39,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484989000] [2025-03-04 15:35:39,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:39,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 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 49 of 49 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,238 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:35:39,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:39,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484989000] [2025-03-04 15:35:39,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484989000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:39,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6928726] [2025-03-04 15:35:39,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:39,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,241 INFO L229 MonitoredProcess]: Starting monitored process 26 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:39,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 15:35:39,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:35:39,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:35:39,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:39,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:39,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 15:35:39,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:35:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6928726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:39,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:39,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2025-03-04 15:35:39,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396292208] [2025-03-04 15:35:39,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:39,614 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:39,614 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:39,614 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:39,615 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:39,615 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:39,615 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,615 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:39,615 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:39,615 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2025-03-04 15:35:39,615 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:39,615 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:39,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,668 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:39,668 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:39,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,670 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:39,671 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:39,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:39,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:39,685 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:39,685 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:39,690 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:39,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,692 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:39,693 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:39,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:39,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:39,704 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:39,704 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:39,709 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:39,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,711 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:39,712 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:39,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:39,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:39,723 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:39,723 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:39,729 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:39,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,731 INFO L229 MonitoredProcess]: Starting monitored process 30 with /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,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 15:35:39,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:39,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:39,744 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:39,744 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:39,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:35:39,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,753 INFO L229 MonitoredProcess]: Starting monitored process 31 with /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,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 15:35:39,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:39,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:39,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 15:35:39,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,778 INFO L229 MonitoredProcess]: Starting monitored process 32 with /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,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 15:35:39,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:39,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:39,792 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:39,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 15:35:39,798 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:39,798 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:39,798 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:39,798 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:39,798 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:39,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,798 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:39,798 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:39,798 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2025-03-04 15:35:39,798 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:39,798 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:39,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:39,862 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:39,862 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:39,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,864 INFO L229 MonitoredProcess]: Starting monitored process 33 with /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,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 15:35:39,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:39,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:39,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:39,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:39,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:39,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:39,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:39,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:39,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:39,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:39,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,886 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:39,887 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:39,889 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,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:39,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:39,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:39,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:39,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:39,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:39,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:39,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:39,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:39,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,909 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:39,911 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:39,911 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,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:39,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:39,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:39,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:39,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:39,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:39,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:39,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:39,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 15:35:39,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,931 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:39,931 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:39,932 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,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:39,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:39,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:39,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:39,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:39,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:39,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:39,945 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:39,946 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:35:39,946 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:35:39,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:39,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:39,948 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:39,949 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:39,950 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:39,950 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:39,950 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:39,950 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 5 Supporting invariants [] [2025-03-04 15:35:39,955 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:39,956 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:39,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:39,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:35:39,966 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,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:39,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:35:39,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:39,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:35:40,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:35:40,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:40,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 15:35:40,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:40,178 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:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 15:35:40,186 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2025-03-04 15:35:40,186 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 355 transitions. cyclomatic complexity: 184 Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 15:35:40,470 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 355 transitions. cyclomatic complexity: 184. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 709 states and 1325 transitions. Complement of second has 53 states. [2025-03-04 15:35:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2025-03-04 15:35:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 15:35:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2025-03-04 15:35:40,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 5 letters. Loop has 44 letters. [2025-03-04 15:35:40,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:40,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 49 letters. Loop has 44 letters. [2025-03-04 15:35:40,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:40,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 5 letters. Loop has 88 letters. [2025-03-04 15:35:40,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:40,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 709 states and 1325 transitions. [2025-03-04 15:35:40,485 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 75 [2025-03-04 15:35:40,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 709 states to 618 states and 1133 transitions. [2025-03-04 15:35:40,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2025-03-04 15:35:40,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2025-03-04 15:35:40,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 618 states and 1133 transitions. [2025-03-04 15:35:40,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:40,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 618 states and 1133 transitions. [2025-03-04 15:35:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states and 1133 transitions. [2025-03-04 15:35:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 569. [2025-03-04 15:35:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 330 states have (on average 1.1666666666666667) internal successors, (385), 332 states have internal predecessors, (385), 164 states have call successors, (164), 32 states have call predecessors, (164), 75 states have return successors, (474), 204 states have call predecessors, (474), 160 states have call successors, (474) [2025-03-04 15:35:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1023 transitions. [2025-03-04 15:35:40,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 569 states and 1023 transitions. [2025-03-04 15:35:40,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:40,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:35:40,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:35:40,535 INFO L87 Difference]: Start difference. First operand 569 states and 1023 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 15:35:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:40,634 INFO L93 Difference]: Finished difference Result 520 states and 883 transitions. [2025-03-04 15:35:40,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 520 states and 883 transitions. [2025-03-04 15:35:40,640 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 63 [2025-03-04 15:35:40,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 520 states to 518 states and 879 transitions. [2025-03-04 15:35:40,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2025-03-04 15:35:40,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2025-03-04 15:35:40,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 518 states and 879 transitions. [2025-03-04 15:35:40,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:40,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 518 states and 879 transitions. [2025-03-04 15:35:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states and 879 transitions. [2025-03-04 15:35:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 514. [2025-03-04 15:35:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 304 states have (on average 1.1710526315789473) internal successors, (356), 317 states have internal predecessors, (356), 132 states have call successors, (132), 32 states have call predecessors, (132), 78 states have return successors, (385), 164 states have call predecessors, (385), 129 states have call successors, (385) [2025-03-04 15:35:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 873 transitions. [2025-03-04 15:35:40,670 INFO L240 hiAutomatonCegarLoop]: Abstraction has 514 states and 873 transitions. [2025-03-04 15:35:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:35:40,671 INFO L432 stractBuchiCegarLoop]: Abstraction has 514 states and 873 transitions. [2025-03-04 15:35:40,671 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:35:40,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 514 states and 873 transitions. [2025-03-04 15:35:40,674 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 63 [2025-03-04 15:35:40,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:40,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:40,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:35:40,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:40,675 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:40,675 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:40,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:40,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2040268250, now seen corresponding path program 1 times [2025-03-04 15:35:40,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:40,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642548203] [2025-03-04 15:35:40,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:40,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:40,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:35:40,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:40,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:40,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:40,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:35:40,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:40,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:40,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:40,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1942084370, now seen corresponding path program 1 times [2025-03-04 15:35:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:40,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734231947] [2025-03-04 15:35:40,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:40,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:40,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 15:35:40,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 15:35:40,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 22 proven. 202 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 15:35:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734231947] [2025-03-04 15:35:40,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734231947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304506941] [2025-03-04 15:35:40,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:40,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [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,910 INFO L229 MonitoredProcess]: Starting monitored process 38 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:40,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-04 15:35:40,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 15:35:40,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 15:35:40,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:40,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:40,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:35:40,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 179 proven. 86 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 15:35:41,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 15 proven. 219 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-04 15:35:41,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304506941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:41,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:41,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 18] total 23 [2025-03-04 15:35:41,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403218028] [2025-03-04 15:35:41,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:41,643 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:41,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:41,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:35:41,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:35:41,643 INFO L87 Difference]: Start difference. First operand 514 states and 873 transitions. cyclomatic complexity: 376 Second operand has 23 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 14 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (19), 10 states have call predecessors, (19), 14 states have call successors, (19) [2025-03-04 15:35:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:42,026 INFO L93 Difference]: Finished difference Result 836 states and 1414 transitions. [2025-03-04 15:35:42,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 836 states and 1414 transitions. [2025-03-04 15:35:42,033 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 93 [2025-03-04 15:35:42,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 836 states to 812 states and 1368 transitions. [2025-03-04 15:35:42,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2025-03-04 15:35:42,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2025-03-04 15:35:42,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 812 states and 1368 transitions. [2025-03-04 15:35:42,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:42,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 812 states and 1368 transitions. [2025-03-04 15:35:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states and 1368 transitions. [2025-03-04 15:35:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 682. [2025-03-04 15:35:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 426 states have (on average 1.1713615023474178) internal successors, (499), 422 states have internal predecessors, (499), 158 states have call successors, (158), 74 states have call predecessors, (158), 98 states have return successors, (479), 185 states have call predecessors, (479), 155 states have call successors, (479) [2025-03-04 15:35:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1136 transitions. [2025-03-04 15:35:42,073 INFO L240 hiAutomatonCegarLoop]: Abstraction has 682 states and 1136 transitions. [2025-03-04 15:35:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 15:35:42,074 INFO L432 stractBuchiCegarLoop]: Abstraction has 682 states and 1136 transitions. [2025-03-04 15:35:42,074 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:35:42,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 682 states and 1136 transitions. [2025-03-04 15:35:42,078 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 65 [2025-03-04 15:35:42,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:42,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:42,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:35:42,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:42,080 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:42,080 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:42,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2040268250, now seen corresponding path program 2 times [2025-03-04 15:35:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917477989] [2025-03-04 15:35:42,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:42,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:35:42,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:42,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:42,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:42,083 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:42,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:35:42,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:42,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:42,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:42,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:42,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash 792981550, now seen corresponding path program 2 times [2025-03-04 15:35:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347304633] [2025-03-04 15:35:42,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:42,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-04 15:35:42,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:35:42,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:42,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 28 proven. 131 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 15:35:42,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347304633] [2025-03-04 15:35:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347304633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385524533] [2025-03-04 15:35:42,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:42,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:42,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:42,300 INFO L229 MonitoredProcess]: Starting monitored process 39 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,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-04 15:35:42,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-04 15:35:42,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:35:42,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:42,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:42,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 15:35:42,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 128 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 15:35:42,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 141 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 15:35:42,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385524533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:42,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:42,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 16] total 25 [2025-03-04 15:35:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523559380] [2025-03-04 15:35:42,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:42,942 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:42,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 15:35:42,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2025-03-04 15:35:42,943 INFO L87 Difference]: Start difference. First operand 682 states and 1136 transitions. cyclomatic complexity: 471 Second operand has 25 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 15 states have call successors, (19) [2025-03-04 15:35:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:43,353 INFO L93 Difference]: Finished difference Result 984 states and 1596 transitions. [2025-03-04 15:35:43,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 984 states and 1596 transitions. [2025-03-04 15:35:43,361 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 129 [2025-03-04 15:35:43,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 984 states to 984 states and 1596 transitions. [2025-03-04 15:35:43,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2025-03-04 15:35:43,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 319 [2025-03-04 15:35:43,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 984 states and 1596 transitions. [2025-03-04 15:35:43,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:43,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 984 states and 1596 transitions. [2025-03-04 15:35:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states and 1596 transitions. [2025-03-04 15:35:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 752. [2025-03-04 15:35:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 462 states have (on average 1.1666666666666667) internal successors, (539), 454 states have internal predecessors, (539), 190 states have call successors, (190), 90 states have call predecessors, (190), 100 states have return successors, (537), 207 states have call predecessors, (537), 187 states have call successors, (537) [2025-03-04 15:35:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1266 transitions. [2025-03-04 15:35:43,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 752 states and 1266 transitions. [2025-03-04 15:35:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 15:35:43,401 INFO L432 stractBuchiCegarLoop]: Abstraction has 752 states and 1266 transitions. [2025-03-04 15:35:43,401 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:35:43,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 752 states and 1266 transitions. [2025-03-04 15:35:43,404 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 73 [2025-03-04 15:35:43,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:43,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:43,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:35:43,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:43,407 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:43,407 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:43,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2040268250, now seen corresponding path program 3 times [2025-03-04 15:35:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963900118] [2025-03-04 15:35:43,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:43,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:43,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:35:43,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:43,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:35:43,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:43,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:43,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:35:43,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:43,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:43,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:43,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:43,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1635144492, now seen corresponding path program 3 times [2025-03-04 15:35:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:43,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906688222] [2025-03-04 15:35:43,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:43,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 15 equivalence classes. [2025-03-04 15:35:43,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 71 of 80 statements. [2025-03-04 15:35:43,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 15:35:43,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 48 proven. 226 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 15:35:43,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:43,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906688222] [2025-03-04 15:35:43,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906688222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:43,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36897489] [2025-03-04 15:35:43,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:43,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:43,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:43,601 INFO L229 MonitoredProcess]: Starting monitored process 40 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:43,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-04 15:35:43,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 15 equivalence classes. [2025-03-04 15:35:43,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 71 of 80 statements. [2025-03-04 15:35:43,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-04 15:35:43,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:43,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:35:43,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 48 proven. 226 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 15:35:43,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 48 proven. 258 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 15:35:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36897489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:44,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 20] total 26 [2025-03-04 15:35:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127479679] [2025-03-04 15:35:44,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:44,650 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:44,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:44,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:35:44,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:35:44,651 INFO L87 Difference]: Start difference. First operand 752 states and 1266 transitions. cyclomatic complexity: 531 Second operand has 26 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2025-03-04 15:35:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:45,472 INFO L93 Difference]: Finished difference Result 1540 states and 2814 transitions. [2025-03-04 15:35:45,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1540 states and 2814 transitions. [2025-03-04 15:35:45,490 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 229 [2025-03-04 15:35:45,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1540 states to 1540 states and 2814 transitions. [2025-03-04 15:35:45,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 509 [2025-03-04 15:35:45,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 509 [2025-03-04 15:35:45,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1540 states and 2814 transitions. [2025-03-04 15:35:45,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:45,509 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1540 states and 2814 transitions. [2025-03-04 15:35:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states and 2814 transitions. [2025-03-04 15:35:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 932. [2025-03-04 15:35:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 558 states have (on average 1.1379928315412187) internal successors, (635), 538 states have internal predecessors, (635), 238 states have call successors, (238), 102 states have call predecessors, (238), 136 states have return successors, (961), 291 states have call predecessors, (961), 235 states have call successors, (961) [2025-03-04 15:35:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1834 transitions. [2025-03-04 15:35:45,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 932 states and 1834 transitions. [2025-03-04 15:35:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 15:35:45,568 INFO L432 stractBuchiCegarLoop]: Abstraction has 932 states and 1834 transitions. [2025-03-04 15:35:45,569 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:35:45,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 932 states and 1834 transitions. [2025-03-04 15:35:45,575 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 91 [2025-03-04 15:35:45,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:45,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:45,576 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:35:45,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:45,577 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:45,577 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:45,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:45,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2040268250, now seen corresponding path program 4 times [2025-03-04 15:35:45,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:45,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302116834] [2025-03-04 15:35:45,577 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:45,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:45,579 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:35:45,580 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:45,580 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:35:45,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:45,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:45,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:35:45,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 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,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:45,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:45,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash -817995692, now seen corresponding path program 4 times [2025-03-04 15:35:45,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:45,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643199337] [2025-03-04 15:35:45,583 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:45,589 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-03-04 15:35:45,596 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:35:45,597 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:35:45,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:35:45,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2144902732] [2025-03-04 15:35:45,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:45,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:45,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:45,599 INFO L229 MonitoredProcess]: Starting monitored process 41 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,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-03-04 15:35:45,645 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-03-04 15:35:45,772 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:35:45,772 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:35:45,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:45,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:45,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 15:35:45,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:35:45,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:45,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:45,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:45,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1449282605, now seen corresponding path program 1 times [2025-03-04 15:35:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:45,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096513795] [2025-03-04 15:35:45,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:45,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 15:35:45,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 15:35:45,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:45,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-04 15:35:45,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:45,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096513795] [2025-03-04 15:35:45,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096513795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:45,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:35:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141685270] [2025-03-04 15:35:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:46,281 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:46,281 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:46,281 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:46,281 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:46,281 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:46,281 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,281 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:46,281 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:46,281 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2025-03-04 15:35:46,281 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:46,281 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:46,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,335 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:46,336 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:46,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:46,338 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:46,339 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:46,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:46,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:46,350 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:46,350 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:46,355 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:46,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:46,357 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:46,358 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:46,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:46,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:46,375 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:46,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:46,377 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:46,379 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:46,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:46,379 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:46,391 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:46,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 15:35:46,396 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:46,396 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:46,396 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:46,396 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:46,396 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:46,396 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,396 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:46,397 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:46,397 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2025-03-04 15:35:46,397 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:46,397 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:46,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:46,441 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:46,442 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:46,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:46,444 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:46,445 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:46,446 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:46,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:46,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:46,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:46,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:46,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:46,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:46,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:46,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:46,460 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:35:46,460 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:35:46,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:46,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:46,462 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:46,463 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:46,463 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:46,463 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:46,463 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:46,463 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 9 Supporting invariants [] [2025-03-04 15:35:46,469 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:46,469 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:46,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:46,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:35:46,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:46,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:46,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:46,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:35:46,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:46,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 15:35:46,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:35:46,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:46,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:46,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 15:35:46,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:46,581 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:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-04 15:35:46,795 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2025-03-04 15:35:46,796 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 932 states and 1834 transitions. cyclomatic complexity: 919 Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 15:35:47,100 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 932 states and 1834 transitions. cyclomatic complexity: 919. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Result 2152 states and 3702 transitions. Complement of second has 77 states. [2025-03-04 15:35:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 15 non-accepting loop states 1 accepting loop states [2025-03-04 15:35:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 15:35:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 90 transitions. [2025-03-04 15:35:47,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 90 transitions. Stem has 6 letters. Loop has 80 letters. [2025-03-04 15:35:47,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:47,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 90 transitions. Stem has 86 letters. Loop has 80 letters. [2025-03-04 15:35:47,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:47,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 90 transitions. Stem has 6 letters. Loop has 160 letters. [2025-03-04 15:35:47,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:47,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2152 states and 3702 transitions. [2025-03-04 15:35:47,123 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 85 [2025-03-04 15:35:47,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2152 states to 1485 states and 2632 transitions. [2025-03-04 15:35:47,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2025-03-04 15:35:47,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2025-03-04 15:35:47,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1485 states and 2632 transitions. [2025-03-04 15:35:47,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:47,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1485 states and 2632 transitions. [2025-03-04 15:35:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states and 2632 transitions. [2025-03-04 15:35:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1312. [2025-03-04 15:35:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 804 states have (on average 1.13681592039801) internal successors, (914), 779 states have internal predecessors, (914), 307 states have call successors, (307), 147 states have call predecessors, (307), 201 states have return successors, (1161), 385 states have call predecessors, (1161), 303 states have call successors, (1161) [2025-03-04 15:35:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2382 transitions. [2025-03-04 15:35:47,175 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1312 states and 2382 transitions. [2025-03-04 15:35:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:47,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:35:47,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:35:47,175 INFO L87 Difference]: Start difference. First operand 1312 states and 2382 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:35:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:47,205 INFO L93 Difference]: Finished difference Result 996 states and 1780 transitions. [2025-03-04 15:35:47,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 996 states and 1780 transitions. [2025-03-04 15:35:47,211 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2025-03-04 15:35:47,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 996 states to 939 states and 1721 transitions. [2025-03-04 15:35:47,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 271 [2025-03-04 15:35:47,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 271 [2025-03-04 15:35:47,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 939 states and 1721 transitions. [2025-03-04 15:35:47,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:47,221 INFO L218 hiAutomatonCegarLoop]: Abstraction has 939 states and 1721 transitions. [2025-03-04 15:35:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states and 1721 transitions. [2025-03-04 15:35:47,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 936. [2025-03-04 15:35:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 574 states have (on average 1.1306620209059233) internal successors, (649), 554 states have internal predecessors, (649), 220 states have call successors, (220), 107 states have call predecessors, (220), 142 states have return successors, (849), 274 states have call predecessors, (849), 216 states have call successors, (849) [2025-03-04 15:35:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1718 transitions. [2025-03-04 15:35:47,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 936 states and 1718 transitions. [2025-03-04 15:35:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:35:47,245 INFO L432 stractBuchiCegarLoop]: Abstraction has 936 states and 1718 transitions. [2025-03-04 15:35:47,245 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:35:47,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 936 states and 1718 transitions. [2025-03-04 15:35:47,248 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 77 [2025-03-04 15:35:47,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:47,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:47,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:47,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:35:47,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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< [2025-03-04 15:35:47,249 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< [2025-03-04 15:35:47,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash 623152882, now seen corresponding path program 1 times [2025-03-04 15:35:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:47,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333412296] [2025-03-04 15:35:47,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:47,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:35:47,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:35:47,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:47,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:47,277 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:47,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:47,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333412296] [2025-03-04 15:35:47,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333412296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:47,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:47,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:35:47,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241934379] [2025-03-04 15:35:47,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:47,278 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:47,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash 33769, now seen corresponding path program 1 times [2025-03-04 15:35:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:47,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636855248] [2025-03-04 15:35:47,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:47,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:47,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:35:47,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:35:47,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:47,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:47,280 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:47,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:35:47,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:35:47,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:47,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:47,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:47,301 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:47,301 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:47,301 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:47,301 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:47,301 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:47,302 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,302 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:47,302 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:47,302 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2025-03-04 15:35:47,302 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:47,302 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:47,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,324 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:47,324 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,326 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:47,329 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:47,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:47,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:47,348 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:47,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,350 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:47,352 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:47,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:47,353 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:47,394 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:47,398 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:47,398 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:47,398 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:47,398 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:47,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:47,398 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:47,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:47,398 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:47,398 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2025-03-04 15:35:47,398 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:47,398 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:47,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:47,426 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:47,426 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:47,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,429 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:47,430 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:47,431 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,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:47,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:47,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:47,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:47,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:47,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:47,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:47,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:47,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:47,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,451 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:47,452 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:47,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:35:47,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:47,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:47,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:47,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:47,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:47,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:47,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:47,466 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:47,468 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:35:47,469 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:35:47,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:47,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,471 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:47,473 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:47,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:47,474 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:47,474 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:47,474 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2025-03-04 15:35:47,480 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:47,480 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:47,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:47,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:35:47,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:35:47,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:47,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:47,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:47,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:47,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:35:47,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:35:47,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:47,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:47,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:35:47,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:47,536 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:47,536 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:35:47,536 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 936 states and 1718 transitions. cyclomatic complexity: 799 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:47,572 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 936 states and 1718 transitions. cyclomatic complexity: 799. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 1163 states and 2144 transitions. Complement of second has 17 states. [2025-03-04 15:35:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:35:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2025-03-04 15:35:47,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 11 letters. Loop has 3 letters. [2025-03-04 15:35:47,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:47,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:35:47,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:47,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-04 15:35:47,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:47,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1163 states and 2144 transitions. [2025-03-04 15:35:47,581 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 77 [2025-03-04 15:35:47,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1163 states to 1063 states and 2006 transitions. [2025-03-04 15:35:47,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2025-03-04 15:35:47,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2025-03-04 15:35:47,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1063 states and 2006 transitions. [2025-03-04 15:35:47,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:47,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1063 states and 2006 transitions. [2025-03-04 15:35:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states and 2006 transitions. [2025-03-04 15:35:47,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1057. [2025-03-04 15:35:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 651 states have (on average 1.141321044546851) internal successors, (743), 642 states have internal predecessors, (743), 252 states have call successors, (252), 130 states have call predecessors, (252), 154 states have return successors, (987), 284 states have call predecessors, (987), 248 states have call successors, (987) [2025-03-04 15:35:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1982 transitions. [2025-03-04 15:35:47,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1057 states and 1982 transitions. [2025-03-04 15:35:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:47,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:35:47,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:35:47,614 INFO L87 Difference]: Start difference. First operand 1057 states and 1982 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:47,656 INFO L93 Difference]: Finished difference Result 1077 states and 1997 transitions. [2025-03-04 15:35:47,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1077 states and 1997 transitions. [2025-03-04 15:35:47,689 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 77 [2025-03-04 15:35:47,691 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:47,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1077 states to 1077 states and 1997 transitions. [2025-03-04 15:35:47,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 280 [2025-03-04 15:35:47,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 280 [2025-03-04 15:35:47,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1077 states and 1997 transitions. [2025-03-04 15:35:47,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:47,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1077 states and 1997 transitions. [2025-03-04 15:35:47,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states and 1997 transitions. [2025-03-04 15:35:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1067. [2025-03-04 15:35:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 660 states have (on average 1.1393939393939394) internal successors, (752), 649 states have internal predecessors, (752), 250 states have call successors, (250), 133 states have call predecessors, (250), 157 states have return successors, (985), 284 states have call predecessors, (985), 246 states have call successors, (985) [2025-03-04 15:35:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1987 transitions. [2025-03-04 15:35:47,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1067 states and 1987 transitions. [2025-03-04 15:35:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:35:47,724 INFO L432 stractBuchiCegarLoop]: Abstraction has 1067 states and 1987 transitions. [2025-03-04 15:35:47,724 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 15:35:47,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1067 states and 1987 transitions. [2025-03-04 15:35:47,729 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 77 [2025-03-04 15:35:47,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:47,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:47,729 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:47,729 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:47,729 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:47,730 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:47,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1480750595, now seen corresponding path program 2 times [2025-03-04 15:35:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306197358] [2025-03-04 15:35:47,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:47,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 15:35:47,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:35:47,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:47,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:35:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306197358] [2025-03-04 15:35:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306197358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013169906] [2025-03-04 15:35:47,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:47,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:47,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:47,778 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:47,780 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:47,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 15:35:47,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:35:47,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:47,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:47,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:35:47,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:35:47,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:35:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013169906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:47,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 15:35:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809600292] [2025-03-04 15:35:47,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:47,920 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:47,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:47,920 INFO L85 PathProgramCache]: Analyzing trace with hash -171517548, now seen corresponding path program 5 times [2025-03-04 15:35:47,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:47,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029049765] [2025-03-04 15:35:47,920 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:35:47,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:47,924 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 11 equivalence classes. [2025-03-04 15:35:47,929 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:35:47,930 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:35:47,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 90 proven. 100 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 15:35:48,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:48,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029049765] [2025-03-04 15:35:48,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029049765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:48,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975899052] [2025-03-04 15:35:48,120 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:35:48,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:48,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:48,122 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:48,123 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:48,168 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 11 equivalence classes. [2025-03-04 15:35:48,183 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:35:48,183 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:35:48,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:48,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:35:48,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 85 proven. 105 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 15:35:48,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 83 proven. 124 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 15:35:48,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975899052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:48,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:48,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 17] total 28 [2025-03-04 15:35:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358748555] [2025-03-04 15:35:48,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:48,929 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:48,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:48,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:35:48,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:35:48,930 INFO L87 Difference]: Start difference. First operand 1067 states and 1987 transitions. cyclomatic complexity: 945 Second operand has 11 states, 8 states have (on average 3.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 15:35:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:49,088 INFO L93 Difference]: Finished difference Result 1133 states and 2262 transitions. [2025-03-04 15:35:49,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1133 states and 2262 transitions. [2025-03-04 15:35:49,096 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 109 [2025-03-04 15:35:49,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1133 states to 1133 states and 2262 transitions. [2025-03-04 15:35:49,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 314 [2025-03-04 15:35:49,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2025-03-04 15:35:49,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1133 states and 2262 transitions. [2025-03-04 15:35:49,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:49,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1133 states and 2262 transitions. [2025-03-04 15:35:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states and 2262 transitions. [2025-03-04 15:35:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2025-03-04 15:35:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 680 states have (on average 1.1411764705882352) internal successors, (776), 669 states have internal predecessors, (776), 294 states have call successors, (294), 133 states have call predecessors, (294), 157 states have return successors, (1189), 328 states have call predecessors, (1189), 290 states have call successors, (1189) [2025-03-04 15:35:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 2259 transitions. [2025-03-04 15:35:49,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1131 states and 2259 transitions. [2025-03-04 15:35:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:35:49,138 INFO L432 stractBuchiCegarLoop]: Abstraction has 1131 states and 2259 transitions. [2025-03-04 15:35:49,138 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 15:35:49,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1131 states and 2259 transitions. [2025-03-04 15:35:49,143 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 109 [2025-03-04 15:35:49,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:49,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:49,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:49,144 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:49,144 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:49,144 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:35:49,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1005543025, now seen corresponding path program 3 times [2025-03-04 15:35:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:49,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928025134] [2025-03-04 15:35:49,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:49,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes. [2025-03-04 15:35:49,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:35:49,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 15:35:49,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:35:49,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:49,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928025134] [2025-03-04 15:35:49,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928025134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:49,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389672725] [2025-03-04 15:35:49,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:49,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:49,201 INFO L229 MonitoredProcess]: Starting monitored process 54 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,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-03-04 15:35:49,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes. [2025-03-04 15:35:49,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:35:49,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 15:35:49,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:49,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:49,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:35:49,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:35:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389672725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:49,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:49,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2025-03-04 15:35:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139163831] [2025-03-04 15:35:49,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:49,330 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:35:49,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash -502880786, now seen corresponding path program 6 times [2025-03-04 15:35:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:49,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881674191] [2025-03-04 15:35:49,331 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:35:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:49,337 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 74 statements into 14 equivalence classes. [2025-03-04 15:35:49,350 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 15:35:49,350 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-03-04 15:35:49,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 112 proven. 136 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 15:35:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881674191] [2025-03-04 15:35:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881674191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034539187] [2025-03-04 15:35:49,562 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:35:49,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:49,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:49,579 INFO L229 MonitoredProcess]: Starting monitored process 55 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,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-03-04 15:35:49,643 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 74 statements into 14 equivalence classes. [2025-03-04 15:35:49,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 15:35:49,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-03-04 15:35:49,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:49,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:35:49,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 72 proven. 158 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-04 15:35:49,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 70 proven. 194 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:35:50,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034539187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:50,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:50,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 23] total 35 [2025-03-04 15:35:50,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919686136] [2025-03-04 15:35:50,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:50,949 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:50,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:50,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:35:50,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:35:50,949 INFO L87 Difference]: Start difference. First operand 1131 states and 2259 transitions. cyclomatic complexity: 1154 Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 15:35:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:51,031 INFO L93 Difference]: Finished difference Result 1177 states and 2368 transitions. [2025-03-04 15:35:51,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1177 states and 2368 transitions. [2025-03-04 15:35:51,038 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 120 [2025-03-04 15:35:51,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1177 states to 1177 states and 2368 transitions. [2025-03-04 15:35:51,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2025-03-04 15:35:51,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 330 [2025-03-04 15:35:51,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1177 states and 2368 transitions. [2025-03-04 15:35:51,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:51,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1177 states and 2368 transitions. [2025-03-04 15:35:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states and 2368 transitions. [2025-03-04 15:35:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1141. [2025-03-04 15:35:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 680 states have (on average 1.1411764705882352) internal successors, (776), 673 states have internal predecessors, (776), 304 states have call successors, (304), 133 states have call predecessors, (304), 157 states have return successors, (1211), 334 states have call predecessors, (1211), 300 states have call successors, (1211) [2025-03-04 15:35:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 2291 transitions. [2025-03-04 15:35:51,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1141 states and 2291 transitions. [2025-03-04 15:35:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:35:51,108 INFO L432 stractBuchiCegarLoop]: Abstraction has 1141 states and 2291 transitions. [2025-03-04 15:35:51,108 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 15:35:51,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1141 states and 2291 transitions. [2025-03-04 15:35:51,111 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 111 [2025-03-04 15:35:51,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:51,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:51,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:51,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:35:51,112 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< [2025-03-04 15:35:51,112 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< [2025-03-04 15:35:51,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash -919401685, now seen corresponding path program 1 times [2025-03-04 15:35:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938161287] [2025-03-04 15:35:51,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:51,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:35:51,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:35:51,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:51,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:35:51,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [28635631] [2025-03-04 15:35:51,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:51,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:51,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,121 INFO L229 MonitoredProcess]: Starting monitored process 56 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:51,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-03-04 15:35:51,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:35:51,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:35:51,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:51,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:51,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:51,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:35:51,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:35:51,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:51,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:51,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:51,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash 33769, now seen corresponding path program 2 times [2025-03-04 15:35:51,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:51,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210837787] [2025-03-04 15:35:51,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:51,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:35:51,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:35:51,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:51,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:51,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:51,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:35:51,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:35:51,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:51,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:51,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:51,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash -889147265, now seen corresponding path program 2 times [2025-03-04 15:35:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:51,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238787705] [2025-03-04 15:35:51,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:51,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 15:35:51,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 15:35:51,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:51,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 15:35:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:51,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238787705] [2025-03-04 15:35:51,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238787705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:51,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488327897] [2025-03-04 15:35:51,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:51,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:51,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,305 INFO L229 MonitoredProcess]: Starting monitored process 57 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:51,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-03-04 15:35:51,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 15:35:51,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 15:35:51,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:51,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:51,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:35:51,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 15:35:51,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 15:35:51,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488327897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:51,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:51,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2025-03-04 15:35:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945333197] [2025-03-04 15:35:51,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:51,512 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:51,512 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:51,512 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:51,512 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:51,512 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:35:51,512 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,512 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:51,512 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:51,512 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2025-03-04 15:35:51,512 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:51,512 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:51,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:51,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:51,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:51,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:51,534 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:51,534 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:35:51,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,537 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:51,539 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:51,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:51,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:51,552 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:51,552 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:51,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:51,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,560 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:51,561 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:51,563 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:51,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:51,574 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:51,574 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:51,580 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:51,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,582 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:51,584 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:51,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:51,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:51,596 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:35:51,596 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:35:51,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:51,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,605 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:51,607 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:51,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:35:51,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:51,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:51,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,627 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:35:51,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 15:35:51,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:35:51,629 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:35:51,669 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:35:51,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-04 15:35:51,674 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:35:51,674 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:35:51,674 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:35:51,675 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:35:51,675 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:35:51,675 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,675 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:35:51,675 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:35:51,675 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2025-03-04 15:35:51,675 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:35:51,675 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:35:51,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:51,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:51,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:51,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:35:51,703 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:35:51,704 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:35:51,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,706 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:51,706 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:51,707 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:51,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:51,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:51,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:51,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:51,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:51,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:51,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:51,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:51,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 15:35:51,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,725 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:51,726 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:51,727 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:51,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:51,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:51,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:51,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:51,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:51,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:51,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:51,738 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:51,743 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:51,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,745 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:51,746 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:51,747 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:51,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:51,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:51,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:51,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:51,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:51,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:51,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:51,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:35:51,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 15:35:51,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,765 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:51,766 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:51,767 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:51,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:35:51,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:35:51,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:35:51,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:35:51,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:35:51,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:35:51,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:35:51,779 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:35:51,780 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:35:51,780 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:35:51,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:51,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:51,783 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:51,784 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:51,785 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:35:51,785 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:35:51,785 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:35:51,785 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2025-03-04 15:35:51,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 15:35:51,791 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:35:51,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:51,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:35:51,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:35:51,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:51,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:51,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:35:51,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:51,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:35:51,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:35:51,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:51,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:51,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:35:51,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:52,008 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:52,008 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-04 15:35:52,008 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1141 states and 2291 transitions. cyclomatic complexity: 1176 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 15:35:52,078 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1141 states and 2291 transitions. cyclomatic complexity: 1176. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 1198 states and 2366 transitions. Complement of second has 17 states. [2025-03-04 15:35:52,078 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:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 15:35:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2025-03-04 15:35:52,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 47 letters. Loop has 3 letters. [2025-03-04 15:35:52,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:52,079 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:35:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:52,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:35:52,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:35:52,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:52,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:52,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:35:52,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:52,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:35:52,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:35:52,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:52,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:52,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:35:52,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:52,288 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:52,288 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-04 15:35:52,288 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1141 states and 2291 transitions. cyclomatic complexity: 1176 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 15:35:52,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1141 states and 2291 transitions. cyclomatic complexity: 1176. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 1198 states and 2366 transitions. Complement of second has 17 states. [2025-03-04 15:35:52,357 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:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 15:35:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2025-03-04 15:35:52,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 47 letters. Loop has 3 letters. [2025-03-04 15:35:52,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:52,358 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:35:52,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:52,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:35:52,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:35:52,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:52,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:52,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:35:52,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:52,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-04 15:35:52,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:35:52,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:35:52,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:52,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:52,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:35:52,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:52,621 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:52,622 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-04 15:35:52,622 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1141 states and 2291 transitions. cyclomatic complexity: 1176 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 15:35:52,702 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1141 states and 2291 transitions. cyclomatic complexity: 1176. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 1386 states and 2632 transitions. Complement of second has 19 states. [2025-03-04 15:35:52,703 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:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 15:35:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2025-03-04 15:35:52,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 47 letters. Loop has 3 letters. [2025-03-04 15:35:52,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:52,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 50 letters. Loop has 3 letters. [2025-03-04 15:35:52,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:52,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 47 letters. Loop has 6 letters. [2025-03-04 15:35:52,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:35:52,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1386 states and 2632 transitions. [2025-03-04 15:35:52,714 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 105 [2025-03-04 15:35:52,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1386 states to 1183 states and 2372 transitions. [2025-03-04 15:35:52,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2025-03-04 15:35:52,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2025-03-04 15:35:52,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1183 states and 2372 transitions. [2025-03-04 15:35:52,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:52,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1183 states and 2372 transitions. [2025-03-04 15:35:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states and 2372 transitions. [2025-03-04 15:35:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1135. [2025-03-04 15:35:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 685 states have (on average 1.143065693430657) internal successors, (783), 672 states have internal predecessors, (783), 292 states have call successors, (292), 140 states have call predecessors, (292), 158 states have return successors, (1184), 322 states have call predecessors, (1184), 292 states have call successors, (1184) [2025-03-04 15:35:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2259 transitions. [2025-03-04 15:35:52,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1135 states and 2259 transitions. [2025-03-04 15:35:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:52,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:35:52,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:35:52,766 INFO L87 Difference]: Start difference. First operand 1135 states and 2259 transitions. Second operand has 13 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-04 15:35:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:52,948 INFO L93 Difference]: Finished difference Result 1729 states and 3505 transitions. [2025-03-04 15:35:52,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1729 states and 3505 transitions. [2025-03-04 15:35:52,962 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 161 [2025-03-04 15:35:52,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1729 states to 1683 states and 3459 transitions. [2025-03-04 15:35:52,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2025-03-04 15:35:52,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2025-03-04 15:35:52,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1683 states and 3459 transitions. [2025-03-04 15:35:52,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:52,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1683 states and 3459 transitions. [2025-03-04 15:35:52,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states and 3459 transitions. [2025-03-04 15:35:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1415. [2025-03-04 15:35:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 841 states have (on average 1.140309155766944) internal successors, (959), 842 states have internal predecessors, (959), 384 states have call successors, (384), 172 states have call predecessors, (384), 190 states have return successors, (1436), 400 states have call predecessors, (1436), 384 states have call successors, (1436) [2025-03-04 15:35:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2779 transitions. [2025-03-04 15:35:53,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1415 states and 2779 transitions. [2025-03-04 15:35:53,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:35:53,022 INFO L432 stractBuchiCegarLoop]: Abstraction has 1415 states and 2779 transitions. [2025-03-04 15:35:53,022 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-04 15:35:53,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1415 states and 2779 transitions. [2025-03-04 15:35:53,026 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2025-03-04 15:35:53,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:53,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:53,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:53,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 12, 12, 12, 12, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:53,027 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-04 15:35:53,027 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" [2025-03-04 15:35:53,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1146062653, now seen corresponding path program 1 times [2025-03-04 15:35:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:53,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027754014] [2025-03-04 15:35:53,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:53,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:53,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 15:35:53,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:35:53,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:53,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:35:53,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371867110] [2025-03-04 15:35:53,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:53,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:53,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:53,039 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:53,041 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:53,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 15:35:53,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:35:53,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:53,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:53,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:53,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 15:35:53,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 15:35:53,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:53,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:53,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:53,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:53,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2087083786, now seen corresponding path program 1 times [2025-03-04 15:35:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:53,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629563881] [2025-03-04 15:35:53,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:53,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 15:35:53,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 15:35:53,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:53,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 61 proven. 64 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2025-03-04 15:35:53,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629563881] [2025-03-04 15:35:53,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629563881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586061194] [2025-03-04 15:35:53,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:53,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:53,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:53,243 INFO L229 MonitoredProcess]: Starting monitored process 69 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:53,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-03-04 15:35:53,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 15:35:53,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 15:35:53,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:53,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:53,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:35:53,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 348 proven. 182 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-03-04 15:35:53,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 48 proven. 308 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-03-04 15:35:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586061194] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:54,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:54,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 18] total 29 [2025-03-04 15:35:54,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72633707] [2025-03-04 15:35:54,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:54,094 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:54,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 15:35:54,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2025-03-04 15:35:54,095 INFO L87 Difference]: Start difference. First operand 1415 states and 2779 transitions. cyclomatic complexity: 1390 Second operand has 29 states, 23 states have (on average 2.869565217391304) internal successors, (66), 27 states have internal predecessors, (66), 18 states have call successors, (26), 2 states have call predecessors, (26), 8 states have return successors, (29), 14 states have call predecessors, (29), 18 states have call successors, (29) [2025-03-04 15:35:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:55,020 INFO L93 Difference]: Finished difference Result 2054 states and 4572 transitions. [2025-03-04 15:35:55,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2054 states and 4572 transitions. [2025-03-04 15:35:55,034 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 351 [2025-03-04 15:35:55,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2054 states to 1841 states and 3948 transitions. [2025-03-04 15:35:55,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 592 [2025-03-04 15:35:55,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 593 [2025-03-04 15:35:55,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1841 states and 3948 transitions. [2025-03-04 15:35:55,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:55,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1841 states and 3948 transitions. [2025-03-04 15:35:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states and 3948 transitions. [2025-03-04 15:35:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1606. [2025-03-04 15:35:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 933 states have (on average 1.1221864951768488) internal successors, (1047), 929 states have internal predecessors, (1047), 492 states have call successors, (492), 174 states have call predecessors, (492), 181 states have return successors, (1910), 502 states have call predecessors, (1910), 492 states have call successors, (1910) [2025-03-04 15:35:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 3449 transitions. [2025-03-04 15:35:55,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1606 states and 3449 transitions. [2025-03-04 15:35:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 15:35:55,111 INFO L432 stractBuchiCegarLoop]: Abstraction has 1606 states and 3449 transitions. [2025-03-04 15:35:55,111 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-04 15:35:55,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1606 states and 3449 transitions. [2025-03-04 15:35:55,116 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 290 [2025-03-04 15:35:55,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:55,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:55,121 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:55,121 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [29, 29, 20, 20, 20, 20, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:55,121 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-04 15:35:55,121 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-04 15:35:55,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1380587932, now seen corresponding path program 2 times [2025-03-04 15:35:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:55,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032240614] [2025-03-04 15:35:55,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:55,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 15:35:55,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:35:55,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:55,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:35:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685191230] [2025-03-04 15:35:55,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:55,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:55,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:55,141 INFO L229 MonitoredProcess]: Starting monitored process 70 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,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-03-04 15:35:55,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 15:35:55,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:35:55,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:55,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:55,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:55,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:35:55,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:35:55,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:55,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:55,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:55,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1373324607, now seen corresponding path program 2 times [2025-03-04 15:35:55,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:55,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701392980] [2025-03-04 15:35:55,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:55,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-03-04 15:35:55,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 15:35:55,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:55,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2021 backedges. 309 proven. 234 refuted. 0 times theorem prover too weak. 1478 trivial. 0 not checked. [2025-03-04 15:35:55,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:55,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701392980] [2025-03-04 15:35:55,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701392980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:55,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140464942] [2025-03-04 15:35:55,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:55,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:55,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:55,529 INFO L229 MonitoredProcess]: Starting monitored process 71 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,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-03-04 15:35:55,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-03-04 15:35:55,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 15:35:55,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:55,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:55,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:35:55,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2021 backedges. 1275 proven. 78 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2025-03-04 15:35:55,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2021 backedges. 387 proven. 352 refuted. 0 times theorem prover too weak. 1282 trivial. 0 not checked. [2025-03-04 15:35:56,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140464942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:56,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:56,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 20] total 30 [2025-03-04 15:35:56,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124907824] [2025-03-04 15:35:56,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:56,331 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:56,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:56,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 15:35:56,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2025-03-04 15:35:56,332 INFO L87 Difference]: Start difference. First operand 1606 states and 3449 transitions. cyclomatic complexity: 1873 Second operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 28 states have internal predecessors, (71), 18 states have call successors, (28), 2 states have call predecessors, (28), 9 states have return successors, (33), 14 states have call predecessors, (33), 18 states have call successors, (33) [2025-03-04 15:35:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:57,300 INFO L93 Difference]: Finished difference Result 3444 states and 8606 transitions. [2025-03-04 15:35:57,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3444 states and 8606 transitions. [2025-03-04 15:35:57,322 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 675 [2025-03-04 15:35:57,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3444 states to 3166 states and 7846 transitions. [2025-03-04 15:35:57,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1322 [2025-03-04 15:35:57,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1334 [2025-03-04 15:35:57,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3166 states and 7846 transitions. [2025-03-04 15:35:57,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:57,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3166 states and 7846 transitions. [2025-03-04 15:35:57,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states and 7846 transitions. [2025-03-04 15:35:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 2437. [2025-03-04 15:35:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 1399 states have (on average 1.1258041458184418) internal successors, (1575), 1366 states have internal predecessors, (1575), 863 states have call successors, (863), 187 states have call predecessors, (863), 175 states have return successors, (3387), 883 states have call predecessors, (3387), 863 states have call successors, (3387) [2025-03-04 15:35:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 5825 transitions. [2025-03-04 15:35:57,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2437 states and 5825 transitions. [2025-03-04 15:35:57,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 15:35:57,446 INFO L432 stractBuchiCegarLoop]: Abstraction has 2437 states and 5825 transitions. [2025-03-04 15:35:57,446 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-04 15:35:57,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2437 states and 5825 transitions. [2025-03-04 15:35:57,456 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 549 [2025-03-04 15:35:57,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:57,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:57,460 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:57,460 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [32, 32, 23, 23, 23, 23, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:57,460 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-04 15:35:57,460 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-04 15:35:57,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1380587932, now seen corresponding path program 3 times [2025-03-04 15:35:57,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:57,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679140498] [2025-03-04 15:35:57,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:57,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:57,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 8 equivalence classes. [2025-03-04 15:35:57,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:35:57,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 15:35:57,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:35:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364146321] [2025-03-04 15:35:57,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:57,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:57,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:57,487 INFO L229 MonitoredProcess]: Starting monitored process 72 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,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-03-04 15:35:57,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 8 equivalence classes. [2025-03-04 15:35:57,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:35:57,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 15:35:57,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:57,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:57,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:35:57,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:35:57,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:57,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:57,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:57,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1021846489, now seen corresponding path program 3 times [2025-03-04 15:35:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:57,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153162399] [2025-03-04 15:35:57,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:57,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 200 statements into 24 equivalence classes. [2025-03-04 15:35:57,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 82 of 200 statements. [2025-03-04 15:35:57,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:35:57,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2507 backedges. 459 proven. 152 refuted. 0 times theorem prover too weak. 1896 trivial. 0 not checked. [2025-03-04 15:35:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153162399] [2025-03-04 15:35:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153162399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10749334] [2025-03-04 15:35:57,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:57,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:57,782 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:57,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-03-04 15:35:57,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 200 statements into 24 equivalence classes. [2025-03-04 15:35:57,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 82 of 200 statements. [2025-03-04 15:35:57,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:35:57,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:57,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:35:57,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2507 backedges. 456 proven. 153 refuted. 0 times theorem prover too weak. 1898 trivial. 0 not checked. [2025-03-04 15:35:57,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2507 backedges. 456 proven. 158 refuted. 0 times theorem prover too weak. 1893 trivial. 0 not checked. [2025-03-04 15:35:58,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10749334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:58,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 19 [2025-03-04 15:35:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779060174] [2025-03-04 15:35:58,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:58,357 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:58,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:58,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:35:58,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:35:58,358 INFO L87 Difference]: Start difference. First operand 2437 states and 5825 transitions. cyclomatic complexity: 3425 Second operand has 20 states, 16 states have (on average 3.125) internal successors, (50), 19 states have internal predecessors, (50), 12 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-04 15:35:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:58,765 INFO L93 Difference]: Finished difference Result 3425 states and 8845 transitions. [2025-03-04 15:35:58,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3425 states and 8845 transitions. [2025-03-04 15:35:58,792 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 888 [2025-03-04 15:35:58,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3425 states to 3419 states and 8838 transitions. [2025-03-04 15:35:58,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1629 [2025-03-04 15:35:58,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1630 [2025-03-04 15:35:58,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3419 states and 8838 transitions. [2025-03-04 15:35:58,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:35:58,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3419 states and 8838 transitions. [2025-03-04 15:35:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states and 8838 transitions. [2025-03-04 15:35:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 2871. [2025-03-04 15:35:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 1648 states have (on average 1.1262135922330097) internal successors, (1856), 1606 states have internal predecessors, (1856), 1048 states have call successors, (1048), 189 states have call predecessors, (1048), 175 states have return successors, (4350), 1075 states have call predecessors, (4350), 1048 states have call successors, (4350) [2025-03-04 15:35:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 7254 transitions. [2025-03-04 15:35:58,952 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2871 states and 7254 transitions. [2025-03-04 15:35:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:35:58,953 INFO L432 stractBuchiCegarLoop]: Abstraction has 2871 states and 7254 transitions. [2025-03-04 15:35:58,953 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-04 15:35:58,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2871 states and 7254 transitions. [2025-03-04 15:35:58,962 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 691 [2025-03-04 15:35:58,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:58,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:58,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:58,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 28, 19, 19, 19, 19, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:35:58,964 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-04 15:35:58,964 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-04 15:35:58,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:58,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1380587932, now seen corresponding path program 4 times [2025-03-04 15:35:58,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:58,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588759570] [2025-03-04 15:35:58,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:58,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:58,969 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-03-04 15:35:58,973 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:35:58,973 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:35:58,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:35:58,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357945142] [2025-03-04 15:35:58,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:58,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:58,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:58,976 INFO L229 MonitoredProcess]: Starting monitored process 74 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,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-03-04 15:35:59,054 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-03-04 15:35:59,071 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:35:59,071 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:35:59,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:59,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:59,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:35:59,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:35:59,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:59,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:59,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:59,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1345238873, now seen corresponding path program 4 times [2025-03-04 15:35:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:59,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135733264] [2025-03-04 15:35:59,103 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:59,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:59,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 176 statements into 2 equivalence classes. [2025-03-04 15:35:59,114 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 15:35:59,114 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:35:59,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 194 proven. 291 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2025-03-04 15:35:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135733264] [2025-03-04 15:35:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135733264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827995578] [2025-03-04 15:35:59,238 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:59,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:59,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:59,240 INFO L229 MonitoredProcess]: Starting monitored process 75 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:59,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-03-04 15:35:59,324 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 176 statements into 2 equivalence classes. [2025-03-04 15:35:59,354 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 15:35:59,355 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:35:59,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:59,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:35:59,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 1217 proven. 79 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-04 15:35:59,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1871 backedges. 253 proven. 584 refuted. 0 times theorem prover too weak. 1034 trivial. 0 not checked. [2025-03-04 15:36:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827995578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:00,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:00,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 19] total 26 [2025-03-04 15:36:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720047637] [2025-03-04 15:36:00,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:00,424 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:00,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:36:00,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:36:00,424 INFO L87 Difference]: Start difference. First operand 2871 states and 7254 transitions. cyclomatic complexity: 4426 Second operand has 26 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 16 states have call successors, (27), 2 states have call predecessors, (27), 10 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2025-03-04 15:36:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:01,019 INFO L93 Difference]: Finished difference Result 3638 states and 8837 transitions. [2025-03-04 15:36:01,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3638 states and 8837 transitions. [2025-03-04 15:36:01,046 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 726 [2025-03-04 15:36:01,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3638 states to 3509 states and 8598 transitions. [2025-03-04 15:36:01,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1471 [2025-03-04 15:36:01,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1471 [2025-03-04 15:36:01,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3509 states and 8598 transitions. [2025-03-04 15:36:01,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:01,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3509 states and 8598 transitions. [2025-03-04 15:36:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states and 8598 transitions. [2025-03-04 15:36:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 2647. [2025-03-04 15:36:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 1483 states have (on average 1.1348617666891436) internal successors, (1683), 1449 states have internal predecessors, (1683), 985 states have call successors, (985), 211 states have call predecessors, (985), 179 states have return successors, (3795), 986 states have call predecessors, (3795), 985 states have call successors, (3795) [2025-03-04 15:36:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 6463 transitions. [2025-03-04 15:36:01,203 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2647 states and 6463 transitions. [2025-03-04 15:36:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:36:01,204 INFO L432 stractBuchiCegarLoop]: Abstraction has 2647 states and 6463 transitions. [2025-03-04 15:36:01,204 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-04 15:36:01,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2647 states and 6463 transitions. [2025-03-04 15:36:01,217 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 523 [2025-03-04 15:36:01,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:01,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:01,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:01,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:01,219 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:01,219 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:01,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash -101577552, now seen corresponding path program 1 times [2025-03-04 15:36:01,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:01,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414578607] [2025-03-04 15:36:01,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:01,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:01,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 15:36:01,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 15:36:01,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:01,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:36:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881057397] [2025-03-04 15:36:01,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:01,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:01,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:01,236 INFO L229 MonitoredProcess]: Starting monitored process 76 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:01,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-03-04 15:36:01,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 15:36:01,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 15:36:01,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:01,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:01,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:01,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 15:36:01,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 15:36:01,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:01,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:01,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:01,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:01,374 INFO L85 PathProgramCache]: Analyzing trace with hash 884907028, now seen corresponding path program 7 times [2025-03-04 15:36:01,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:01,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900823440] [2025-03-04 15:36:01,375 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:01,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:01,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 15:36:01,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 15:36:01,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:01,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:36:01,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861860050] [2025-03-04 15:36:01,387 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:01,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:01,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:01,389 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:36:01,391 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:36:01,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 15:36:01,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 15:36:01,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:01,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:01,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:01,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 15:36:01,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 15:36:01,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:01,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:01,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:01,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash 673899587, now seen corresponding path program 2 times [2025-03-04 15:36:01,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:01,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782367709] [2025-03-04 15:36:01,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:01,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:01,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 15:36:01,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 15:36:01,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:01,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 135 proven. 142 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2025-03-04 15:36:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782367709] [2025-03-04 15:36:02,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782367709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:02,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212460237] [2025-03-04 15:36:02,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:02,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:02,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:02,093 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:36:02,095 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:36:02,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 15:36:02,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 15:36:02,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:02,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:02,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:36:02,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 711 proven. 31 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-04 15:36:02,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 135 proven. 143 refuted. 0 times theorem prover too weak. 933 trivial. 0 not checked. [2025-03-04 15:36:02,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212460237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:02,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:02,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 16 [2025-03-04 15:36:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706395580] [2025-03-04 15:36:02,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:02,979 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:02,979 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:02,979 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:02,979 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:02,979 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:02,979 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:02,979 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:02,979 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:02,979 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2025-03-04 15:36:02,979 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:02,979 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:02,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:02,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,024 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:03,024 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:03,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,026 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-04 15:36:03,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,038 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,038 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-04 15:36:03,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,045 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-04 15:36:03,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,056 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,056 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-04 15:36:03,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,063 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-04 15:36:03,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,074 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,074 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-04 15:36:03,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,081 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-04 15:36:03,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,093 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,093 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-04 15:36:03,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,101 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-04 15:36:03,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,112 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,112 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-04 15:36:03,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,119 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:03,119 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:03,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,131 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,131 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=1} Honda state: {ULTIMATE.start_main_~n~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,136 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:03,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,138 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:03,139 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:03,141 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,141 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,158 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,158 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=7} Honda state: {ULTIMATE.start_main_~x~0#1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,163 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:03,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,165 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:03,166 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:03,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,167 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,177 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,177 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-04 15:36:03,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,184 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:03,185 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:03,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,196 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,196 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-04 15:36:03,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,203 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:03,204 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:03,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,215 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,215 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-04 15:36:03,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,222 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:03,223 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:03,224 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,224 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,234 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:03,234 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:03,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-04 15:36:03,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,241 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:03,242 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:03,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:03,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,264 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:03,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,267 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-04 15:36:03,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:03,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:03,279 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:03,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-03-04 15:36:03,284 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:03,284 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:03,284 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:03,284 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:03,285 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:03,285 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,285 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:03,285 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:03,285 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2025-03-04 15:36:03,285 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:03,285 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:03,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:03,331 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:03,331 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:03,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,334 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-04 15:36:03,336 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:03,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:03,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,354 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-04 15:36:03,356 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:03,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-04 15:36:03,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,374 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-04 15:36:03,375 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:03,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-03-04 15:36:03,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,394 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:03,395 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:03,396 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:03,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,413 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:03,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,415 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:03,415 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:03,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:36:03,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,432 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:03,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,435 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:03,435 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:03,436 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:03,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,452 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:03,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,455 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:03,455 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:03,456 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:03,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,472 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:03,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,474 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:03,474 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:03,476 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:03,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:03,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,494 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:03,498 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:03,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:03,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,514 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:03,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,516 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:03,517 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:03,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:03,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-04 15:36:03,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,536 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:03,537 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:03,538 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:03,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:03,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-03-04 15:36:03,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,556 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:03,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-04 15:36:03,557 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:03,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:03,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:03,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:03,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:03,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:03,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:03,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:03,569 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:03,570 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:03,570 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:03,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:03,573 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:03,573 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:03,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:03,574 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:03,576 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:03,576 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 13 Supporting invariants [] [2025-03-04 15:36:03,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-04 15:36:03,581 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:03,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:03,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 15:36:03,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 15:36:03,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:03,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:03,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:36:03,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:03,690 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:03,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 15:36:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 15:36:03,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:03,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:03,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 15:36:03,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-04 15:36:04,183 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2025-03-04 15:36:04,183 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2647 states and 6463 transitions. cyclomatic complexity: 3858 Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-04 15:36:04,565 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2647 states and 6463 transitions. cyclomatic complexity: 3858. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) Result 4690 states and 10555 transitions. Complement of second has 101 states. [2025-03-04 15:36:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 19 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-04 15:36:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 102 transitions. [2025-03-04 15:36:04,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 102 transitions. Stem has 58 letters. Loop has 92 letters. [2025-03-04 15:36:04,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:04,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 102 transitions. Stem has 150 letters. Loop has 92 letters. [2025-03-04 15:36:04,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:04,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 102 transitions. Stem has 58 letters. Loop has 184 letters. [2025-03-04 15:36:04,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:04,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4690 states and 10555 transitions. [2025-03-04 15:36:04,599 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 519 [2025-03-04 15:36:04,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4690 states to 3406 states and 8040 transitions. [2025-03-04 15:36:04,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1041 [2025-03-04 15:36:04,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1046 [2025-03-04 15:36:04,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3406 states and 8040 transitions. [2025-03-04 15:36:04,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:04,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3406 states and 8040 transitions. [2025-03-04 15:36:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states and 8040 transitions. [2025-03-04 15:36:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3158. [2025-03-04 15:36:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3158 states, 1796 states have (on average 1.1347438752783965) internal successors, (2038), 1764 states have internal predecessors, (2038), 1110 states have call successors, (1110), 264 states have call predecessors, (1110), 252 states have return successors, (4262), 1129 states have call predecessors, (4262), 1110 states have call successors, (4262) [2025-03-04 15:36:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 7410 transitions. [2025-03-04 15:36:04,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3158 states and 7410 transitions. [2025-03-04 15:36:04,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:04,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:36:04,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:36:04,719 INFO L87 Difference]: Start difference. First operand 3158 states and 7410 transitions. Second operand has 16 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 11 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2025-03-04 15:36:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:05,006 INFO L93 Difference]: Finished difference Result 4373 states and 10765 transitions. [2025-03-04 15:36:05,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4373 states and 10765 transitions. [2025-03-04 15:36:05,041 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 867 [2025-03-04 15:36:05,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4373 states to 4283 states and 10626 transitions. [2025-03-04 15:36:05,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1710 [2025-03-04 15:36:05,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1710 [2025-03-04 15:36:05,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4283 states and 10626 transitions. [2025-03-04 15:36:05,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:05,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4283 states and 10626 transitions. [2025-03-04 15:36:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4283 states and 10626 transitions. [2025-03-04 15:36:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4283 to 3281. [2025-03-04 15:36:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 1872 states have (on average 1.1351495726495726) internal successors, (2125), 1838 states have internal predecessors, (2125), 1157 states have call successors, (1157), 264 states have call predecessors, (1157), 252 states have return successors, (4398), 1178 states have call predecessors, (4398), 1157 states have call successors, (4398) [2025-03-04 15:36:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 7680 transitions. [2025-03-04 15:36:05,184 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3281 states and 7680 transitions. [2025-03-04 15:36:05,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:36:05,185 INFO L432 stractBuchiCegarLoop]: Abstraction has 3281 states and 7680 transitions. [2025-03-04 15:36:05,185 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-04 15:36:05,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3281 states and 7680 transitions. [2025-03-04 15:36:05,195 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 536 [2025-03-04 15:36:05,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:05,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:05,196 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:05,196 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 9, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:05,197 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-04 15:36:05,197 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" [2025-03-04 15:36:05,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:05,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1380587932, now seen corresponding path program 5 times [2025-03-04 15:36:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322572948] [2025-03-04 15:36:05,198 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:05,202 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 8 equivalence classes. [2025-03-04 15:36:05,208 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:36:05,208 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-04 15:36:05,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:36:05,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191449957] [2025-03-04 15:36:05,209 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:05,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:05,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,231 INFO L229 MonitoredProcess]: Starting monitored process 105 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,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2025-03-04 15:36:05,330 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 8 equivalence classes. [2025-03-04 15:36:05,350 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:36:05,351 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-04 15:36:05,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:05,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:36:05,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:36:05,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:05,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:05,377 INFO L85 PathProgramCache]: Analyzing trace with hash -164454119, now seen corresponding path program 5 times [2025-03-04 15:36:05,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778268821] [2025-03-04 15:36:05,377 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:05,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 104 statements into 12 equivalence classes. [2025-03-04 15:36:05,395 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 15:36:05,395 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-04 15:36:05,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 138 proven. 19 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-04 15:36:05,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778268821] [2025-03-04 15:36:05,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778268821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013985830] [2025-03-04 15:36:05,490 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:05,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:05,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,492 INFO L229 MonitoredProcess]: Starting monitored process 106 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,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2025-03-04 15:36:05,584 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 104 statements into 12 equivalence classes. [2025-03-04 15:36:05,616 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 15:36:05,616 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-04 15:36:05,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:05,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:36:05,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 110 proven. 52 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-04 15:36:05,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 110 proven. 53 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-04 15:36:05,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013985830] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:05,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:05,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 17 [2025-03-04 15:36:05,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756553560] [2025-03-04 15:36:05,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:05,883 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:05,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:05,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:36:05,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:36:05,883 INFO L87 Difference]: Start difference. First operand 3281 states and 7680 transitions. cyclomatic complexity: 4448 Second operand has 18 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-04 15:36:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:06,328 INFO L93 Difference]: Finished difference Result 4308 states and 10542 transitions. [2025-03-04 15:36:06,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4308 states and 10542 transitions. [2025-03-04 15:36:06,362 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 676 [2025-03-04 15:36:06,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4308 states to 4303 states and 10537 transitions. [2025-03-04 15:36:06,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1461 [2025-03-04 15:36:06,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1462 [2025-03-04 15:36:06,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4303 states and 10537 transitions. [2025-03-04 15:36:06,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:06,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4303 states and 10537 transitions. [2025-03-04 15:36:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states and 10537 transitions. [2025-03-04 15:36:06,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3682. [2025-03-04 15:36:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 2080 states have (on average 1.1466346153846154) internal successors, (2385), 2047 states have internal predecessors, (2385), 1346 states have call successors, (1346), 266 states have call predecessors, (1346), 256 states have return successors, (5133), 1368 states have call predecessors, (5133), 1346 states have call successors, (5133) [2025-03-04 15:36:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 8864 transitions. [2025-03-04 15:36:06,513 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3682 states and 8864 transitions. [2025-03-04 15:36:06,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:36:06,514 INFO L432 stractBuchiCegarLoop]: Abstraction has 3682 states and 8864 transitions. [2025-03-04 15:36:06,514 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-04 15:36:06,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3682 states and 8864 transitions. [2025-03-04 15:36:06,527 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 577 [2025-03-04 15:36:06,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:06,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:06,528 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 9, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:06,528 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 14, 14, 14, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:06,528 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:06,528 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:06,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1888081315, now seen corresponding path program 3 times [2025-03-04 15:36:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891359419] [2025-03-04 15:36:06,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:06,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 84 statements into 10 equivalence classes. [2025-03-04 15:36:06,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 43 of 84 statements. [2025-03-04 15:36:06,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:36:06,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 33 proven. 10 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-04 15:36:06,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:06,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891359419] [2025-03-04 15:36:06,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891359419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:06,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651539767] [2025-03-04 15:36:06,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:06,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:06,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,568 INFO L229 MonitoredProcess]: Starting monitored process 107 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:06,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-03-04 15:36:06,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 84 statements into 10 equivalence classes. [2025-03-04 15:36:06,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 43 of 84 statements. [2025-03-04 15:36:06,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:36:06,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 145 proven. 1 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-04 15:36:06,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 33 proven. 10 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-04 15:36:06,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651539767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:06,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:06,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-04 15:36:06,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24449757] [2025-03-04 15:36:06,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:06,779 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash 823385544, now seen corresponding path program 8 times [2025-03-04 15:36:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612536835] [2025-03-04 15:36:06,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-04 15:36:06,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 15:36:06,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:06,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:36:06,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370372126] [2025-03-04 15:36:06,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:06,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:06,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,792 INFO L229 MonitoredProcess]: Starting monitored process 108 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:06,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-03-04 15:36:06,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-04 15:36:06,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 15:36:06,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:06,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:06,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 15:36:07,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 15:36:07,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:07,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:07,647 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:07,647 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:07,647 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:07,648 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:07,648 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:07,648 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,648 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:07,648 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:07,648 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2025-03-04 15:36:07,648 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:07,648 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:07,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,695 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:07,695 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:07,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,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:07,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:07,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,709 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,709 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:07,715 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:07,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,717 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:07,718 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:07,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,729 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,729 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:07,734 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:07,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,736 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:07,737 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:07,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,748 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,748 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:07,753 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:07,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,755 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:07,756 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:07,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,757 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,773 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,773 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=8} Honda state: {ULTIMATE.start_main_~x~0#1=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:07,778 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:07,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,780 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:07,781 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:07,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,792 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,792 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:07,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:07,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,800 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:07,800 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:07,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,811 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,812 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:07,817 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:07,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,820 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:07,820 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:07,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,831 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,831 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:07,837 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:07,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,839 INFO L229 MonitoredProcess]: Starting monitored process 116 with /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:07,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-03-04 15:36:07,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,851 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,851 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:07,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-03-04 15:36:07,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,858 INFO L229 MonitoredProcess]: Starting monitored process 117 with /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:07,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-03-04 15:36:07,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,870 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,870 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:07,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:07,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,877 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-04 15:36:07,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,889 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,889 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:07,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:07,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,898 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-04 15:36:07,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-03-04 15:36:07,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,918 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-03-04 15:36:07,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:07,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,930 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:07,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-04 15:36:07,936 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:07,936 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:07,936 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:07,936 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:07,936 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:07,936 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,936 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:07,936 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:07,936 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2025-03-04 15:36:07,936 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:07,936 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:07,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,979 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:07,979 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:07,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,982 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-03-04 15:36:07,983 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:07,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:07,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:07,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:07,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:07,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:07,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:07,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:07,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-03-04 15:36:08,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,002 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-03-04 15:36:08,004 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,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-03-04 15:36:08,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,023 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:08,024 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:08,025 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,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,041 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:08,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,043 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:08,044 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:08,045 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,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,061 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:08,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,063 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:08,064 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:08,065 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,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:08,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,083 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:08,084 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:08,085 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,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,100 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:08,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,103 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:08,105 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:08,105 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,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,122 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:08,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,125 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-03-04 15:36:08,128 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,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:08,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,150 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:08,150 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:08,151 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,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,168 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:08,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,170 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:08,171 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:08,172 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,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:08,185 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:08,185 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:08,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,187 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:08,188 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:08,188 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:08,188 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:08,188 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:08,188 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 15 Supporting invariants [] [2025-03-04 15:36:08,194 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:08,194 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:08,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:08,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 15:36:08,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 15:36:08,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:36:08,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:08,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 15:36:08,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 15:36:08,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 15:36:08,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 0 proven. 391 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-03-04 15:36:08,871 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 14 loop predicates [2025-03-04 15:36:08,871 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3682 states and 8864 transitions. cyclomatic complexity: 5250 Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 15:36:09,280 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3682 states and 8864 transitions. cyclomatic complexity: 5250. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 7159 states and 16978 transitions. Complement of second has 113 states. [2025-03-04 15:36:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 21 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 15:36:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 111 transitions. [2025-03-04 15:36:09,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 111 transitions. Stem has 84 letters. Loop has 104 letters. [2025-03-04 15:36:09,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 111 transitions. Stem has 188 letters. Loop has 104 letters. [2025-03-04 15:36:09,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 111 transitions. Stem has 84 letters. Loop has 208 letters. [2025-03-04 15:36:09,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7159 states and 16978 transitions. [2025-03-04 15:36:09,357 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:09,376 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 577 [2025-03-04 15:36:09,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7159 states to 4791 states and 11730 transitions. [2025-03-04 15:36:09,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1197 [2025-03-04 15:36:09,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1203 [2025-03-04 15:36:09,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4791 states and 11730 transitions. [2025-03-04 15:36:09,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:09,438 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4791 states and 11730 transitions. [2025-03-04 15:36:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states and 11730 transitions. [2025-03-04 15:36:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 4328. [2025-03-04 15:36:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4328 states, 2460 states have (on average 1.1516260162601626) internal successors, (2833), 2431 states have internal predecessors, (2833), 1524 states have call successors, (1524), 324 states have call predecessors, (1524), 344 states have return successors, (5935), 1572 states have call predecessors, (5935), 1524 states have call successors, (5935) [2025-03-04 15:36:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4328 states to 4328 states and 10292 transitions. [2025-03-04 15:36:09,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4328 states and 10292 transitions. [2025-03-04 15:36:09,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:09,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:36:09,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:36:09,595 INFO L87 Difference]: Start difference. First operand 4328 states and 10292 transitions. Second operand has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 15:36:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:09,681 INFO L93 Difference]: Finished difference Result 4310 states and 10244 transitions. [2025-03-04 15:36:09,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4310 states and 10244 transitions. [2025-03-04 15:36:09,711 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 577 [2025-03-04 15:36:09,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4310 states to 4298 states and 10232 transitions. [2025-03-04 15:36:09,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1185 [2025-03-04 15:36:09,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1185 [2025-03-04 15:36:09,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4298 states and 10232 transitions. [2025-03-04 15:36:09,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:09,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4298 states and 10232 transitions. [2025-03-04 15:36:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states and 10232 transitions. [2025-03-04 15:36:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4294. [2025-03-04 15:36:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4294 states, 2442 states have (on average 1.1502866502866502) internal successors, (2809), 2411 states have internal predecessors, (2809), 1514 states have call successors, (1514), 318 states have call predecessors, (1514), 338 states have return successors, (5905), 1564 states have call predecessors, (5905), 1514 states have call successors, (5905) [2025-03-04 15:36:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 10228 transitions. [2025-03-04 15:36:09,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4294 states and 10228 transitions. [2025-03-04 15:36:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:36:09,844 INFO L432 stractBuchiCegarLoop]: Abstraction has 4294 states and 10228 transitions. [2025-03-04 15:36:09,844 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-04 15:36:09,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4294 states and 10228 transitions. [2025-03-04 15:36:09,858 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 577 [2025-03-04 15:36:09,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:09,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:09,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 8, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:09,860 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:09,860 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" [2025-03-04 15:36:09,860 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" [2025-03-04 15:36:09,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2052739414, now seen corresponding path program 6 times [2025-03-04 15:36:09,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:09,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997254367] [2025-03-04 15:36:09,860 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:09,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:09,865 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 101 statements into 8 equivalence classes. [2025-03-04 15:36:09,870 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 15:36:09,870 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 15:36:09,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 118 proven. 36 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-04 15:36:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997254367] [2025-03-04 15:36:09,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997254367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:09,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059736227] [2025-03-04 15:36:09,974 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:09,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:09,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:09,976 INFO L229 MonitoredProcess]: Starting monitored process 132 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:09,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2025-03-04 15:36:10,070 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 101 statements into 8 equivalence classes. [2025-03-04 15:36:10,098 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 15:36:10,098 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 15:36:10,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:10,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:36:10,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 207 proven. 22 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-04 15:36:10,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 151 proven. 43 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2025-03-04 15:36:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059736227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:10,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:10,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 19 [2025-03-04 15:36:10,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860679766] [2025-03-04 15:36:10,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:10,522 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:10,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash 30880440, now seen corresponding path program 4 times [2025-03-04 15:36:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:10,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254933535] [2025-03-04 15:36:10,523 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:10,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:10,526 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-03-04 15:36:10,528 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:36:10,528 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:10,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:36:10,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053513974] [2025-03-04 15:36:10,529 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:10,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:10,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:10,531 INFO L229 MonitoredProcess]: Starting monitored process 133 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,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2025-03-04 15:36:10,624 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-03-04 15:36:10,643 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:36:10,643 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:10,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:10,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:10,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:36:10,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:36:10,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:10,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:10,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:10,984 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:10,984 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:10,984 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:10,984 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:10,984 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:10,984 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:10,984 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:10,984 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:10,984 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration22_Loop [2025-03-04 15:36:10,984 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:10,984 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:10,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,048 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:11,048 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:11,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,051 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:11,051 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:11,052 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:11,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-03-04 15:36:11,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,071 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:11,071 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:11,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:11,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:11,254 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:11,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:11,260 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:11,260 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:11,260 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:11,260 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:11,260 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:11,260 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,260 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:11,260 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:11,260 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration22_Loop [2025-03-04 15:36:11,261 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:11,261 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:11,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:11,323 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:11,323 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:11,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,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:11,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:11,327 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,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:11,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:11,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:11,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:11,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:11,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:11,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:11,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:11,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,345 INFO L229 MonitoredProcess]: Starting monitored process 137 with /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,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-03-04 15:36:11,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:11,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:11,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:11,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:11,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:11,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:11,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:11,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:11,360 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:11,362 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:11,362 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:11,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:11,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:11,365 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:11,366 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:11,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:11,366 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:11,366 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:11,366 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_binomialCoefficient_~n#1, ULTIMATE.start_binomialCoefficient_~k#1) = -2*ULTIMATE.start_binomialCoefficient_~n#1 + 2*ULTIMATE.start_binomialCoefficient_~k#1 + 7 Supporting invariants [] [2025-03-04 15:36:11,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:11,372 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:11,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:11,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 15:36:11,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 15:36:11,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:11,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 15:36:11,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:11,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:36:11,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:36:11,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:11,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 15:36:11,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 47 proven. 105 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:36:12,059 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 14 loop predicates [2025-03-04 15:36:12,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4294 states and 10228 transitions. cyclomatic complexity: 6012 Second operand has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 8 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 12 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 15:36:12,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-03-04 15:36:13,199 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4294 states and 10228 transitions. cyclomatic complexity: 6012. Second operand has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 8 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 12 states have call predecessors, (18), 8 states have call successors, (18) Result 17025 states and 35593 transitions. Complement of second has 155 states. [2025-03-04 15:36:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 36 states 2 stem states 33 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 8 states have call successors, (13), 2 states have call predecessors, (13), 10 states have return successors, (18), 12 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-04 15:36:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 166 transitions. [2025-03-04 15:36:13,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 166 transitions. Stem has 101 letters. Loop has 62 letters. [2025-03-04 15:36:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:13,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 166 transitions. Stem has 163 letters. Loop has 62 letters. [2025-03-04 15:36:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:13,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 166 transitions. Stem has 101 letters. Loop has 124 letters. [2025-03-04 15:36:13,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:13,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17025 states and 35593 transitions. [2025-03-04 15:36:13,352 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1035 [2025-03-04 15:36:13,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17025 states to 15352 states and 32664 transitions. [2025-03-04 15:36:13,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2799 [2025-03-04 15:36:13,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2907 [2025-03-04 15:36:13,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15352 states and 32664 transitions. [2025-03-04 15:36:13,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:13,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15352 states and 32664 transitions. [2025-03-04 15:36:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15352 states and 32664 transitions. [2025-03-04 15:36:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15352 to 12805. [2025-03-04 15:36:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12805 states, 7402 states have (on average 1.1452310186436099) internal successors, (8477), 7320 states have internal predecessors, (8477), 4254 states have call successors, (4428), 1035 states have call predecessors, (4428), 1149 states have return successors, (14497), 4449 states have call predecessors, (14497), 4254 states have call successors, (14497) [2025-03-04 15:36:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12805 states to 12805 states and 27402 transitions. [2025-03-04 15:36:14,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12805 states and 27402 transitions. [2025-03-04 15:36:14,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:14,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:36:14,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:36:14,060 INFO L87 Difference]: Start difference. First operand 12805 states and 27402 transitions. Second operand has 19 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 12 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-04 15:36:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:14,635 INFO L93 Difference]: Finished difference Result 22855 states and 53098 transitions. [2025-03-04 15:36:14,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22855 states and 53098 transitions. [2025-03-04 15:36:14,834 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 2347 [2025-03-04 15:36:15,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22855 states to 20455 states and 47425 transitions. [2025-03-04 15:36:15,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5995 [2025-03-04 15:36:15,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5995 [2025-03-04 15:36:15,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20455 states and 47425 transitions. [2025-03-04 15:36:15,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:15,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20455 states and 47425 transitions. [2025-03-04 15:36:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20455 states and 47425 transitions. [2025-03-04 15:36:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20455 to 17969. [2025-03-04 15:36:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17969 states, 9977 states have (on average 1.1453342688182822) internal successors, (11427), 9818 states have internal predecessors, (11427), 7023 states have call successors, (7252), 885 states have call predecessors, (7252), 969 states have return successors, (23298), 7265 states have call predecessors, (23298), 7023 states have call successors, (23298) [2025-03-04 15:36:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17969 states to 17969 states and 41977 transitions. [2025-03-04 15:36:15,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17969 states and 41977 transitions. [2025-03-04 15:36:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 15:36:15,933 INFO L432 stractBuchiCegarLoop]: Abstraction has 17969 states and 41977 transitions. [2025-03-04 15:36:15,933 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-04 15:36:15,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17969 states and 41977 transitions. [2025-03-04 15:36:16,030 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 1990 [2025-03-04 15:36:16,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:16,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:16,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 12, 11, 11, 11, 11, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:36:16,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:16,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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:16,034 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:16,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1267006700, now seen corresponding path program 4 times [2025-03-04 15:36:16,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:16,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470908225] [2025-03-04 15:36:16,035 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:16,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:16,043 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 152 statements into 2 equivalence classes. [2025-03-04 15:36:16,050 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 15:36:16,050 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:36:16,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2025-03-04 15:36:16,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470908225] [2025-03-04 15:36:16,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470908225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:16,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:36:16,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116844909] [2025-03-04 15:36:16,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:16,113 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:16,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:16,113 INFO L85 PathProgramCache]: Analyzing trace with hash -277733612, now seen corresponding path program 9 times [2025-03-04 15:36:16,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:16,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384740061] [2025-03-04 15:36:16,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:16,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:16,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 16 equivalence classes. [2025-03-04 15:36:16,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 86 of 92 statements. [2025-03-04 15:36:16,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-04 15:36:16,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 203 proven. 183 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-04 15:36:16,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:16,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384740061] [2025-03-04 15:36:16,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384740061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:16,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837486497] [2025-03-04 15:36:16,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:16,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:16,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:16,327 INFO L229 MonitoredProcess]: Starting monitored process 139 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,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2025-03-04 15:36:16,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 16 equivalence classes. [2025-03-04 15:36:16,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 86 of 92 statements. [2025-03-04 15:36:16,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-04 15:36:16,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:16,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 15:36:16,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 130 proven. 242 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 15:36:16,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 127 proven. 309 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 15:36:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837486497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:18,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:18,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 27] total 33 [2025-03-04 15:36:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909393433] [2025-03-04 15:36:18,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:18,825 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:18,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 15:36:18,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 15:36:18,826 INFO L87 Difference]: Start difference. First operand 17969 states and 41977 transitions. cyclomatic complexity: 24383 Second operand has 33 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 18 states have call successors, (19), 1 states have call predecessors, (19), 13 states have return successors, (28), 17 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 15:36:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:20,057 INFO L93 Difference]: Finished difference Result 24325 states and 63656 transitions. [2025-03-04 15:36:20,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24325 states and 63656 transitions. [2025-03-04 15:36:20,304 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 2781 [2025-03-04 15:36:20,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24325 states to 23109 states and 61181 transitions. [2025-03-04 15:36:20,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6267 [2025-03-04 15:36:20,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6303 [2025-03-04 15:36:20,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23109 states and 61181 transitions. [2025-03-04 15:36:20,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:20,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23109 states and 61181 transitions. [2025-03-04 15:36:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23109 states and 61181 transitions. [2025-03-04 15:36:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23109 to 18091. [2025-03-04 15:36:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18091 states, 9890 states have (on average 1.1419615773508593) internal successors, (11294), 9718 states have internal predecessors, (11294), 7254 states have call successors, (7385), 889 states have call predecessors, (7385), 947 states have return successors, (26712), 7483 states have call predecessors, (26712), 7254 states have call successors, (26712) [2025-03-04 15:36:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18091 states to 18091 states and 45391 transitions. [2025-03-04 15:36:21,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18091 states and 45391 transitions. [2025-03-04 15:36:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 15:36:21,525 INFO L432 stractBuchiCegarLoop]: Abstraction has 18091 states and 45391 transitions. [2025-03-04 15:36:21,525 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-04 15:36:21,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18091 states and 45391 transitions. [2025-03-04 15:36:21,652 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 2100 [2025-03-04 15:36:21,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:21,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:21,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:21,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 16, 16, 16, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:21,654 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:21,654 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:21,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash 913580727, now seen corresponding path program 5 times [2025-03-04 15:36:21,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:21,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114565699] [2025-03-04 15:36:21,656 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:21,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:21,665 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 10 equivalence classes. [2025-03-04 15:36:21,677 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 96 of 102 statements. [2025-03-04 15:36:21,677 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-04 15:36:21,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 69 proven. 80 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-04 15:36:21,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:21,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114565699] [2025-03-04 15:36:21,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114565699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218509738] [2025-03-04 15:36:21,924 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:21,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:21,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:21,931 INFO L229 MonitoredProcess]: Starting monitored process 140 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:21,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2025-03-04 15:36:22,108 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 10 equivalence classes. [2025-03-04 15:36:22,135 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 96 of 102 statements. [2025-03-04 15:36:22,136 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-04 15:36:22,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:22,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:36:22,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 143 proven. 11 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-04 15:36:22,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-04 15:36:22,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218509738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:22,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:22,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 22 [2025-03-04 15:36:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513574262] [2025-03-04 15:36:22,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:22,492 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:22,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash 33171860, now seen corresponding path program 10 times [2025-03-04 15:36:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:22,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591932364] [2025-03-04 15:36:22,492 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:22,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:22,499 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-04 15:36:22,506 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 15:36:22,506 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:22,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:36:22,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425604025] [2025-03-04 15:36:22,507 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:22,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:22,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:22,512 INFO L229 MonitoredProcess]: Starting monitored process 141 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:22,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2025-03-04 15:36:22,643 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-04 15:36:22,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 15:36:22,759 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:22,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:22,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:22,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 15:36:22,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 15:36:22,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:22,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:23,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:23,503 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:23,503 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:23,503 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:23,503 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:23,503 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:23,503 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,503 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:23,503 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:23,503 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2025-03-04 15:36:23,503 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:23,503 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:23,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,549 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:23,549 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:23,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,552 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:23,553 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:23,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:23,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:23,565 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:23,565 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9#1=0} Honda state: {ULTIMATE.start_main_#t~post9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:23,571 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:23,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,573 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:23,574 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:23,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:23,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:23,585 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:23,585 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:23,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2025-03-04 15:36:23,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,592 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:23,594 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:23,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:23,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:23,605 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:23,606 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:23,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:23,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,613 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:23,614 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:23,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:23,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:23,625 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:23,625 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:23,630 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:23,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,633 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:23,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-03-04 15:36:23,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:23,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:23,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-03-04 15:36:23,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,653 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:23,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-03-04 15:36:23,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:23,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:23,665 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:23,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-03-04 15:36:23,671 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:23,671 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:23,671 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:23,671 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:23,671 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:23,671 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,671 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:23,671 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:23,671 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2025-03-04 15:36:23,671 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:23,671 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:23,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:23,720 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:23,720 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:23,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,722 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:23,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-03-04 15:36:23,725 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:23,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:23,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:23,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:23,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:23,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:23,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:23,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:23,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:23,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-03-04 15:36:23,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,743 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:23,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-04 15:36:23,744 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:23,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:23,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:23,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:23,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:23,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:23,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:23,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:23,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:23,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-03-04 15:36:23,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,763 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:23,764 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:23,765 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:23,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:23,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:23,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:23,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:23,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:23,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:23,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:23,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:23,781 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:23,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,783 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:23,784 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:23,784 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:23,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:23,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:23,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:23,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:23,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:23,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:23,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:23,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:23,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:23,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,802 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:23,803 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:23,804 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:23,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:23,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:23,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:23,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:23,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:23,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:23,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:23,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:23,820 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:23,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,822 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:23,823 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:23,823 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:23,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:23,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:23,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:23,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:23,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:23,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:23,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:23,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:23,840 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:23,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,842 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:23,842 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:23,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:23,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:23,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:23,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:23,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:23,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:23,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:23,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:23,855 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:23,856 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:23,856 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:23,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:23,858 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:23,860 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:23,860 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:23,860 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:23,860 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:23,860 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 17 Supporting invariants [] [2025-03-04 15:36:23,865 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:23,865 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:23,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:23,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 15:36:23,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 15:36:23,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:23,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:23,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 15:36:23,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:24,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 15:36:24,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 15:36:24,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:24,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:24,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-04 15:36:24,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-04 15:36:24,736 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2025-03-04 15:36:24,736 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18091 states and 45391 transitions. cyclomatic complexity: 27664 Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-04 15:36:25,350 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:25,495 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18091 states and 45391 transitions. cyclomatic complexity: 27664. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) Result 28172 states and 64199 transitions. Complement of second has 125 states. [2025-03-04 15:36:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 23 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-04 15:36:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 119 transitions. [2025-03-04 15:36:25,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 119 transitions. Stem has 102 letters. Loop has 116 letters. [2025-03-04 15:36:25,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:25,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 119 transitions. Stem has 218 letters. Loop has 116 letters. [2025-03-04 15:36:25,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:25,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 119 transitions. Stem has 102 letters. Loop has 232 letters. [2025-03-04 15:36:25,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:25,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28172 states and 64199 transitions. [2025-03-04 15:36:25,724 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 2100 [2025-03-04 15:36:25,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28172 states to 21255 states and 51762 transitions. [2025-03-04 15:36:25,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4981 [2025-03-04 15:36:25,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4992 [2025-03-04 15:36:25,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21255 states and 51762 transitions. [2025-03-04 15:36:25,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:25,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21255 states and 51762 transitions. [2025-03-04 15:36:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21255 states and 51762 transitions. [2025-03-04 15:36:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21255 to 19161. [2025-03-04 15:36:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19161 states, 10543 states have (on average 1.1420847955989757) internal successors, (12041), 10385 states have internal predecessors, (12041), 7493 states have call successors, (7624), 1002 states have call predecessors, (7624), 1125 states have return successors, (27753), 7773 states have call predecessors, (27753), 7493 states have call successors, (27753) [2025-03-04 15:36:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19161 states to 19161 states and 47418 transitions. [2025-03-04 15:36:26,627 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19161 states and 47418 transitions. [2025-03-04 15:36:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:26,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 15:36:26,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-04 15:36:26,627 INFO L87 Difference]: Start difference. First operand 19161 states and 47418 transitions. Second operand has 22 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 22 states have internal predecessors, (60), 14 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (26), 11 states have call predecessors, (26), 14 states have call successors, (26) [2025-03-04 15:36:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:27,325 INFO L93 Difference]: Finished difference Result 25652 states and 61631 transitions. [2025-03-04 15:36:27,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25652 states and 61631 transitions. [2025-03-04 15:36:27,735 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 2020 [2025-03-04 15:36:28,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25652 states to 25270 states and 60365 transitions. [2025-03-04 15:36:28,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6666 [2025-03-04 15:36:28,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6666 [2025-03-04 15:36:28,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25270 states and 60365 transitions. [2025-03-04 15:36:28,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:28,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25270 states and 60365 transitions. [2025-03-04 15:36:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25270 states and 60365 transitions. [2025-03-04 15:36:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25270 to 19662. [2025-03-04 15:36:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19662 states, 10550 states have (on average 1.1461611374407583) internal successors, (12092), 10421 states have internal predecessors, (12092), 8018 states have call successors, (8233), 1008 states have call predecessors, (8233), 1094 states have return successors, (29671), 8232 states have call predecessors, (29671), 8018 states have call successors, (29671) [2025-03-04 15:36:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 49996 transitions. [2025-03-04 15:36:28,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19662 states and 49996 transitions. [2025-03-04 15:36:28,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 15:36:28,753 INFO L432 stractBuchiCegarLoop]: Abstraction has 19662 states and 49996 transitions. [2025-03-04 15:36:28,753 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-04 15:36:28,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19662 states and 49996 transitions. [2025-03-04 15:36:28,955 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 1647 [2025-03-04 15:36:28,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:28,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:28,956 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [17, 17, 11, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:28,956 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:28,956 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" [2025-03-04 15:36:28,956 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" [2025-03-04 15:36:28,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash -341421235, now seen corresponding path program 7 times [2025-03-04 15:36:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645006263] [2025-03-04 15:36:28,957 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:28,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 15:36:28,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:36:28,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:28,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 47 proven. 24 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-04 15:36:29,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:29,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645006263] [2025-03-04 15:36:29,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645006263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:29,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725032086] [2025-03-04 15:36:29,036 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:29,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:29,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:29,039 INFO L229 MonitoredProcess]: Starting monitored process 156 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:29,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2025-03-04 15:36:29,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 15:36:29,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:36:29,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:29,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:29,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:29,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 350 proven. 1 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-04 15:36:29,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 46 proven. 25 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-04 15:36:29,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725032086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:29,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:29,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-04 15:36:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996118011] [2025-03-04 15:36:29,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:29,322 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:29,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash 246676856, now seen corresponding path program 5 times [2025-03-04 15:36:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488961088] [2025-03-04 15:36:29,322 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:29,327 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-03-04 15:36:29,329 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:36:29,329 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 15:36:29,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:36:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770489873] [2025-03-04 15:36:29,330 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:29,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:29,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:29,333 INFO L229 MonitoredProcess]: Starting monitored process 157 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:29,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2025-03-04 15:36:29,453 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-03-04 15:36:29,460 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:36:29,460 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 15:36:29,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:29,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:29,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:36:29,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:36:29,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:29,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:29,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:29,645 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:29,646 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:29,646 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:29,646 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:29,646 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:29,646 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:29,646 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:29,646 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:29,646 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2025-03-04 15:36:29,646 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:29,646 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:29,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,708 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:29,708 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:29,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:29,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:29,710 INFO L229 MonitoredProcess]: Starting monitored process 158 with /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,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-03-04 15:36:29,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:29,712 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:29,722 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:29,722 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:29,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-03-04 15:36:29,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:29,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:29,729 INFO L229 MonitoredProcess]: Starting monitored process 159 with /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,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-03-04 15:36:29,730 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:29,730 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:29,740 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:29,740 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:36:29,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-03-04 15:36:29,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:29,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:29,766 INFO L229 MonitoredProcess]: Starting monitored process 160 with /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,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-03-04 15:36:29,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:29,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:29,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-03-04 15:36:29,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:29,786 INFO L229 MonitoredProcess]: Starting monitored process 161 with /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,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-03-04 15:36:29,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:29,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:29,963 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:29,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-03-04 15:36:29,971 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:29,971 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:29,971 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:29,971 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:29,971 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:29,971 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:29,971 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:29,971 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:29,971 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2025-03-04 15:36:29,971 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:29,971 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:29,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:29,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:30,030 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:30,030 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:30,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:30,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:30,034 INFO L229 MonitoredProcess]: Starting monitored process 162 with /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:30,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-03-04 15:36:30,036 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:30,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:30,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:30,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:30,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:30,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:30,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:30,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:30,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:30,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-03-04 15:36:30,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:30,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:30,054 INFO L229 MonitoredProcess]: Starting monitored process 163 with /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:30,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-03-04 15:36:30,055 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:30,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:30,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:30,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:30,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:30,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:30,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:30,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:30,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:30,070 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:30,070 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:30,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:30,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:30,072 INFO L229 MonitoredProcess]: Starting monitored process 164 with /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:30,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-03-04 15:36:30,073 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:30,073 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:30,074 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:30,074 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_binomialCoefficient_~k#1, ULTIMATE.start_binomialCoefficient_~n#1) = 2*ULTIMATE.start_binomialCoefficient_~k#1 - 2*ULTIMATE.start_binomialCoefficient_~n#1 + 1 Supporting invariants [] [2025-03-04 15:36:30,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-03-04 15:36:30,079 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:30,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:30,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 15:36:30,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:36:30,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:30,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:30,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 15:36:30,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:30,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:36:30,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:36:30,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:30,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:30,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 15:36:30,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 15:36:30,695 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:30,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19662 states and 49996 transitions. cyclomatic complexity: 30695 Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 15:36:31,125 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19662 states and 49996 transitions. cyclomatic complexity: 30695. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Result 22982 states and 54330 transitions. Complement of second has 60 states. [2025-03-04 15:36:31,126 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:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 15:36:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2025-03-04 15:36:31,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 55 transitions. Stem has 115 letters. Loop has 26 letters. [2025-03-04 15:36:31,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:31,126 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:31,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 15:36:31,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:36:31,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:31,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:31,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 15:36:31,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:31,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:31,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:36:31,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:36:31,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:31,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:31,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 15:36:31,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 15:36:31,726 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:31,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19662 states and 49996 transitions. cyclomatic complexity: 30695 Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 15:36:32,308 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19662 states and 49996 transitions. cyclomatic complexity: 30695. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Result 48918 states and 121935 transitions. Complement of second has 62 states. [2025-03-04 15:36:32,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 15:36:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2025-03-04 15:36:32,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 115 letters. Loop has 26 letters. [2025-03-04 15:36:32,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:32,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 141 letters. Loop has 26 letters. [2025-03-04 15:36:32,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:32,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 115 letters. Loop has 52 letters. [2025-03-04 15:36:32,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:32,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48918 states and 121935 transitions. [2025-03-04 15:36:32,870 INFO L131 ngComponentsAnalysis]: Automaton has 137 accepting balls. 2514 [2025-03-04 15:36:33,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48918 states to 37150 states and 91292 transitions. [2025-03-04 15:36:33,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8241 [2025-03-04 15:36:33,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8369 [2025-03-04 15:36:33,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37150 states and 91292 transitions. [2025-03-04 15:36:33,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:33,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37150 states and 91292 transitions. [2025-03-04 15:36:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37150 states and 91292 transitions. [2025-03-04 15:36:34,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37150 to 33835. [2025-03-04 15:36:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33835 states, 18010 states have (on average 1.1408661854525264) internal successors, (20547), 17768 states have internal predecessors, (20547), 13897 states have call successors, (14305), 1798 states have call predecessors, (14305), 1928 states have return successors, (44917), 14268 states have call predecessors, (44917), 13897 states have call successors, (44917) [2025-03-04 15:36:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33835 states to 33835 states and 79769 transitions. [2025-03-04 15:36:34,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33835 states and 79769 transitions. [2025-03-04 15:36:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:34,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:36:34,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:36:34,637 INFO L87 Difference]: Start difference. First operand 33835 states and 79769 transitions. Second operand has 10 states, 8 states have (on average 5.0) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 15:36:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:34,911 INFO L93 Difference]: Finished difference Result 11999 states and 21589 transitions. [2025-03-04 15:36:34,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11999 states and 21589 transitions. [2025-03-04 15:36:34,972 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 656 [2025-03-04 15:36:35,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11999 states to 9991 states and 18776 transitions. [2025-03-04 15:36:35,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2198 [2025-03-04 15:36:35,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2208 [2025-03-04 15:36:35,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9991 states and 18776 transitions. [2025-03-04 15:36:35,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:35,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9991 states and 18776 transitions. [2025-03-04 15:36:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9991 states and 18776 transitions. [2025-03-04 15:36:35,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9991 to 9947. [2025-03-04 15:36:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9947 states, 5972 states have (on average 1.0917615539182852) internal successors, (6520), 5934 states have internal predecessors, (6520), 2839 states have call successors, (2920), 1032 states have call predecessors, (2920), 1136 states have return successors, (9247), 2980 states have call predecessors, (9247), 2839 states have call successors, (9247) [2025-03-04 15:36:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9947 states to 9947 states and 18687 transitions. [2025-03-04 15:36:35,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9947 states and 18687 transitions. [2025-03-04 15:36:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:36:35,204 INFO L432 stractBuchiCegarLoop]: Abstraction has 9947 states and 18687 transitions. [2025-03-04 15:36:35,204 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-04 15:36:35,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9947 states and 18687 transitions. [2025-03-04 15:36:35,228 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 656 [2025-03-04 15:36:35,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:35,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:35,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 11, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:35,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:35,229 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~k~0#1 <= main_~x~0#1);havoc main_~k~0#1;main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" [2025-03-04 15:36:35,230 INFO L754 eck$LassoCheckResult]: Loop: "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" [2025-03-04 15:36:35,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:35,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1754909555, now seen corresponding path program 8 times [2025-03-04 15:36:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:35,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673992790] [2025-03-04 15:36:35,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:35,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-04 15:36:35,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 15:36:35,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:35,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-04 15:36:35,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:35,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673992790] [2025-03-04 15:36:35,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673992790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124302243] [2025-03-04 15:36:35,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:35,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:35,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:35,356 INFO L229 MonitoredProcess]: Starting monitored process 165 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,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2025-03-04 15:36:35,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-04 15:36:35,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 15:36:35,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:35,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:35,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:35,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-04 15:36:35,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-04 15:36:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124302243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:35,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:35,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 15:36:35,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544428684] [2025-03-04 15:36:35,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:35,622 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:35,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1056498590, now seen corresponding path program 6 times [2025-03-04 15:36:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:35,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213309892] [2025-03-04 15:36:35,622 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:35,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:35,627 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 6 equivalence classes. [2025-03-04 15:36:35,632 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:36:35,633 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 15:36:35,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:36:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789844584] [2025-03-04 15:36:35,633 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:35,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:35,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:35,636 INFO L229 MonitoredProcess]: Starting monitored process 166 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,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2025-03-04 15:36:35,753 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 6 equivalence classes. [2025-03-04 15:36:35,761 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:36:35,761 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 15:36:35,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:35,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:35,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:36:35,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:36:35,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:35,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:35,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:35,959 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:35,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:35,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:35,960 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:35,960 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:35,960 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:35,960 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:35,960 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:35,960 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration26_Loop [2025-03-04 15:36:35,960 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:35,960 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:35,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:35,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:35,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:35,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:35,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:35,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:35,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:35,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:35,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:36,023 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:36,023 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:36,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:36,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:36,025 INFO L229 MonitoredProcess]: Starting monitored process 167 with /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:36,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-03-04 15:36:36,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:36,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:36,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-03-04 15:36:36,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:36,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:36,045 INFO L229 MonitoredProcess]: Starting monitored process 168 with /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:36,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-03-04 15:36:36,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:36,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:36,228 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:36,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2025-03-04 15:36:36,235 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:36,235 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:36,235 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:36,235 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:36,235 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:36,235 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:36,235 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:36,235 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:36,235 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration26_Loop [2025-03-04 15:36:36,235 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:36,235 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:36,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:36,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:36,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:36,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:36,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:36,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:36,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:36,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:36,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:36,299 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:36,299 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:36,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:36,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:36,302 INFO L229 MonitoredProcess]: Starting monitored process 169 with /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:36,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-03-04 15:36:36,304 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:36,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:36,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:36,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:36,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:36,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:36,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:36,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:36,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:36,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:36,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:36,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:36,322 INFO L229 MonitoredProcess]: Starting monitored process 170 with /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:36,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-03-04 15:36:36,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:36,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:36,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:36,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:36,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:36,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:36,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:36,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:36,337 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:36,339 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:36,339 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:36,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:36,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:36,342 INFO L229 MonitoredProcess]: Starting monitored process 171 with /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:36,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-03-04 15:36:36,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:36,343 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:36,343 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:36,343 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2025-03-04 15:36:36,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:36,349 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:36,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:36,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 15:36:36,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 15:36:36,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:36,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:36,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:36:36,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:36,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:36:36,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:36:36,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:36,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:36,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:36:36,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 15:36:36,898 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:36,898 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9947 states and 18687 transitions. cyclomatic complexity: 8907 Second operand has 11 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:37,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9947 states and 18687 transitions. cyclomatic complexity: 8907. Second operand has 11 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 16068 states and 28305 transitions. Complement of second has 50 states. [2025-03-04 15:36:37,156 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:36:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2025-03-04 15:36:37,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 61 transitions. Stem has 109 letters. Loop has 32 letters. [2025-03-04 15:36:37,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:37,157 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:37,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:37,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 15:36:37,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 15:36:37,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:37,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:37,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:36:37,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:37,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:36:37,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:36:37,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:37,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:37,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:36:37,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 15:36:37,712 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:37,712 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9947 states and 18687 transitions. cyclomatic complexity: 8907 Second operand has 11 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:37,962 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9947 states and 18687 transitions. cyclomatic complexity: 8907. Second operand has 11 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 16068 states and 28299 transitions. Complement of second has 54 states. [2025-03-04 15:36:37,962 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:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2025-03-04 15:36:37,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 60 transitions. Stem has 109 letters. Loop has 32 letters. [2025-03-04 15:36:37,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:37,963 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:37,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:37,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 15:36:38,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 15:36:38,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:38,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 15:36:38,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:38,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:36:38,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:36:38,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:38,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:36:38,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 15:36:38,592 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:38,592 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9947 states and 18687 transitions. cyclomatic complexity: 8907 Second operand has 11 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:38,988 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9947 states and 18687 transitions. cyclomatic complexity: 8907. Second operand has 11 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 21864 states and 39819 transitions. Complement of second has 90 states. [2025-03-04 15:36:38,988 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:36:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 15:36:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2025-03-04 15:36:38,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 97 transitions. Stem has 109 letters. Loop has 32 letters. [2025-03-04 15:36:38,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:38,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 97 transitions. Stem has 141 letters. Loop has 32 letters. [2025-03-04 15:36:38,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:38,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 97 transitions. Stem has 109 letters. Loop has 64 letters. [2025-03-04 15:36:38,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:38,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21864 states and 39819 transitions. [2025-03-04 15:36:39,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-03-04 15:36:39,257 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 623 [2025-03-04 15:36:39,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21864 states to 11377 states and 20273 transitions. [2025-03-04 15:36:39,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2400 [2025-03-04 15:36:39,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2471 [2025-03-04 15:36:39,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11377 states and 20273 transitions. [2025-03-04 15:36:39,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:39,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11377 states and 20273 transitions. [2025-03-04 15:36:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11377 states and 20273 transitions. [2025-03-04 15:36:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11377 to 10961. [2025-03-04 15:36:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10961 states, 6644 states have (on average 1.084587597832631) internal successors, (7206), 6644 states have internal predecessors, (7206), 2964 states have call successors, (3074), 1176 states have call predecessors, (3074), 1353 states have return successors, (9369), 3140 states have call predecessors, (9369), 2964 states have call successors, (9369) [2025-03-04 15:36:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10961 states to 10961 states and 19649 transitions. [2025-03-04 15:36:39,515 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10961 states and 19649 transitions. [2025-03-04 15:36:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:39,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:36:39,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:36:39,516 INFO L87 Difference]: Start difference. First operand 10961 states and 19649 transitions. Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 15:36:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:39,613 INFO L93 Difference]: Finished difference Result 10505 states and 18663 transitions. [2025-03-04 15:36:39,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10505 states and 18663 transitions. [2025-03-04 15:36:39,668 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 604 [2025-03-04 15:36:39,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10505 states to 10411 states and 18554 transitions. [2025-03-04 15:36:39,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2324 [2025-03-04 15:36:39,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2324 [2025-03-04 15:36:39,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10411 states and 18554 transitions. [2025-03-04 15:36:39,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:39,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10411 states and 18554 transitions. [2025-03-04 15:36:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10411 states and 18554 transitions. [2025-03-04 15:36:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10411 to 10355. [2025-03-04 15:36:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10355 states, 6285 states have (on average 1.0800318217979317) internal successors, (6788), 6243 states have internal predecessors, (6788), 2790 states have call successors, (2883), 1096 states have call predecessors, (2883), 1280 states have return successors, (8819), 3015 states have call predecessors, (8819), 2790 states have call successors, (8819) [2025-03-04 15:36:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10355 states to 10355 states and 18490 transitions. [2025-03-04 15:36:40,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10355 states and 18490 transitions. [2025-03-04 15:36:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:36:40,016 INFO L432 stractBuchiCegarLoop]: Abstraction has 10355 states and 18490 transitions. [2025-03-04 15:36:40,016 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-04 15:36:40,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10355 states and 18490 transitions. [2025-03-04 15:36:40,039 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 598 [2025-03-04 15:36:40,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:40,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:40,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 19, 12, 7, 7, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:40,040 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:40,040 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:40,040 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:40,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1054765364, now seen corresponding path program 6 times [2025-03-04 15:36:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:40,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510519040] [2025-03-04 15:36:40,040 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:40,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:40,046 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 128 statements into 9 equivalence classes. [2025-03-04 15:36:40,050 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 67 of 128 statements. [2025-03-04 15:36:40,050 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 15:36:40,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2025-03-04 15:36:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510519040] [2025-03-04 15:36:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510519040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:36:40,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425028171] [2025-03-04 15:36:40,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:40,072 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:40,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash 227052590, now seen corresponding path program 11 times [2025-03-04 15:36:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088980917] [2025-03-04 15:36:40,073 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:40,076 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 22 equivalence classes. [2025-03-04 15:36:40,082 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 15:36:40,082 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2025-03-04 15:36:40,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 191 proven. 388 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-04 15:36:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088980917] [2025-03-04 15:36:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088980917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:40,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746610248] [2025-03-04 15:36:40,310 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:40,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:40,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:40,312 INFO L229 MonitoredProcess]: Starting monitored process 172 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:40,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2025-03-04 15:36:40,424 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 22 equivalence classes. [2025-03-04 15:36:40,447 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 15:36:40,448 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2025-03-04 15:36:40,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:40,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 15:36:40,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 238 proven. 333 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2025-03-04 15:36:40,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 238 proven. 407 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 15:36:42,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746610248] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:42,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:42,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 28] total 38 [2025-03-04 15:36:42,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137656797] [2025-03-04 15:36:42,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:42,056 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:42,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:42,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 15:36:42,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 15:36:42,056 INFO L87 Difference]: Start difference. First operand 10355 states and 18490 transitions. cyclomatic complexity: 8301 Second operand has 38 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 31 states have internal predecessors, (71), 20 states have call successors, (21), 1 states have call predecessors, (21), 15 states have return successors, (34), 22 states have call predecessors, (34), 20 states have call successors, (34) [2025-03-04 15:36:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:43,547 INFO L93 Difference]: Finished difference Result 15585 states and 33168 transitions. [2025-03-04 15:36:43,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15585 states and 33168 transitions. [2025-03-04 15:36:43,645 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 1065 [2025-03-04 15:36:43,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15585 states to 14826 states and 31893 transitions. [2025-03-04 15:36:43,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3483 [2025-03-04 15:36:43,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3494 [2025-03-04 15:36:43,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14826 states and 31893 transitions. [2025-03-04 15:36:43,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:43,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14826 states and 31893 transitions. [2025-03-04 15:36:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14826 states and 31893 transitions. [2025-03-04 15:36:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14826 to 10386. [2025-03-04 15:36:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10386 states, 6238 states have (on average 1.0799935876883617) internal successors, (6737), 6200 states have internal predecessors, (6737), 2882 states have call successors, (2963), 1094 states have call predecessors, (2963), 1266 states have return successors, (9982), 3091 states have call predecessors, (9982), 2882 states have call successors, (9982) [2025-03-04 15:36:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10386 states to 10386 states and 19682 transitions. [2025-03-04 15:36:44,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10386 states and 19682 transitions. [2025-03-04 15:36:44,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 15:36:44,022 INFO L432 stractBuchiCegarLoop]: Abstraction has 10386 states and 19682 transitions. [2025-03-04 15:36:44,022 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-04 15:36:44,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10386 states and 19682 transitions. [2025-03-04 15:36:44,048 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 642 [2025-03-04 15:36:44,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:44,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:44,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 19, 12, 7, 7, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:44,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 16, 16, 16, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:44,049 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:44,049 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:44,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1054765364, now seen corresponding path program 7 times [2025-03-04 15:36:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:44,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564543361] [2025-03-04 15:36:44,050 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:44,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 15:36:44,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 15:36:44,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:44,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2025-03-04 15:36:44,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:44,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564543361] [2025-03-04 15:36:44,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564543361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:44,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:44,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:36:44,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721587815] [2025-03-04 15:36:44,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:44,083 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:44,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1746516244, now seen corresponding path program 12 times [2025-03-04 15:36:44,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:44,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014428018] [2025-03-04 15:36:44,083 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:44,087 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 116 statements into 23 equivalence classes. [2025-03-04 15:36:44,096 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 15:36:44,097 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2025-03-04 15:36:44,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 202 proven. 461 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-04 15:36:44,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014428018] [2025-03-04 15:36:44,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014428018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884482255] [2025-03-04 15:36:44,400 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:44,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:44,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:44,402 INFO L229 MonitoredProcess]: Starting monitored process 173 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,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2025-03-04 15:36:44,536 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 116 statements into 23 equivalence classes. [2025-03-04 15:36:44,833 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 15:36:44,833 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2025-03-04 15:36:44,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:44,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 15:36:44,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 223 proven. 413 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 15:36:44,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 223 proven. 514 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-04 15:36:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884482255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:47,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 32] total 44 [2025-03-04 15:36:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812401638] [2025-03-04 15:36:47,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:47,243 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:47,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 15:36:47,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1594, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 15:36:47,244 INFO L87 Difference]: Start difference. First operand 10386 states and 19682 transitions. cyclomatic complexity: 9462 Second operand has 44 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 37 states have internal predecessors, (80), 24 states have call successors, (25), 1 states have call predecessors, (25), 16 states have return successors, (37), 22 states have call predecessors, (37), 24 states have call successors, (37) [2025-03-04 15:36:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:48,672 INFO L93 Difference]: Finished difference Result 14961 states and 31737 transitions. [2025-03-04 15:36:48,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14961 states and 31737 transitions. [2025-03-04 15:36:48,763 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 964 [2025-03-04 15:36:48,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14961 states to 14443 states and 30906 transitions. [2025-03-04 15:36:48,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3340 [2025-03-04 15:36:48,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3340 [2025-03-04 15:36:48,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14443 states and 30906 transitions. [2025-03-04 15:36:48,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:48,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14443 states and 30906 transitions. [2025-03-04 15:36:48,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14443 states and 30906 transitions. [2025-03-04 15:36:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14443 to 10640. [2025-03-04 15:36:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10640 states, 6357 states have (on average 1.0784961459808085) internal successors, (6856), 6318 states have internal predecessors, (6856), 2977 states have call successors, (3058), 1114 states have call predecessors, (3058), 1306 states have return successors, (10785), 3207 states have call predecessors, (10785), 2977 states have call successors, (10785) [2025-03-04 15:36:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10640 states to 10640 states and 20699 transitions. [2025-03-04 15:36:49,319 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10640 states and 20699 transitions. [2025-03-04 15:36:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 15:36:49,319 INFO L432 stractBuchiCegarLoop]: Abstraction has 10640 states and 20699 transitions. [2025-03-04 15:36:49,319 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-04 15:36:49,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10640 states and 20699 transitions. [2025-03-04 15:36:49,343 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 660 [2025-03-04 15:36:49,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:49,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:49,344 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 19, 12, 7, 7, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:49,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 17, 17, 17, 17, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:36:49,344 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~post9#1, main_~k~0#1, main_#t~post10#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0;" "assume main_~n~0#1 <= main_~x~0#1;main_~k~0#1 := 0;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#48#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#46#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#44#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret7#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:49,344 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1;" "call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#54#return;" "call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#52#return;" "call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume !(~n <= 0);" "call #t~ret0 := fact(~n - 1);"< "~n := #in~n;" "assume ~n <= 0;#res := 1;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#42#return;" "#res := ~n * #t~ret0;havoc #t~ret0;" "assume true;" >"#50#return;" "binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1;" "main_#t~ret8#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;" "main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~k~0#1 <= main_~x~0#1;" [2025-03-04 15:36:49,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1054765364, now seen corresponding path program 8 times [2025-03-04 15:36:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:49,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608640105] [2025-03-04 15:36:49,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:49,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-03-04 15:36:49,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 15:36:49,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:49,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2025-03-04 15:36:49,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:49,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608640105] [2025-03-04 15:36:49,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608640105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:49,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:49,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:36:49,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745276003] [2025-03-04 15:36:49,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:49,380 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:49,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash -273309330, now seen corresponding path program 13 times [2025-03-04 15:36:49,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:49,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584949787] [2025-03-04 15:36:49,380 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:49,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:49,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 15:36:49,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 15:36:49,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:49,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 195 proven. 517 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-03-04 15:36:49,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:49,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584949787] [2025-03-04 15:36:49,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584949787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:49,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579353191] [2025-03-04 15:36:49,658 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:49,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:49,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:49,660 INFO L229 MonitoredProcess]: Starting monitored process 174 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:49,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2025-03-04 15:36:49,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 15:36:49,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 15:36:49,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:49,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:49,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 15:36:49,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 195 proven. 502 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-03-04 15:36:49,924 INFO L312 TraceCheckSpWp]: Computing backward predicates...