./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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.2.5-dev-84cfde4 [2024-10-12 00:13:50,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:13:50,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:13:50,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:13:50,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:13:50,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:13:50,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:13:50,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:13:50,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:13:50,269 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:13:50,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:13:50,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:13:50,270 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:13:50,271 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:13:50,271 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:13:50,273 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:13:50,273 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:13:50,273 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:13:50,273 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:13:50,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:13:50,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:13:50,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:13:50,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:13:50,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:13:50,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:13:50,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:13:50,275 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:13:50,276 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:13:50,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:13:50,276 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:13:50,276 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:13:50,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:13:50,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:13:50,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:13:50,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:13:50,278 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:13:50,279 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 [2024-10-12 00:13:50,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:13:50,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:13:50,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:13:50,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:13:50,542 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:13:50,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2024-10-12 00:13:51,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:13:52,120 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:13:52,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2024-10-12 00:13:52,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4eb370650/8d27926ad9ff467fab4d9877670974ce/FLAGc76081cc4 [2024-10-12 00:13:52,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4eb370650/8d27926ad9ff467fab4d9877670974ce [2024-10-12 00:13:52,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:13:52,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:13:52,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:13:52,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:13:52,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:13:52,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0fc01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52, skipping insertion in model container [2024-10-12 00:13:52,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:13:52,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:13:52,328 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:13:52,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:13:52,351 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:13:52,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52 WrapperNode [2024-10-12 00:13:52,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:13:52,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:13:52,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:13:52,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:13:52,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,389 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-10-12 00:13:52,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:13:52,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:13:52,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:13:52,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:13:52,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,410 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-12 00:13:52,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:13:52,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:13:52,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:13:52,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:13:52,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (1/1) ... [2024-10-12 00:13:52,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:52,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:52,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:52,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:13:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2024-10-12 00:13:52,505 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2024-10-12 00:13:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:13:52,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:13:52,558 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:13:52,559 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:13:52,686 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-12 00:13:52,686 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:13:52,703 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:13:52,703 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:13:52,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:13:52 BoogieIcfgContainer [2024-10-12 00:13:52,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:13:52,705 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:13:52,705 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:13:52,708 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:13:52,709 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:13:52,709 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:13:52" (1/3) ... [2024-10-12 00:13:52,710 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a60c0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:13:52, skipping insertion in model container [2024-10-12 00:13:52,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:13:52,710 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:13:52" (2/3) ... [2024-10-12 00:13:52,710 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a60c0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:13:52, skipping insertion in model container [2024-10-12 00:13:52,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:13:52,710 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:13:52" (3/3) ... [2024-10-12 00:13:52,712 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2024-10-12 00:13:52,761 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:13:52,761 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:13:52,762 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:13:52,762 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:13:52,762 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:13:52,762 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:13:52,762 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:13:52,762 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:13:52,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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) [2024-10-12 00:13:52,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-10-12 00:13:52,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:52,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:52,789 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:13:52,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:13:52,790 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:13:52,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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) [2024-10-12 00:13:52,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-10-12 00:13:52,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:52,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:52,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:13:52,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:13:52,803 INFO L745 eck$LassoCheckResult]: Stem: 27#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true 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; 15#L35true assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 28#L38true 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; 11#L41-3true [2024-10-12 00:13:52,804 INFO L747 eck$LassoCheckResult]: Loop: 11#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 21#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 30#L42-4true havoc main_~k~0#1; 13#L41-2true main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11#L41-3true [2024-10-12 00:13:52,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:52,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2024-10-12 00:13:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:52,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630960927] [2024-10-12 00:13:52,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:52,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:52,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:52,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:52,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1792233, now seen corresponding path program 1 times [2024-10-12 00:13:52,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:52,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546394306] [2024-10-12 00:13:52,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:52,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:52,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:52,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:52,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash -15995056, now seen corresponding path program 1 times [2024-10-12 00:13:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173606672] [2024-10-12 00:13:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:13:53,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:13:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173606672] [2024-10-12 00:13:53,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173606672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:13:53,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:13:53,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:13:53,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299125735] [2024-10-12 00:13:53,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:13:53,127 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:13:53,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:13:53,129 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:13:53,129 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:13:53,129 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:13:53,129 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:53,130 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:13:53,130 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:13:53,130 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2024-10-12 00:13:53,130 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:13:53,130 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:13:53,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:53,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:53,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:53,211 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:13:53,213 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:13:53,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:53,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:53,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:53,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:13:53,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:53,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:53,238 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:13:53,238 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: [] [2024-10-12 00:13:53,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:53,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:53,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:53,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:13:53,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:53,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:53,270 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:13:53,270 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: [] [2024-10-12 00:13:53,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:13:53,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:53,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:53,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:53,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:13:53,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:53,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:53,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:13:53,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:53,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:53,319 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:53,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:13:53,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:13:53,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:53,406 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:13:53,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:53,411 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:13:53,411 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:13:53,411 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:13:53,411 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:13:53,411 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:13:53,411 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:53,411 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:13:53,411 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:13:53,412 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2024-10-12 00:13:53,412 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:13:53,412 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:13:53,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:53,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:53,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:53,462 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:13:53,466 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:13:53,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:53,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:53,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:53,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:13:53,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:53,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:53,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:53,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:53,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:53,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:53,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:53,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:53,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:13:53,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:53,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:53,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:53,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:53,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:13:53,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:53,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:53,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:53,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:53,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:53,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:53,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:53,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:53,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:13:53,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:53,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:53,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:53,534 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:53,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:13:53,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:53,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:53,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:53,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:53,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:53,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:53,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:53,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:53,566 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:13:53,572 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-12 00:13:53,572 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-10-12 00:13:53,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:53,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:53,598 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:53,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:13:53,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:13:53,601 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:13:53,601 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:13:53,601 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 [] [2024-10-12 00:13:53,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:13:53,616 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:13:53,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:53,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:13:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:53,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:13:53,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:53,704 WARN L253 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:13:53,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:13:53,814 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 00:13:53,816 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:13:53,934 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 107 transitions. Complement of second has 11 states. [2024-10-12 00:13:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:13:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:13:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2024-10-12 00:13:53,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-12 00:13:53,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:13:53,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 8 letters. Loop has 4 letters. [2024-10-12 00:13:53,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:13:53,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 8 letters. [2024-10-12 00:13:53,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:13:53,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 107 transitions. [2024-10-12 00:13:53,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-10-12 00:13:53,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 35 states and 50 transitions. [2024-10-12 00:13:53,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-12 00:13:53,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-12 00:13:53,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 50 transitions. [2024-10-12 00:13:53,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:13:53,963 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 50 transitions. [2024-10-12 00:13:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 50 transitions. [2024-10-12 00:13:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-10-12 00:13:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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) [2024-10-12 00:13:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2024-10-12 00:13:53,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2024-10-12 00:13:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:13:53,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:13:53,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:13:53,990 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:13:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:13:54,050 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-10-12 00:13:54,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2024-10-12 00:13:54,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-12 00:13:54,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2024-10-12 00:13:54,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-12 00:13:54,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-12 00:13:54,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2024-10-12 00:13:54,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:13:54,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-12 00:13:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2024-10-12 00:13:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-12 00:13:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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) [2024-10-12 00:13:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-12 00:13:54,065 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-12 00:13:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:13:54,066 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-12 00:13:54,066 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:13:54,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2024-10-12 00:13:54,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-12 00:13:54,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:54,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:54,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:13:54,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:13:54,071 INFO L745 eck$LassoCheckResult]: Stem: 252#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 240#L-1 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; 241#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 247#L38 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; 243#L41-3 [2024-10-12 00:13:54,072 INFO L747 eck$LassoCheckResult]: Loop: 243#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 244#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 249#L43 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; 227#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 228#$Ultimate##0 ~n := #in~n; 250#L25 assume ~n <= 0;#res := 1; 239#factFINAL assume true; 229#factEXIT >#78#return; 232#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 228#$Ultimate##0 ~n := #in~n; 250#L25 assume ~n <= 0;#res := 1; 239#factFINAL assume true; 229#factEXIT >#80#return; 234#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 228#$Ultimate##0 ~n := #in~n; 250#L25 assume ~n <= 0;#res := 1; 239#factFINAL assume true; 229#factEXIT >#82#return; 238#L30-8 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; 242#binomialCoefficient_returnLabel#2 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; 248#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 251#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 253#L42-4 havoc main_~k~0#1; 246#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 243#L41-3 [2024-10-12 00:13:54,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2024-10-12 00:13:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793292403] [2024-10-12 00:13:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:54,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:54,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:54,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:54,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2022384732, now seen corresponding path program 1 times [2024-10-12 00:13:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:54,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530598029] [2024-10-12 00:13:54,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:54,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:13:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 00:13:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:13:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 00:13:54,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:13:54,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530598029] [2024-10-12 00:13:54,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530598029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:13:54,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:13:54,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:13:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362073789] [2024-10-12 00:13:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:13:54,304 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:13:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:13:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:13:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:13:54,305 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 00:13:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:13:54,372 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2024-10-12 00:13:54,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 43 transitions. [2024-10-12 00:13:54,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-12 00:13:54,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 43 transitions. [2024-10-12 00:13:54,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-12 00:13:54,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-12 00:13:54,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2024-10-12 00:13:54,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:13:54,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-10-12 00:13:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2024-10-12 00:13:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-12 00:13:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-12 00:13:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2024-10-12 00:13:54,381 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-10-12 00:13:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:13:54,382 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2024-10-12 00:13:54,382 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:13:54,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2024-10-12 00:13:54,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-12 00:13:54,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:54,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:54,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:13:54,384 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:13:54,384 INFO L745 eck$LassoCheckResult]: Stem: 330#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 316#L-1 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; 317#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 324#L38 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; 320#L41-3 [2024-10-12 00:13:54,385 INFO L747 eck$LassoCheckResult]: Loop: 320#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 321#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 326#L43 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; 310#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 304#$Ultimate##0 ~n := #in~n; 327#L25 assume ~n <= 0;#res := 1; 328#factFINAL assume true; 305#factEXIT >#72#return; 306#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 304#$Ultimate##0 ~n := #in~n; 327#L25 assume ~n <= 0;#res := 1; 328#factFINAL assume true; 305#factEXIT >#74#return; 308#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 304#$Ultimate##0 ~n := #in~n; 327#L25 assume ~n <= 0;#res := 1; 328#factFINAL assume true; 305#factEXIT >#76#return; 312#L30-3 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; 322#binomialCoefficient_returnLabel#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; 325#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 329#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 331#L42-4 havoc main_~k~0#1; 323#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 320#L41-3 [2024-10-12 00:13:54,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2024-10-12 00:13:54,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:54,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769164183] [2024-10-12 00:13:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:54,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:54,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:54,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:54,392 INFO L85 PathProgramCache]: Analyzing trace with hash -481826528, now seen corresponding path program 1 times [2024-10-12 00:13:54,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:54,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986259722] [2024-10-12 00:13:54,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:54,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:13:54,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521517092] [2024-10-12 00:13:54,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:54,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:13:54,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:54,424 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:13:54,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 00:13:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:54,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:54,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:54,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1147386361, now seen corresponding path program 1 times [2024-10-12 00:13:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274783895] [2024-10-12 00:13:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:13:54,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136361815] [2024-10-12 00:13:54,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:54,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:13:54,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:54,525 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:13:54,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 00:13:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:54,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:54,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:54,851 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:13:54,852 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:13:54,852 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:13:54,852 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:13:54,852 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:13:54,852 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:54,852 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:13:54,852 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:13:54,852 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2024-10-12 00:13:54,852 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:13:54,852 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:13:54,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:54,946 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:13:54,946 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:13:54,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:54,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:54,950 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:54,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:13:54,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:54,953 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:54,967 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:13:54,967 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: [] [2024-10-12 00:13:54,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:13:54,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:54,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:54,984 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:54,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:13:54,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:54,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:55,002 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:13:55,003 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: [] [2024-10-12 00:13:55,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:13:55,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,017 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:13:55,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:55,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:55,029 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:13:55,030 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: [] [2024-10-12 00:13:55,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:55,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,043 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:13:55,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:55,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:55,055 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:13:55,055 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: [] [2024-10-12 00:13:55,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:55,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,067 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:13:55,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:55,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:55,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:13:55,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,093 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:13:55,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:13:55,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:55,107 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:13:55,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:13:55,123 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:13:55,123 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:13:55,123 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:13:55,123 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:13:55,123 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:13:55,123 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,123 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:13:55,123 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:13:55,124 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2024-10-12 00:13:55,124 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:13:55,124 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:13:55,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:55,218 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:13:55,218 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:13:55,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,221 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:13:55,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:55,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:55,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:55,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:55,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:55,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:55,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:55,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:55,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:13:55,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:13:55,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,249 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:13:55,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:55,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:55,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:55,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:55,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:55,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:55,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:55,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:55,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:13:55,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:55,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,275 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:55,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:13:55,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:55,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:55,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:55,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:55,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:55,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:55,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:55,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:13:55,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:55,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,302 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:13:55,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 [2024-10-12 00:13:55,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:55,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:55,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:55,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:55,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:55,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:55,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:55,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:13:55,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:55,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,329 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:13:55,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:55,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:55,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:55,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:55,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:55,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:55,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:55,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:55,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:13:55,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:13:55,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,360 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:13:55,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:55,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:55,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:55,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:55,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:55,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:55,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:55,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:55,381 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:13:55,385 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:13:55,385 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:13:55,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:55,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:55,386 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:55,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:13:55,389 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:13:55,389 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:13:55,389 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:13:55,389 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 [] [2024-10-12 00:13:55,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:13:55,405 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:13:55,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:55,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:13:55,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:55,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:13:55,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:55,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 00:13:55,644 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 [2024-10-12 00:13:55,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 43 transitions. cyclomatic complexity: 16 Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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) [2024-10-12 00:13:55,885 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 43 transitions. cyclomatic complexity: 16. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 119 states and 178 transitions. Complement of second has 28 states. [2024-10-12 00:13:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-10-12 00:13:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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) [2024-10-12 00:13:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2024-10-12 00:13:55,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 24 letters. [2024-10-12 00:13:55,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:13:55,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 28 letters. Loop has 24 letters. [2024-10-12 00:13:55,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:13:55,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 48 letters. [2024-10-12 00:13:55,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:13:55,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 178 transitions. [2024-10-12 00:13:55,895 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2024-10-12 00:13:55,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 117 states and 176 transitions. [2024-10-12 00:13:55,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-12 00:13:55,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-10-12 00:13:55,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 176 transitions. [2024-10-12 00:13:55,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:13:55,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 176 transitions. [2024-10-12 00:13:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 176 transitions. [2024-10-12 00:13:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-10-12 00:13:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 30 states have call successors, (30), 6 states have call predecessors, (30), 10 states have return successors, (50), 30 states have call predecessors, (50), 30 states have call successors, (50) [2024-10-12 00:13:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2024-10-12 00:13:55,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-10-12 00:13:55,914 INFO L425 stractBuchiCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-10-12 00:13:55,914 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:13:55,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 167 transitions. [2024-10-12 00:13:55,917 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2024-10-12 00:13:55,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:55,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:55,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:13:55,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:13:55,921 INFO L745 eck$LassoCheckResult]: Stem: 659#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 622#L-1 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; 623#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 639#L38 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; 660#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 631#L42-3 [2024-10-12 00:13:55,921 INFO L747 eck$LassoCheckResult]: Loop: 631#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 642#L43 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; 643#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 674#$Ultimate##0 ~n := #in~n; 680#L25 assume !(~n <= 0); 611#L26 call #t~ret0 := fact(~n - 1);< 628#$Ultimate##0 ~n := #in~n; 649#L25 assume ~n <= 0;#res := 1; 609#factFINAL assume true; 613#factEXIT >#70#return; 678#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 676#factFINAL assume true; 669#factEXIT >#72#return; 672#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 674#$Ultimate##0 ~n := #in~n; 680#L25 assume ~n <= 0;#res := 1; 681#factFINAL assume true; 675#factEXIT >#74#return; 670#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 674#$Ultimate##0 ~n := #in~n; 680#L25 assume ~n <= 0;#res := 1; 681#factFINAL assume true; 675#factEXIT >#76#return; 668#L30-3 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; 666#binomialCoefficient_returnLabel#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; 664#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 663#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 661#L42-4 havoc main_~k~0#1; 637#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 630#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 631#L42-3 [2024-10-12 00:13:55,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2024-10-12 00:13:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:55,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805795712] [2024-10-12 00:13:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:55,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:55,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:55,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:55,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1586780350, now seen corresponding path program 1 times [2024-10-12 00:13:55,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:55,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861721310] [2024-10-12 00:13:55,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:13:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 00:13:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 00:13:56,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:13:56,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861721310] [2024-10-12 00:13:56,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861721310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:13:56,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:13:56,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:13:56,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931327464] [2024-10-12 00:13:56,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:13:56,066 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:13:56,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:13:56,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:13:56,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:13:56,069 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. cyclomatic complexity: 60 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2024-10-12 00:13:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:13:56,149 INFO L93 Difference]: Finished difference Result 157 states and 236 transitions. [2024-10-12 00:13:56,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 236 transitions. [2024-10-12 00:13:56,152 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 51 [2024-10-12 00:13:56,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 148 states and 227 transitions. [2024-10-12 00:13:56,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2024-10-12 00:13:56,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2024-10-12 00:13:56,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 227 transitions. [2024-10-12 00:13:56,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:13:56,157 INFO L218 hiAutomatonCegarLoop]: Abstraction has 148 states and 227 transitions. [2024-10-12 00:13:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 227 transitions. [2024-10-12 00:13:56,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 116. [2024-10-12 00:13:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 79 states have internal predecessors, (91), 30 states have call successors, (30), 6 states have call predecessors, (30), 10 states have return successors, (50), 30 states have call predecessors, (50), 30 states have call successors, (50) [2024-10-12 00:13:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2024-10-12 00:13:56,169 INFO L240 hiAutomatonCegarLoop]: Abstraction has 116 states and 171 transitions. [2024-10-12 00:13:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:13:56,170 INFO L425 stractBuchiCegarLoop]: Abstraction has 116 states and 171 transitions. [2024-10-12 00:13:56,170 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:13:56,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 171 transitions. [2024-10-12 00:13:56,171 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2024-10-12 00:13:56,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:56,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:56,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:13:56,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:13:56,173 INFO L745 eck$LassoCheckResult]: Stem: 956#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 924#L-1 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; 925#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 943#L38 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; 957#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 933#L42-3 [2024-10-12 00:13:56,173 INFO L747 eck$LassoCheckResult]: Loop: 933#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 962#L43 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; 968#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 974#$Ultimate##0 ~n := #in~n; 978#L25 assume !(~n <= 0); 895#L26 call #t~ret0 := fact(~n - 1);< 930#$Ultimate##0 ~n := #in~n; 951#L25 assume ~n <= 0;#res := 1; 948#factFINAL assume true; 893#factEXIT >#70#return; 899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975#factFINAL assume true; 967#factEXIT >#72#return; 969#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 974#$Ultimate##0 ~n := #in~n; 978#L25 assume ~n <= 0;#res := 1; 977#factFINAL assume true; 976#factEXIT >#74#return; 972#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 974#$Ultimate##0 ~n := #in~n; 978#L25 assume ~n <= 0;#res := 1; 977#factFINAL assume true; 976#factEXIT >#76#return; 936#L30-3 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; 937#binomialCoefficient_returnLabel#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; 980#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 933#L42-3 [2024-10-12 00:13:56,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:56,173 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2024-10-12 00:13:56,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:56,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428297627] [2024-10-12 00:13:56,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:56,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:56,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:56,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash -542592342, now seen corresponding path program 1 times [2024-10-12 00:13:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:56,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069701081] [2024-10-12 00:13:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:13:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 00:13:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 00:13:56,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:13:56,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069701081] [2024-10-12 00:13:56,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069701081] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:13:56,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858769557] [2024-10-12 00:13:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:56,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:13:56,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:56,345 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:13:56,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-12 00:13:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:56,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:13:56,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 00:13:56,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:13:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 00:13:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858769557] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:13:56,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:13:56,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-10-12 00:13:56,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393378199] [2024-10-12 00:13:56,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:13:56,600 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:13:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:13:56,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:13:56,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:13:56,601 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. cyclomatic complexity: 60 Second operand has 13 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-12 00:13:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:13:56,810 INFO L93 Difference]: Finished difference Result 180 states and 261 transitions. [2024-10-12 00:13:56,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 261 transitions. [2024-10-12 00:13:56,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2024-10-12 00:13:56,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 261 transitions. [2024-10-12 00:13:56,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2024-10-12 00:13:56,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2024-10-12 00:13:56,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 261 transitions. [2024-10-12 00:13:56,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:13:56,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 180 states and 261 transitions. [2024-10-12 00:13:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 261 transitions. [2024-10-12 00:13:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 130. [2024-10-12 00:13:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.1785714285714286) internal successors, (99), 83 states have internal predecessors, (99), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (58), 36 states have call predecessors, (58), 36 states have call successors, (58) [2024-10-12 00:13:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2024-10-12 00:13:56,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-10-12 00:13:56,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:13:56,842 INFO L425 stractBuchiCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-10-12 00:13:56,843 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:13:56,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 193 transitions. [2024-10-12 00:13:56,844 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2024-10-12 00:13:56,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:56,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:56,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:13:56,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:13:56,845 INFO L745 eck$LassoCheckResult]: Stem: 1438#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1402#L-1 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; 1403#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1420#L38 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; 1439#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1411#L42-3 [2024-10-12 00:13:56,845 INFO L747 eck$LassoCheckResult]: Loop: 1411#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1447#L43 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; 1452#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1462#$Ultimate##0 ~n := #in~n; 1476#L25 assume !(~n <= 0); 1466#L26 call #t~ret0 := fact(~n - 1);< 1408#$Ultimate##0 ~n := #in~n; 1478#L25 assume ~n <= 0;#res := 1; 1477#factFINAL assume true; 1464#factEXIT >#70#return; 1463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461#factFINAL assume true; 1451#factEXIT >#72#return; 1454#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1462#$Ultimate##0 ~n := #in~n; 1476#L25 assume ~n <= 0;#res := 1; 1475#factFINAL assume true; 1474#factEXIT >#74#return; 1456#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1460#$Ultimate##0 ~n := #in~n; 1468#L25 assume !(~n <= 0); 1466#L26 call #t~ret0 := fact(~n - 1);< 1408#$Ultimate##0 ~n := #in~n; 1478#L25 assume ~n <= 0;#res := 1; 1477#factFINAL assume true; 1464#factEXIT >#70#return; 1463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461#factFINAL assume true; 1451#factEXIT >#76#return; 1459#L30-3 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; 1428#binomialCoefficient_returnLabel#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; 1429#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1411#L42-3 [2024-10-12 00:13:56,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2024-10-12 00:13:56,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:56,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116762292] [2024-10-12 00:13:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:56,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:56,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:56,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:56,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:56,853 INFO L85 PathProgramCache]: Analyzing trace with hash -685225686, now seen corresponding path program 2 times [2024-10-12 00:13:56,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:56,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476285028] [2024-10-12 00:13:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:56,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:13:56,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176408062] [2024-10-12 00:13:56,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:13:56,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:13:56,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:56,871 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:13:56,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-12 00:13:56,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:13:56,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:13:56,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:56,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:56,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1931548765, now seen corresponding path program 1 times [2024-10-12 00:13:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:56,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973887588] [2024-10-12 00:13:56,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:56,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:13:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:57,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:57,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 00:13:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:13:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:57,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 00:13:57,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:13:57,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973887588] [2024-10-12 00:13:57,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973887588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:13:57,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30162949] [2024-10-12 00:13:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:57,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:13:57,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,065 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-12 00:13:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:57,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:13:57,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 00:13:57,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:13:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 00:13:57,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30162949] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:13:57,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:13:57,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2024-10-12 00:13:57,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523068010] [2024-10-12 00:13:57,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:13:57,476 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:13:57,476 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:13:57,476 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:13:57,477 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:13:57,477 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:13:57,477 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,477 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:13:57,477 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:13:57,477 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2024-10-12 00:13:57,477 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:13:57,477 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:13:57,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,554 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:13:57,554 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:13:57,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,557 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:57,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:57,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:13:57,579 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:13:57,580 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: [] [2024-10-12 00:13:57,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:57,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,597 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:13:57,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:57,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:57,610 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:13:57,610 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: [] [2024-10-12 00:13:57,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:57,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,623 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:13:57,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:57,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:57,636 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:13:57,637 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: [] [2024-10-12 00:13:57,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:57,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,648 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:13:57,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:57,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:57,661 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:13:57,661 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: [] [2024-10-12 00:13:57,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-12 00:13:57,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,672 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:13:57,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:13:57,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:57,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,700 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:13:57,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:13:57,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:13:57,717 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:13:57,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-12 00:13:57,731 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:13:57,731 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:13:57,731 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:13:57,731 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:13:57,731 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:13:57,732 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,732 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:13:57,732 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:13:57,732 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2024-10-12 00:13:57,732 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:13:57,732 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:13:57,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:13:57,812 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:13:57,812 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:13:57,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,814 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:13:57,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:57,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:57,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:57,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:57,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:57,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:57,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:57,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:57,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:13:57,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:13:57,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,848 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:13:57,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:57,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:57,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:57,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:57,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:57,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:57,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:57,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:57,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:13:57,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:13:57,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,887 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:13:57,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 [2024-10-12 00:13:57,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:57,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:57,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:57,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:57,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:57,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:57,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:57,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:13:57,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:57,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,921 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:13:57,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:13:57,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:13:57,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:13:57,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:13:57,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:13:57,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:13:57,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:13:57,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:13:57,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:13:57,942 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:13:57,942 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:13:57,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:13:57,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:57,944 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:13:57,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:13:57,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:13:57,946 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:13:57,946 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:13:57,946 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 1 Supporting invariants [] [2024-10-12 00:13:57,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:13:57,957 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:13:57,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:57,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:13:57,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:58,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:13:58,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 00:13:58,153 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 [2024-10-12 00:13:58,153 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 130 states and 193 transitions. cyclomatic complexity: 68 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 00:13:58,360 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 130 states and 193 transitions. cyclomatic complexity: 68. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 533 states and 750 transitions. Complement of second has 35 states. [2024-10-12 00:13:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-10-12 00:13:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 00:13:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2024-10-12 00:13:58,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 5 letters. Loop has 32 letters. [2024-10-12 00:13:58,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:13:58,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 37 letters. Loop has 32 letters. [2024-10-12 00:13:58,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:13:58,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 5 letters. Loop has 64 letters. [2024-10-12 00:13:58,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:13:58,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 533 states and 750 transitions. [2024-10-12 00:13:58,375 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 69 [2024-10-12 00:13:58,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 533 states to 494 states and 700 transitions. [2024-10-12 00:13:58,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2024-10-12 00:13:58,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2024-10-12 00:13:58,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 494 states and 700 transitions. [2024-10-12 00:13:58,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:13:58,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 494 states and 700 transitions. [2024-10-12 00:13:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states and 700 transitions. [2024-10-12 00:13:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 469. [2024-10-12 00:13:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 299 states have (on average 1.1772575250836121) internal successors, (352), 302 states have internal predecessors, (352), 118 states have call successors, (118), 45 states have call predecessors, (118), 52 states have return successors, (180), 121 states have call predecessors, (180), 116 states have call successors, (180) [2024-10-12 00:13:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 650 transitions. [2024-10-12 00:13:58,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 469 states and 650 transitions. [2024-10-12 00:13:58,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:13:58,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 00:13:58,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-12 00:13:58,455 INFO L87 Difference]: Start difference. First operand 469 states and 650 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) [2024-10-12 00:13:58,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-12 00:13:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:13:58,587 INFO L93 Difference]: Finished difference Result 438 states and 609 transitions. [2024-10-12 00:13:58,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 609 transitions. [2024-10-12 00:13:58,591 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 61 [2024-10-12 00:13:58,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 423 states and 587 transitions. [2024-10-12 00:13:58,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2024-10-12 00:13:58,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2024-10-12 00:13:58,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 423 states and 587 transitions. [2024-10-12 00:13:58,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:13:58,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 423 states and 587 transitions. [2024-10-12 00:13:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states and 587 transitions. [2024-10-12 00:13:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 400. [2024-10-12 00:13:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 258 states have (on average 1.189922480620155) internal successors, (307), 263 states have internal predecessors, (307), 98 states have call successors, (98), 41 states have call predecessors, (98), 44 states have return successors, (141), 95 states have call predecessors, (141), 96 states have call successors, (141) [2024-10-12 00:13:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 546 transitions. [2024-10-12 00:13:58,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 400 states and 546 transitions. [2024-10-12 00:13:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:13:58,614 INFO L425 stractBuchiCegarLoop]: Abstraction has 400 states and 546 transitions. [2024-10-12 00:13:58,614 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:13:58,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 400 states and 546 transitions. [2024-10-12 00:13:58,617 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 61 [2024-10-12 00:13:58,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:58,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:58,618 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:13:58,618 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:13:58,618 INFO L745 eck$LassoCheckResult]: Stem: 3457#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3409#L-1 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; 3410#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 3428#L38 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; 3458#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 3445#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3433#L43 [2024-10-12 00:13:58,618 INFO L747 eck$LassoCheckResult]: Loop: 3433#L43 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; 3374#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3375#$Ultimate##0 ~n := #in~n; 3531#L25 assume !(~n <= 0); 3437#L26 call #t~ret0 := fact(~n - 1);< 3416#$Ultimate##0 ~n := #in~n; 3627#L25 assume ~n <= 0;#res := 1; 3441#factFINAL assume true; 3514#factEXIT >#70#return; 3515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3548#factFINAL assume true; 3546#factEXIT >#78#return; 3518#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3375#$Ultimate##0 ~n := #in~n; 3531#L25 assume !(~n <= 0); 3437#L26 call #t~ret0 := fact(~n - 1);< 3416#$Ultimate##0 ~n := #in~n; 3627#L25 assume ~n <= 0;#res := 1; 3441#factFINAL assume true; 3514#factEXIT >#70#return; 3515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3548#factFINAL assume true; 3546#factEXIT >#80#return; 3519#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3547#$Ultimate##0 ~n := #in~n; 3580#L25 assume !(~n <= 0); 3437#L26 call #t~ret0 := fact(~n - 1);< 3416#$Ultimate##0 ~n := #in~n; 3627#L25 assume ~n <= 0;#res := 1; 3441#factFINAL assume true; 3514#factEXIT >#70#return; 3515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3548#factFINAL assume true; 3546#factEXIT >#82#return; 3545#L30-8 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; 3468#binomialCoefficient_returnLabel#2 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; 3467#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3466#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3433#L43 [2024-10-12 00:13:58,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 1 times [2024-10-12 00:13:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:58,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217731939] [2024-10-12 00:13:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:58,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:58,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:58,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1720459068, now seen corresponding path program 1 times [2024-10-12 00:13:58,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:58,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854951898] [2024-10-12 00:13:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:58,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:13:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:58,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:13:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:58,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:13:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:58,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-12 00:13:58,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:13:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854951898] [2024-10-12 00:13:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854951898] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:13:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541249990] [2024-10-12 00:13:58,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:58,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:13:58,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:58,801 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:13:58,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-10-12 00:13:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:58,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:13:58,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 00:13:58,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:13:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 00:13:59,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541249990] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:13:59,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:13:59,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2024-10-12 00:13:59,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979756982] [2024-10-12 00:13:59,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:13:59,133 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:13:59,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:13:59,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 00:13:59,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-10-12 00:13:59,134 INFO L87 Difference]: Start difference. First operand 400 states and 546 transitions. cyclomatic complexity: 163 Second operand has 17 states, 13 states have (on average 3.0) internal successors, (39), 15 states have internal predecessors, (39), 11 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-12 00:13:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:13:59,412 INFO L93 Difference]: Finished difference Result 602 states and 872 transitions. [2024-10-12 00:13:59,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 602 states and 872 transitions. [2024-10-12 00:13:59,419 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 90 [2024-10-12 00:13:59,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 602 states to 602 states and 872 transitions. [2024-10-12 00:13:59,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2024-10-12 00:13:59,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2024-10-12 00:13:59,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 602 states and 872 transitions. [2024-10-12 00:13:59,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:13:59,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 602 states and 872 transitions. [2024-10-12 00:13:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states and 872 transitions. [2024-10-12 00:13:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 484. [2024-10-12 00:13:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 312 states have (on average 1.1570512820512822) internal successors, (361), 311 states have internal predecessors, (361), 110 states have call successors, (110), 53 states have call predecessors, (110), 62 states have return successors, (231), 119 states have call predecessors, (231), 108 states have call successors, (231) [2024-10-12 00:13:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 702 transitions. [2024-10-12 00:13:59,446 INFO L240 hiAutomatonCegarLoop]: Abstraction has 484 states and 702 transitions. [2024-10-12 00:13:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 00:13:59,447 INFO L425 stractBuchiCegarLoop]: Abstraction has 484 states and 702 transitions. [2024-10-12 00:13:59,447 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:13:59,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 484 states and 702 transitions. [2024-10-12 00:13:59,450 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 65 [2024-10-12 00:13:59,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:13:59,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:13:59,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:13:59,451 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:13:59,451 INFO L745 eck$LassoCheckResult]: Stem: 4753#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4695#L-1 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; 4696#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4720#L38 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; 4707#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4708#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4759#L43 [2024-10-12 00:13:59,452 INFO L747 eck$LassoCheckResult]: Loop: 4759#L43 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; 4675#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4817#$Ultimate##0 ~n := #in~n; 4959#L25 assume !(~n <= 0); 4826#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume !(~n <= 0); 4825#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume ~n <= 0;#res := 1; 4833#factFINAL assume true; 4830#factEXIT >#70#return; 4829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4907#factFINAL assume true; 4822#factEXIT >#70#return; 4820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4815#factFINAL assume true; 4816#factEXIT >#78#return; 4676#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4817#$Ultimate##0 ~n := #in~n; 4959#L25 assume !(~n <= 0); 4826#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume !(~n <= 0); 4825#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume ~n <= 0;#res := 1; 4833#factFINAL assume true; 4830#factEXIT >#70#return; 4829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4907#factFINAL assume true; 4822#factEXIT >#70#return; 4820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4815#factFINAL assume true; 4816#factEXIT >#80#return; 4678#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4773#$Ultimate##0 ~n := #in~n; 4832#L25 assume !(~n <= 0); 4826#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume !(~n <= 0); 4825#L26 call #t~ret0 := fact(~n - 1);< 4704#$Ultimate##0 ~n := #in~n; 4837#L25 assume ~n <= 0;#res := 1; 4833#factFINAL assume true; 4830#factEXIT >#70#return; 4829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4907#factFINAL assume true; 4822#factEXIT >#70#return; 4820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4815#factFINAL assume true; 4816#factEXIT >#82#return; 4769#L30-8 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; 4765#binomialCoefficient_returnLabel#2 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; 4766#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4758#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4759#L43 [2024-10-12 00:13:59,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 2 times [2024-10-12 00:13:59,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:59,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936930214] [2024-10-12 00:13:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:59,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:13:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:13:59,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:13:59,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:13:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1714569788, now seen corresponding path program 2 times [2024-10-12 00:13:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:13:59,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982678509] [2024-10-12 00:13:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:13:59,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:13:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:13:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 00:13:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 00:13:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:13:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:13:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 10 proven. 95 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-12 00:13:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:13:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982678509] [2024-10-12 00:13:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982678509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:13:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090770580] [2024-10-12 00:13:59,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:13:59,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:13:59,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:13:59,816 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:13:59,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-10-12 00:13:59,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:13:59,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:13:59,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:13:59,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:13:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 95 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 00:13:59,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 7 proven. 111 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 00:14:00,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090770580] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:00,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 14] total 22 [2024-10-12 00:14:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525894286] [2024-10-12 00:14:00,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:00,402 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:00,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 00:14:00,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-10-12 00:14:00,403 INFO L87 Difference]: Start difference. First operand 484 states and 702 transitions. cyclomatic complexity: 235 Second operand has 22 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 13 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2024-10-12 00:14:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:00,797 INFO L93 Difference]: Finished difference Result 760 states and 1180 transitions. [2024-10-12 00:14:00,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 760 states and 1180 transitions. [2024-10-12 00:14:00,808 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 102 [2024-10-12 00:14:00,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 760 states to 760 states and 1180 transitions. [2024-10-12 00:14:00,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2024-10-12 00:14:00,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2024-10-12 00:14:00,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 760 states and 1180 transitions. [2024-10-12 00:14:00,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:00,819 INFO L218 hiAutomatonCegarLoop]: Abstraction has 760 states and 1180 transitions. [2024-10-12 00:14:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states and 1180 transitions. [2024-10-12 00:14:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 598. [2024-10-12 00:14:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 384 states have (on average 1.1588541666666667) internal successors, (445), 377 states have internal predecessors, (445), 134 states have call successors, (134), 71 states have call predecessors, (134), 80 states have return successors, (345), 149 states have call predecessors, (345), 132 states have call successors, (345) [2024-10-12 00:14:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 924 transitions. [2024-10-12 00:14:00,851 INFO L240 hiAutomatonCegarLoop]: Abstraction has 598 states and 924 transitions. [2024-10-12 00:14:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 00:14:00,852 INFO L425 stractBuchiCegarLoop]: Abstraction has 598 states and 924 transitions. [2024-10-12 00:14:00,853 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:14:00,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 598 states and 924 transitions. [2024-10-12 00:14:00,857 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 69 [2024-10-12 00:14:00,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:00,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:00,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:14:00,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:00,859 INFO L745 eck$LassoCheckResult]: Stem: 6459#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 6408#L-1 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; 6409#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 6432#L38 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; 6419#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 6420#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6466#L43 [2024-10-12 00:14:00,859 INFO L747 eck$LassoCheckResult]: Loop: 6466#L43 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; 6482#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 6513#$Ultimate##0 ~n := #in~n; 6537#L25 assume !(~n <= 0); 6524#L26 call #t~ret0 := fact(~n - 1);< 6534#$Ultimate##0 ~n := #in~n; 6535#L25 assume !(~n <= 0); 6527#L26 call #t~ret0 := fact(~n - 1);< 6534#$Ultimate##0 ~n := #in~n; 6535#L25 assume !(~n <= 0); 6527#L26 call #t~ret0 := fact(~n - 1);< 6534#$Ultimate##0 ~n := #in~n; 6535#L25 assume ~n <= 0;#res := 1; 6532#factFINAL assume true; 6520#factEXIT >#70#return; 6530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6555#factFINAL assume true; 6547#factEXIT >#70#return; 6549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6560#factFINAL assume true; 6553#factEXIT >#70#return; 6551#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6546#factFINAL assume true; 6479#factEXIT >#78#return; 6481#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 6513#$Ultimate##0 ~n := #in~n; 6537#L25 assume !(~n <= 0); 6524#L26 call #t~ret0 := fact(~n - 1);< 6534#$Ultimate##0 ~n := #in~n; 6535#L25 assume ~n <= 0;#res := 1; 6532#factFINAL assume true; 6520#factEXIT >#70#return; 6519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6517#factFINAL assume true; 6514#factEXIT >#80#return; 6480#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 6504#$Ultimate##0 ~n := #in~n; 6536#L25 assume !(~n <= 0); 6524#L26 call #t~ret0 := fact(~n - 1);< 6534#$Ultimate##0 ~n := #in~n; 6535#L25 assume ~n <= 0;#res := 1; 6532#factFINAL assume true; 6520#factEXIT >#70#return; 6519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6517#factFINAL assume true; 6514#factEXIT >#82#return; 6483#L30-8 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; 6471#binomialCoefficient_returnLabel#2 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; 6472#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6465#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6466#L43 [2024-10-12 00:14:00,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 3 times [2024-10-12 00:14:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:00,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436684377] [2024-10-12 00:14:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:00,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:00,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:00,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:00,866 INFO L85 PathProgramCache]: Analyzing trace with hash 594068860, now seen corresponding path program 3 times [2024-10-12 00:14:00,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:00,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596385742] [2024-10-12 00:14:00,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:00,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:14:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 00:14:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 00:14:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 00:14:01,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596385742] [2024-10-12 00:14:01,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596385742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116664867] [2024-10-12 00:14:01,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:01,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:01,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:01,165 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:01,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-10-12 00:14:01,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-12 00:14:01,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:01,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:14:01,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 59 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-12 00:14:01,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 67 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 00:14:01,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116664867] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:01,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:01,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 14] total 25 [2024-10-12 00:14:01,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150828968] [2024-10-12 00:14:01,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:01,882 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:01,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:01,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 00:14:01,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2024-10-12 00:14:01,882 INFO L87 Difference]: Start difference. First operand 598 states and 924 transitions. cyclomatic complexity: 343 Second operand has 25 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) [2024-10-12 00:14:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:02,381 INFO L93 Difference]: Finished difference Result 892 states and 1388 transitions. [2024-10-12 00:14:02,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 892 states and 1388 transitions. [2024-10-12 00:14:02,390 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 135 [2024-10-12 00:14:02,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 892 states to 892 states and 1388 transitions. [2024-10-12 00:14:02,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2024-10-12 00:14:02,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2024-10-12 00:14:02,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1388 transitions. [2024-10-12 00:14:02,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:02,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 892 states and 1388 transitions. [2024-10-12 00:14:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1388 transitions. [2024-10-12 00:14:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 666. [2024-10-12 00:14:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 420 states have (on average 1.1452380952380952) internal successors, (481), 407 states have internal predecessors, (481), 166 states have call successors, (166), 89 states have call predecessors, (166), 80 states have return successors, (417), 169 states have call predecessors, (417), 164 states have call successors, (417) [2024-10-12 00:14:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1064 transitions. [2024-10-12 00:14:02,427 INFO L240 hiAutomatonCegarLoop]: Abstraction has 666 states and 1064 transitions. [2024-10-12 00:14:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 00:14:02,428 INFO L425 stractBuchiCegarLoop]: Abstraction has 666 states and 1064 transitions. [2024-10-12 00:14:02,428 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:14:02,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 666 states and 1064 transitions. [2024-10-12 00:14:02,432 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 77 [2024-10-12 00:14:02,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:02,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:02,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:14:02,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:02,433 INFO L745 eck$LassoCheckResult]: Stem: 8367#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 8309#L-1 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; 8310#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 8332#L38 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; 8368#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 8423#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 8376#L43 [2024-10-12 00:14:02,434 INFO L747 eck$LassoCheckResult]: Loop: 8376#L43 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; 8274#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 8275#$Ultimate##0 ~n := #in~n; 8619#L25 assume !(~n <= 0); 8562#L26 call #t~ret0 := fact(~n - 1);< 8570#$Ultimate##0 ~n := #in~n; 8581#L25 assume !(~n <= 0); 8564#L26 call #t~ret0 := fact(~n - 1);< 8570#$Ultimate##0 ~n := #in~n; 8581#L25 assume !(~n <= 0); 8564#L26 call #t~ret0 := fact(~n - 1);< 8570#$Ultimate##0 ~n := #in~n; 8581#L25 assume ~n <= 0;#res := 1; 8578#factFINAL assume true; 8601#factEXIT >#70#return; 8579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8580#factFINAL assume true; 8561#factEXIT >#70#return; 8569#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8571#factFINAL assume true; 8572#factEXIT >#70#return; 8599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8596#factFINAL assume true; 8598#factEXIT >#78#return; 8594#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 8275#$Ultimate##0 ~n := #in~n; 8619#L25 assume !(~n <= 0); 8562#L26 call #t~ret0 := fact(~n - 1);< 8570#$Ultimate##0 ~n := #in~n; 8581#L25 assume !(~n <= 0); 8564#L26 call #t~ret0 := fact(~n - 1);< 8570#$Ultimate##0 ~n := #in~n; 8581#L25 assume ~n <= 0;#res := 1; 8578#factFINAL assume true; 8601#factEXIT >#70#return; 8579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8580#factFINAL assume true; 8561#factEXIT >#70#return; 8567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8613#factFINAL assume true; 8614#factEXIT >#80#return; 8597#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 8623#$Ultimate##0 ~n := #in~n; 8624#L25 assume !(~n <= 0); 8562#L26 call #t~ret0 := fact(~n - 1);< 8570#$Ultimate##0 ~n := #in~n; 8581#L25 assume !(~n <= 0); 8564#L26 call #t~ret0 := fact(~n - 1);< 8570#$Ultimate##0 ~n := #in~n; 8581#L25 assume ~n <= 0;#res := 1; 8578#factFINAL assume true; 8601#factEXIT >#70#return; 8579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8580#factFINAL assume true; 8561#factEXIT >#70#return; 8567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 8613#factFINAL assume true; 8614#factEXIT >#82#return; 8678#L30-8 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; 8382#binomialCoefficient_returnLabel#2 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; 8383#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8375#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 8376#L43 [2024-10-12 00:14:02,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:02,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 4 times [2024-10-12 00:14:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:02,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761213437] [2024-10-12 00:14:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:02,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:02,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:02,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1713692996, now seen corresponding path program 4 times [2024-10-12 00:14:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:02,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314988088] [2024-10-12 00:14:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:14:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 00:14:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 00:14:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 32 proven. 97 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-12 00:14:02,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:02,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314988088] [2024-10-12 00:14:02,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314988088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:02,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381362730] [2024-10-12 00:14:02,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:02,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:02,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:02,786 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:02,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-10-12 00:14:02,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:02,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:02,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 00:14:02,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 128 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-12 00:14:02,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 141 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-12 00:14:03,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381362730] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:03,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:03,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 16] total 28 [2024-10-12 00:14:03,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880042009] [2024-10-12 00:14:03,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:03,663 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:03,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:03,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 00:14:03,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2024-10-12 00:14:03,664 INFO L87 Difference]: Start difference. First operand 666 states and 1064 transitions. cyclomatic complexity: 415 Second operand has 28 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 19 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-12 00:14:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:04,203 INFO L93 Difference]: Finished difference Result 1080 states and 1860 transitions. [2024-10-12 00:14:04,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1080 states and 1860 transitions. [2024-10-12 00:14:04,216 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2024-10-12 00:14:04,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1080 states to 1080 states and 1860 transitions. [2024-10-12 00:14:04,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 353 [2024-10-12 00:14:04,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 353 [2024-10-12 00:14:04,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1080 states and 1860 transitions. [2024-10-12 00:14:04,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:04,231 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1080 states and 1860 transitions. [2024-10-12 00:14:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states and 1860 transitions. [2024-10-12 00:14:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 804. [2024-10-12 00:14:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 496 states have (on average 1.1310483870967742) internal successors, (561), 471 states have internal predecessors, (561), 206 states have call successors, (206), 105 states have call predecessors, (206), 102 states have return successors, (647), 227 states have call predecessors, (647), 204 states have call successors, (647) [2024-10-12 00:14:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1414 transitions. [2024-10-12 00:14:04,272 INFO L240 hiAutomatonCegarLoop]: Abstraction has 804 states and 1414 transitions. [2024-10-12 00:14:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-12 00:14:04,273 INFO L425 stractBuchiCegarLoop]: Abstraction has 804 states and 1414 transitions. [2024-10-12 00:14:04,273 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:14:04,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 804 states and 1414 transitions. [2024-10-12 00:14:04,278 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 90 [2024-10-12 00:14:04,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:04,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:04,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:14:04,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:04,280 INFO L745 eck$LassoCheckResult]: Stem: 10637#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 10586#L-1 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; 10587#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 10606#L38 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; 10638#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 10678#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10611#L43 [2024-10-12 00:14:04,280 INFO L747 eck$LassoCheckResult]: Loop: 10611#L43 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; 10552#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10553#$Ultimate##0 ~n := #in~n; 11017#L25 assume !(~n <= 0); 10968#L26 call #t~ret0 := fact(~n - 1);< 10983#$Ultimate##0 ~n := #in~n; 11012#L25 assume !(~n <= 0); 10972#L26 call #t~ret0 := fact(~n - 1);< 10983#$Ultimate##0 ~n := #in~n; 11012#L25 assume !(~n <= 0); 10972#L26 call #t~ret0 := fact(~n - 1);< 10983#$Ultimate##0 ~n := #in~n; 11012#L25 assume ~n <= 0;#res := 1; 10978#factFINAL assume true; 10967#factEXIT >#70#return; 10976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11006#factFINAL assume true; 10990#factEXIT >#70#return; 10993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11000#factFINAL assume true; 10997#factEXIT >#70#return; 10998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11030#factFINAL assume true; 10556#factEXIT >#78#return; 10560#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10553#$Ultimate##0 ~n := #in~n; 11017#L25 assume !(~n <= 0); 10968#L26 call #t~ret0 := fact(~n - 1);< 10983#$Ultimate##0 ~n := #in~n; 11012#L25 assume !(~n <= 0); 10972#L26 call #t~ret0 := fact(~n - 1);< 10983#$Ultimate##0 ~n := #in~n; 11012#L25 assume !(~n <= 0); 10972#L26 call #t~ret0 := fact(~n - 1);< 10983#$Ultimate##0 ~n := #in~n; 11012#L25 assume !(~n <= 0); 10972#L26 call #t~ret0 := fact(~n - 1);< 10983#$Ultimate##0 ~n := #in~n; 11012#L25 assume ~n <= 0;#res := 1; 10978#factFINAL assume true; 10967#factEXIT >#70#return; 10976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11006#factFINAL assume true; 10990#factEXIT >#70#return; 10993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11000#factFINAL assume true; 10997#factEXIT >#70#return; 10999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11020#factFINAL assume true; 11004#factEXIT >#70#return; 11005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11026#factFINAL assume true; 11025#factEXIT >#80#return; 10562#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10639#$Ultimate##0 ~n := #in~n; 11021#L25 assume !(~n <= 0); 10971#L26 call #t~ret0 := fact(~n - 1);< 10977#$Ultimate##0 ~n := #in~n; 10980#L25 assume ~n <= 0;#res := 1; 10978#factFINAL assume true; 10967#factEXIT >#70#return; 10974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11027#factFINAL assume true; 11023#factEXIT >#82#return; 10561#L30-8 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; 10588#binomialCoefficient_returnLabel#2 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; 10648#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10643#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10611#L43 [2024-10-12 00:14:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 5 times [2024-10-12 00:14:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971593418] [2024-10-12 00:14:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:04,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:04,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:04,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1772918468, now seen corresponding path program 5 times [2024-10-12 00:14:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:04,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545790597] [2024-10-12 00:14:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:14:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 00:14:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 00:14:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 29 proven. 141 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 00:14:04,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:04,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545790597] [2024-10-12 00:14:04,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545790597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:04,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418853746] [2024-10-12 00:14:04,614 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:14:04,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:04,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:04,616 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:04,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-10-12 00:14:04,693 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-10-12 00:14:04,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:04,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 00:14:04,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 34 proven. 158 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-12 00:14:04,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 34 proven. 173 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-12 00:14:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418853746] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:05,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:05,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 18] total 30 [2024-10-12 00:14:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980120506] [2024-10-12 00:14:05,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:05,575 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:05,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:05,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 00:14:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2024-10-12 00:14:05,576 INFO L87 Difference]: Start difference. First operand 804 states and 1414 transitions. cyclomatic complexity: 627 Second operand has 30 states, 25 states have (on average 2.16) internal successors, (54), 21 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (26), 18 states have call predecessors, (26), 17 states have call successors, (26) [2024-10-12 00:14:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:06,292 INFO L93 Difference]: Finished difference Result 1162 states and 2042 transitions. [2024-10-12 00:14:06,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1162 states and 2042 transitions. [2024-10-12 00:14:06,303 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 151 [2024-10-12 00:14:06,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1162 states to 1162 states and 2042 transitions. [2024-10-12 00:14:06,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2024-10-12 00:14:06,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2024-10-12 00:14:06,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1162 states and 2042 transitions. [2024-10-12 00:14:06,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:06,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1162 states and 2042 transitions. [2024-10-12 00:14:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states and 2042 transitions. [2024-10-12 00:14:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 886. [2024-10-12 00:14:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 548 states have (on average 1.1514598540145986) internal successors, (631), 519 states have internal predecessors, (631), 232 states have call successors, (232), 127 states have call predecessors, (232), 106 states have return successors, (669), 239 states have call predecessors, (669), 230 states have call successors, (669) [2024-10-12 00:14:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1532 transitions. [2024-10-12 00:14:06,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 886 states and 1532 transitions. [2024-10-12 00:14:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-12 00:14:06,353 INFO L425 stractBuchiCegarLoop]: Abstraction has 886 states and 1532 transitions. [2024-10-12 00:14:06,353 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:14:06,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 886 states and 1532 transitions. [2024-10-12 00:14:06,358 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 93 [2024-10-12 00:14:06,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:06,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:06,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:14:06,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:06,360 INFO L745 eck$LassoCheckResult]: Stem: 13217#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 13172#L-1 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; 13173#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 13195#L38 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; 13218#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 13273#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13227#L43 [2024-10-12 00:14:06,360 INFO L747 eck$LassoCheckResult]: Loop: 13227#L43 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; 13433#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13893#$Ultimate##0 ~n := #in~n; 13920#L25 assume !(~n <= 0); 13851#L26 call #t~ret0 := fact(~n - 1);< 13858#$Ultimate##0 ~n := #in~n; 13875#L25 assume !(~n <= 0); 13847#L26 call #t~ret0 := fact(~n - 1);< 13858#$Ultimate##0 ~n := #in~n; 13875#L25 assume !(~n <= 0); 13847#L26 call #t~ret0 := fact(~n - 1);< 13858#$Ultimate##0 ~n := #in~n; 13875#L25 assume ~n <= 0;#res := 1; 13872#factFINAL assume true; 13863#factEXIT >#70#return; 13862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13859#factFINAL assume true; 13846#factEXIT >#70#return; 13855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13928#factFINAL assume true; 13886#factEXIT >#70#return; 13889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13896#factFINAL assume true; 13892#factEXIT >#78#return; 13430#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 13891#$Ultimate##0 ~n := #in~n; 13918#L25 assume ~n <= 0;#res := 1; 13914#factFINAL assume true; 13910#factEXIT >#80#return; 13431#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 13907#$Ultimate##0 ~n := #in~n; 13906#L25 assume !(~n <= 0); 13852#L26 call #t~ret0 := fact(~n - 1);< 13860#$Ultimate##0 ~n := #in~n; 13873#L25 assume !(~n <= 0); 13847#L26 call #t~ret0 := fact(~n - 1);< 13858#$Ultimate##0 ~n := #in~n; 13875#L25 assume !(~n <= 0); 13847#L26 call #t~ret0 := fact(~n - 1);< 13858#$Ultimate##0 ~n := #in~n; 13875#L25 assume ~n <= 0;#res := 1; 13872#factFINAL assume true; 13863#factEXIT >#70#return; 13862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13859#factFINAL assume true; 13846#factEXIT >#70#return; 13855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13928#factFINAL assume true; 13886#factEXIT >#70#return; 13889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13896#factFINAL assume true; 13892#factEXIT >#82#return; 13436#L30-8 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; 13232#binomialCoefficient_returnLabel#2 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; 13233#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13226#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13227#L43 [2024-10-12 00:14:06,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 6 times [2024-10-12 00:14:06,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:06,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028722527] [2024-10-12 00:14:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:06,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:06,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:06,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:06,366 INFO L85 PathProgramCache]: Analyzing trace with hash 790558460, now seen corresponding path program 6 times [2024-10-12 00:14:06,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:06,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969772618] [2024-10-12 00:14:06,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:06,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110555939] [2024-10-12 00:14:06,375 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:14:06,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:06,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:06,379 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:06,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-10-12 00:14:06,511 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-10-12 00:14:06,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:14:06,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:06,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:06,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1121118571, now seen corresponding path program 1 times [2024-10-12 00:14:06,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:06,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640132211] [2024-10-12 00:14:06,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:06,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 00:14:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 00:14:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-12 00:14:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:06,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640132211] [2024-10-12 00:14:06,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640132211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:06,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:06,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:14:06,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720957166] [2024-10-12 00:14:06,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:06,999 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:06,999 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:06,999 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:06,999 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:06,999 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:06,999 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,000 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:07,000 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:07,000 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2024-10-12 00:14:07,000 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:07,000 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:07,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,062 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:07,062 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:07,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,064 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:14:07,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:07,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:07,076 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:07,076 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: [] [2024-10-12 00:14:07,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-12 00:14:07,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,089 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:14:07,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:07,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:07,107 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:07,107 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: [] [2024-10-12 00:14:07,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:07,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,119 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-12 00:14:07,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:07,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:07,132 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:07,133 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: [] [2024-10-12 00:14:07,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-12 00:14:07,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,145 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:14:07,148 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:07,148 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:07,159 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:07,159 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: [] [2024-10-12 00:14:07,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:07,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,171 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:14:07,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:07,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:07,183 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:07,183 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: [] [2024-10-12 00:14:07,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-12 00:14:07,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,196 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:14:07,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:07,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:07,208 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:07,209 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: [] [2024-10-12 00:14:07,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-12 00:14:07,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,221 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-12 00:14:07,222 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:07,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:07,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-12 00:14:07,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,245 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-12 00:14:07,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:07,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:07,259 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:07,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-12 00:14:07,272 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:07,272 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:07,272 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:07,272 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:07,272 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:07,272 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,272 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:07,272 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:07,272 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2024-10-12 00:14:07,272 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:07,272 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:07,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:07,347 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:07,347 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:07,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,352 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 00:14:07,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:07,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:07,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:07,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:07,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:07,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:07,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:07,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:07,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:07,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:07,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,386 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-12 00:14:07,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:07,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:07,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:07,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:07,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:07,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:07,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:07,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:07,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:07,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:07,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,413 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-12 00:14:07,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:07,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:07,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:07,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:07,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:07,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:07,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:07,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:07,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:07,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-12 00:14:07,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,438 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-12 00:14:07,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:07,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:07,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:07,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:07,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:07,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:07,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:07,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:07,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:07,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-12 00:14:07,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,462 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-12 00:14:07,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:07,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:07,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:07,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:07,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:07,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:07,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:07,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:07,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:07,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-12 00:14:07,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,488 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-12 00:14:07,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:07,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:07,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:07,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:07,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:07,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:07,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:07,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:07,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:07,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:07,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,514 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 00:14:07,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:07,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:07,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:07,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:07,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:07,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:07,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:07,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:07,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:07,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-12 00:14:07,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,539 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 00:14:07,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:07,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:07,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:07,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:07,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:07,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:07,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:07,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:07,553 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:07,556 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:07,556 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:07,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:07,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:07,557 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:07,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 00:14:07,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:07,559 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:07,559 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:07,559 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2024-10-12 00:14:07,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-12 00:14:07,570 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:07,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:07,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 00:14:07,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-12 00:14:07,872 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2024-10-12 00:14:07,872 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 886 states and 1532 transitions. cyclomatic complexity: 663 Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 00:14:08,232 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 886 states and 1532 transitions. cyclomatic complexity: 663. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Result 2127 states and 3381 transitions. Complement of second has 65 states. [2024-10-12 00:14:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 00:14:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2024-10-12 00:14:08,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 78 transitions. Stem has 6 letters. Loop has 56 letters. [2024-10-12 00:14:08,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:08,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 78 transitions. Stem has 62 letters. Loop has 56 letters. [2024-10-12 00:14:08,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:08,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 78 transitions. Stem has 6 letters. Loop has 112 letters. [2024-10-12 00:14:08,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:08,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2127 states and 3381 transitions. [2024-10-12 00:14:08,256 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 78 [2024-10-12 00:14:08,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2127 states to 1402 states and 2284 transitions. [2024-10-12 00:14:08,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2024-10-12 00:14:08,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 311 [2024-10-12 00:14:08,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1402 states and 2284 transitions. [2024-10-12 00:14:08,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:08,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1402 states and 2284 transitions. [2024-10-12 00:14:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states and 2284 transitions. [2024-10-12 00:14:08,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-12 00:14:08,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1110. [2024-10-12 00:14:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 694 states have (on average 1.1455331412103746) internal successors, (795), 668 states have internal predecessors, (795), 265 states have call successors, (265), 147 states have call predecessors, (265), 151 states have return successors, (768), 294 states have call predecessors, (768), 259 states have call successors, (768) [2024-10-12 00:14:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1828 transitions. [2024-10-12 00:14:08,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1110 states and 1828 transitions. [2024-10-12 00:14:08,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:08,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:14:08,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:14:08,365 INFO L87 Difference]: Start difference. First operand 1110 states and 1828 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) [2024-10-12 00:14:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:08,413 INFO L93 Difference]: Finished difference Result 925 states and 1516 transitions. [2024-10-12 00:14:08,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 925 states and 1516 transitions. [2024-10-12 00:14:08,421 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 72 [2024-10-12 00:14:08,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 925 states to 925 states and 1516 transitions. [2024-10-12 00:14:08,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 236 [2024-10-12 00:14:08,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2024-10-12 00:14:08,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 925 states and 1516 transitions. [2024-10-12 00:14:08,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:08,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 925 states and 1516 transitions. [2024-10-12 00:14:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states and 1516 transitions. [2024-10-12 00:14:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 921. [2024-10-12 00:14:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 576 states have (on average 1.1388888888888888) internal successors, (656), 554 states have internal predecessors, (656), 221 states have call successors, (221), 123 states have call predecessors, (221), 124 states have return successors, (635), 243 states have call predecessors, (635), 215 states have call successors, (635) [2024-10-12 00:14:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1512 transitions. [2024-10-12 00:14:08,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 921 states and 1512 transitions. [2024-10-12 00:14:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:14:08,460 INFO L425 stractBuchiCegarLoop]: Abstraction has 921 states and 1512 transitions. [2024-10-12 00:14:08,460 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:14:08,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 921 states and 1512 transitions. [2024-10-12 00:14:08,465 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 71 [2024-10-12 00:14:08,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:08,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:08,467 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:08,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:14:08,467 INFO L745 eck$LassoCheckResult]: Stem: 18648#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 18595#L-1 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; 18596#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 18618#L38 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; 18606#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 18608#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18637#L43 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; 18589#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18590#$Ultimate##0 ~n := #in~n; 18821#L25 assume !(~n <= 0); 18601#L26 call #t~ret0 := fact(~n - 1);< 18603#$Ultimate##0 [2024-10-12 00:14:08,467 INFO L747 eck$LassoCheckResult]: Loop: 18603#$Ultimate##0 ~n := #in~n; 18853#L25 assume !(~n <= 0); 18832#L26 call #t~ret0 := fact(~n - 1);< 18603#$Ultimate##0 [2024-10-12 00:14:08,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash 271742545, now seen corresponding path program 1 times [2024-10-12 00:14:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:08,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149329895] [2024-10-12 00:14:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:08,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:08,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:08,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149329895] [2024-10-12 00:14:08,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149329895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:08,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:08,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 00:14:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175297109] [2024-10-12 00:14:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:08,500 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:08,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2024-10-12 00:14:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:08,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401723054] [2024-10-12 00:14:08,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:08,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:08,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:08,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:08,530 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:08,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:08,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:08,530 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:08,530 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:08,530 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:08,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:08,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2024-10-12 00:14:08,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:08,530 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:08,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,560 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:08,560 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:08,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,561 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-12 00:14:08,563 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:08,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,574 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:08,574 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:08,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:08,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,586 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-12 00:14:08,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:08,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,598 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:08,598 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:08,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-12 00:14:08,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,610 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-12 00:14:08,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:08,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-12 00:14:08,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,634 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-12 00:14:08,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:08,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:08,686 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:08,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-10-12 00:14:08,691 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:08,691 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:08,691 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:08,691 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:08,691 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:08,691 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,691 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:08,691 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:08,691 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2024-10-12 00:14:08,692 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:08,692 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:08,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:08,715 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:08,715 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:08,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,717 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-12 00:14:08,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:08,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:08,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:08,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:08,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:08,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:08,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:08,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:08,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:08,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-12 00:14:08,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,742 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-12 00:14:08,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:08,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:08,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:08,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:08,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:08,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:08,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:08,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:08,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:08,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-12 00:14:08,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,766 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-12 00:14:08,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:08,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:08,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:08,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:08,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:08,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:08,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:08,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:08,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:08,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-12 00:14:08,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,791 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-12 00:14:08,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:08,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:08,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:08,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:08,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:08,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:08,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:08,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:08,807 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:08,808 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:08,808 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:08,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:08,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:08,810 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:08,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-12 00:14:08,813 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:08,813 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:08,813 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:08,813 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2024-10-12 00:14:08,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:08,824 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:08,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:08,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:08,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:08,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:14:08,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:08,878 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 00:14:08,878 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 921 states and 1512 transitions. cyclomatic complexity: 608 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) [2024-10-12 00:14:08,930 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 921 states and 1512 transitions. cyclomatic complexity: 608. 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 1192 states and 1964 transitions. Complement of second has 17 states. [2024-10-12 00:14:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:08,932 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) [2024-10-12 00:14:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2024-10-12 00:14:08,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 11 letters. Loop has 3 letters. [2024-10-12 00:14:08,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:08,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-12 00:14:08,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:08,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 11 letters. Loop has 6 letters. [2024-10-12 00:14:08,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:08,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1192 states and 1964 transitions. [2024-10-12 00:14:08,943 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 71 [2024-10-12 00:14:08,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1192 states to 1133 states and 1897 transitions. [2024-10-12 00:14:08,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2024-10-12 00:14:08,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2024-10-12 00:14:08,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1133 states and 1897 transitions. [2024-10-12 00:14:08,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:08,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1133 states and 1897 transitions. [2024-10-12 00:14:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states and 1897 transitions. [2024-10-12 00:14:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1123. [2024-10-12 00:14:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 700 states have (on average 1.1542857142857144) internal successors, (808), 701 states have internal predecessors, (808), 271 states have call successors, (271), 161 states have call predecessors, (271), 152 states have return successors, (788), 260 states have call predecessors, (788), 265 states have call successors, (788) [2024-10-12 00:14:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1867 transitions. [2024-10-12 00:14:08,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1123 states and 1867 transitions. [2024-10-12 00:14:08,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:08,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:14:08,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:14:08,991 INFO L87 Difference]: Start difference. First operand 1123 states and 1867 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) [2024-10-12 00:14:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:09,056 INFO L93 Difference]: Finished difference Result 1125 states and 1868 transitions. [2024-10-12 00:14:09,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1125 states and 1868 transitions. [2024-10-12 00:14:09,066 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 71 [2024-10-12 00:14:09,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1125 states to 1125 states and 1868 transitions. [2024-10-12 00:14:09,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 257 [2024-10-12 00:14:09,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2024-10-12 00:14:09,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1125 states and 1868 transitions. [2024-10-12 00:14:09,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:09,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1125 states and 1868 transitions. [2024-10-12 00:14:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states and 1868 transitions. [2024-10-12 00:14:09,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-10-12 00:14:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2024-10-12 00:14:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 700 states have (on average 1.1528571428571428) internal successors, (807), 701 states have internal predecessors, (807), 271 states have call successors, (271), 161 states have call predecessors, (271), 152 states have return successors, (788), 260 states have call predecessors, (788), 265 states have call successors, (788) [2024-10-12 00:14:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1866 transitions. [2024-10-12 00:14:09,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1123 states and 1866 transitions. [2024-10-12 00:14:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:14:09,183 INFO L425 stractBuchiCegarLoop]: Abstraction has 1123 states and 1866 transitions. [2024-10-12 00:14:09,183 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 00:14:09,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1123 states and 1866 transitions. [2024-10-12 00:14:09,189 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 71 [2024-10-12 00:14:09,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:09,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:09,190 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:09,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:14:09,191 INFO L745 eck$LassoCheckResult]: Stem: 23108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 23045#L-1 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; 23046#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 23069#L38 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; 23056#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 23058#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23095#L43 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; 23041#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23042#$Ultimate##0 ~n := #in~n; 23299#L25 assume ~n <= 0;#res := 1; 23281#factFINAL assume true; 23271#factEXIT >#72#return; 23272#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23321#$Ultimate##0 ~n := #in~n; 23319#L25 assume !(~n <= 0); 23084#L26 call #t~ret0 := fact(~n - 1);< 23314#$Ultimate##0 ~n := #in~n; 23318#L25 assume ~n <= 0;#res := 1; 23315#factFINAL assume true; 23313#factEXIT >#70#return; 23292#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23450#factFINAL assume true; 23447#factEXIT >#74#return; 23034#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23099#$Ultimate##0 ~n := #in~n; 23423#L25 assume !(~n <= 0); 23080#L26 call #t~ret0 := fact(~n - 1);< 23053#$Ultimate##0 [2024-10-12 00:14:09,191 INFO L747 eck$LassoCheckResult]: Loop: 23053#$Ultimate##0 ~n := #in~n; 23305#L25 assume !(~n <= 0); 23078#L26 call #t~ret0 := fact(~n - 1);< 23053#$Ultimate##0 [2024-10-12 00:14:09,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1844396785, now seen corresponding path program 1 times [2024-10-12 00:14:09,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:09,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461323014] [2024-10-12 00:14:09,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:09,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 00:14:09,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:09,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461323014] [2024-10-12 00:14:09,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461323014] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:09,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430964121] [2024-10-12 00:14:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:09,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:09,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,258 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2024-10-12 00:14:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:09,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 00:14:09,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 00:14:09,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430964121] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:09,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:09,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2024-10-12 00:14:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283761378] [2024-10-12 00:14:09,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:09,416 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:09,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:09,416 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 2 times [2024-10-12 00:14:09,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:09,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593173737] [2024-10-12 00:14:09,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:09,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:09,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:09,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:09,449 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:09,450 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:09,450 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:09,450 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:09,450 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:09,450 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,450 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:09,450 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:09,450 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2024-10-12 00:14:09,451 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:09,451 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:09,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,483 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:09,483 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:09,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,486 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-12 00:14:09,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:09,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:09,505 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:09,505 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:09,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:09,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,522 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-12 00:14:09,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:09,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:09,538 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:09,538 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:09,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-10-12 00:14:09,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,554 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-12 00:14:09,557 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:09,557 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:09,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:09,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,586 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-12 00:14:09,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:09,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:09,659 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:09,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:09,664 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:09,664 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:09,665 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:09,665 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:09,665 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:09,665 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,665 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:09,665 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:09,665 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2024-10-12 00:14:09,665 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:09,665 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:09,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:09,697 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:09,697 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:09,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,699 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-12 00:14:09,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:09,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:09,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:09,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:09,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:09,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:09,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:09,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:09,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:09,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:09,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,734 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-12 00:14:09,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:09,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:09,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:09,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:09,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:09,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:09,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:09,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:09,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:09,753 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:09,753 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:09,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:09,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:09,755 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:09,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-10-12 00:14:09,756 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:09,756 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:09,756 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:09,756 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2024-10-12 00:14:09,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:09,767 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:09,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:14:09,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:09,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:14:09,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:09,975 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-12 00:14:09,975 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1123 states and 1866 transitions. cyclomatic complexity: 768 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:14:10,083 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1123 states and 1866 transitions. cyclomatic complexity: 768. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1190 states and 1953 transitions. Complement of second has 17 states. [2024-10-12 00:14:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:14:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-10-12 00:14:10,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 27 letters. Loop has 3 letters. [2024-10-12 00:14:10,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:10,085 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:10,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:10,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:14:10,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:10,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:14:10,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:10,279 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-12 00:14:10,279 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1123 states and 1866 transitions. cyclomatic complexity: 768 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:14:10,368 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1123 states and 1866 transitions. cyclomatic complexity: 768. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1190 states and 1953 transitions. Complement of second has 17 states. [2024-10-12 00:14:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:14:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-10-12 00:14:10,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 27 letters. Loop has 3 letters. [2024-10-12 00:14:10,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:10,370 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:10,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:10,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:14:10,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:10,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:14:10,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:10,572 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-12 00:14:10,573 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1123 states and 1866 transitions. cyclomatic complexity: 768 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:14:10,685 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1123 states and 1866 transitions. cyclomatic complexity: 768. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1381 states and 2209 transitions. Complement of second has 19 states. [2024-10-12 00:14:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:14:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2024-10-12 00:14:10,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 27 letters. Loop has 3 letters. [2024-10-12 00:14:10,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:10,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 30 letters. Loop has 3 letters. [2024-10-12 00:14:10,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:10,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 27 letters. Loop has 6 letters. [2024-10-12 00:14:10,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:10,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1381 states and 2209 transitions. [2024-10-12 00:14:10,729 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 65 [2024-10-12 00:14:10,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1381 states to 1156 states and 1927 transitions. [2024-10-12 00:14:10,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 200 [2024-10-12 00:14:10,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2024-10-12 00:14:10,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1156 states and 1927 transitions. [2024-10-12 00:14:10,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:10,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1156 states and 1927 transitions. [2024-10-12 00:14:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states and 1927 transitions. [2024-10-12 00:14:10,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-10-12 00:14:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1091. [2024-10-12 00:14:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 687 states have (on average 1.1557496360989812) internal successors, (794), 678 states have internal predecessors, (794), 254 states have call successors, (254), 164 states have call predecessors, (254), 150 states have return successors, (756), 248 states have call predecessors, (756), 254 states have call successors, (756) [2024-10-12 00:14:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1804 transitions. [2024-10-12 00:14:10,780 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1091 states and 1804 transitions. [2024-10-12 00:14:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:10,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 00:14:10,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-12 00:14:10,781 INFO L87 Difference]: Start difference. First operand 1091 states and 1804 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 00:14:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:10,871 INFO L93 Difference]: Finished difference Result 1145 states and 1910 transitions. [2024-10-12 00:14:10,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1145 states and 1910 transitions. [2024-10-12 00:14:10,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 74 [2024-10-12 00:14:10,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1145 states to 1139 states and 1900 transitions. [2024-10-12 00:14:10,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2024-10-12 00:14:10,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2024-10-12 00:14:10,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1139 states and 1900 transitions. [2024-10-12 00:14:10,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:10,895 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1139 states and 1900 transitions. [2024-10-12 00:14:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states and 1900 transitions. [2024-10-12 00:14:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1105. [2024-10-12 00:14:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 687 states have (on average 1.1528384279475983) internal successors, (792), 684 states have internal predecessors, (792), 266 states have call successors, (266), 164 states have call predecessors, (266), 152 states have return successors, (778), 256 states have call predecessors, (778), 266 states have call successors, (778) [2024-10-12 00:14:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1836 transitions. [2024-10-12 00:14:10,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1105 states and 1836 transitions. [2024-10-12 00:14:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:14:10,931 INFO L425 stractBuchiCegarLoop]: Abstraction has 1105 states and 1836 transitions. [2024-10-12 00:14:10,931 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-12 00:14:10,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1105 states and 1836 transitions. [2024-10-12 00:14:10,937 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 68 [2024-10-12 00:14:10,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:10,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:10,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:10,938 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:10,939 INFO L745 eck$LassoCheckResult]: Stem: 30774#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 30703#L-1 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; 30704#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 30725#L38 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; 30714#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 30716#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30751#L43 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; 31067#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 31068#$Ultimate##0 ~n := #in~n; 31083#L25 assume ~n <= 0;#res := 1; 31075#factFINAL assume true; 31065#factEXIT >#72#return; 31004#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 31005#$Ultimate##0 ~n := #in~n; 31007#L25 assume ~n <= 0;#res := 1; 31006#factFINAL assume true; 31002#factEXIT >#74#return; 30993#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30994#$Ultimate##0 ~n := #in~n; 31069#L25 assume ~n <= 0;#res := 1; 31070#factFINAL assume true; 30992#factEXIT >#76#return; 30990#L30-3 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; 30988#binomialCoefficient_returnLabel#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; 30980#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 30973#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30729#L43 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; 30731#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 31264#$Ultimate##0 ~n := #in~n; 31259#L25 assume ~n <= 0;#res := 1; 31260#factFINAL assume true; 31272#factEXIT >#78#return; 31269#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 31270#$Ultimate##0 ~n := #in~n; 31273#L25 assume ~n <= 0;#res := 1; 31271#factFINAL assume true; 31268#factEXIT >#80#return; 30997#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 31265#$Ultimate##0 ~n := #in~n; 31263#L25 assume !(~n <= 0); 31186#L26 call #t~ret0 := fact(~n - 1);< 31197#$Ultimate##0 ~n := #in~n; 31216#L25 assume ~n <= 0;#res := 1; 31287#factFINAL assume true; 31280#factEXIT >#70#return; 31281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31296#factFINAL assume true; 31293#factEXIT >#82#return; 30991#L30-8 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; 30978#binomialCoefficient_returnLabel#2 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; 30977#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 30938#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30936#L43 [2024-10-12 00:14:10,939 INFO L747 eck$LassoCheckResult]: Loop: 30936#L43 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; 30842#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30768#$Ultimate##0 ~n := #in~n; 30933#L25 assume !(~n <= 0); 30687#L26 call #t~ret0 := fact(~n - 1);< 30932#$Ultimate##0 ~n := #in~n; 30917#L25 assume !(~n <= 0); 30904#L26 call #t~ret0 := fact(~n - 1);< 30907#$Ultimate##0 ~n := #in~n; 30917#L25 assume !(~n <= 0); 30904#L26 call #t~ret0 := fact(~n - 1);< 30907#$Ultimate##0 ~n := #in~n; 30917#L25 assume !(~n <= 0); 30904#L26 call #t~ret0 := fact(~n - 1);< 30907#$Ultimate##0 ~n := #in~n; 30919#L25 assume ~n <= 0;#res := 1; 30920#factFINAL assume true; 30918#factEXIT >#70#return; 30916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30915#factFINAL assume true; 30914#factEXIT >#70#return; 30913#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30911#factFINAL assume true; 30909#factEXIT >#70#return; 30905#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30906#factFINAL assume true; 30901#factEXIT >#70#return; 30900#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30898#factFINAL assume true; 30897#factEXIT >#78#return; 30767#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30768#$Ultimate##0 ~n := #in~n; 30933#L25 assume !(~n <= 0); 30687#L26 call #t~ret0 := fact(~n - 1);< 30932#$Ultimate##0 ~n := #in~n; 30917#L25 assume !(~n <= 0); 30904#L26 call #t~ret0 := fact(~n - 1);< 30907#$Ultimate##0 ~n := #in~n; 30917#L25 assume !(~n <= 0); 30904#L26 call #t~ret0 := fact(~n - 1);< 30907#$Ultimate##0 ~n := #in~n; 30917#L25 assume !(~n <= 0); 30904#L26 call #t~ret0 := fact(~n - 1);< 30907#$Ultimate##0 ~n := #in~n; 30919#L25 assume ~n <= 0;#res := 1; 30920#factFINAL assume true; 30918#factEXIT >#70#return; 30916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30915#factFINAL assume true; 30914#factEXIT >#70#return; 30913#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30911#factFINAL assume true; 30909#factEXIT >#70#return; 30905#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30906#factFINAL assume true; 30901#factEXIT >#70#return; 30900#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30898#factFINAL assume true; 30897#factEXIT >#80#return; 30843#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30845#$Ultimate##0 ~n := #in~n; 30943#L25 assume !(~n <= 0); 30687#L26 call #t~ret0 := fact(~n - 1);< 30932#$Ultimate##0 ~n := #in~n; 30917#L25 assume !(~n <= 0); 30904#L26 call #t~ret0 := fact(~n - 1);< 30907#$Ultimate##0 ~n := #in~n; 30917#L25 assume !(~n <= 0); 30904#L26 call #t~ret0 := fact(~n - 1);< 30907#$Ultimate##0 ~n := #in~n; 30917#L25 assume !(~n <= 0); 30904#L26 call #t~ret0 := fact(~n - 1);< 30907#$Ultimate##0 ~n := #in~n; 30919#L25 assume ~n <= 0;#res := 1; 30920#factFINAL assume true; 30918#factEXIT >#70#return; 30916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30915#factFINAL assume true; 30914#factEXIT >#70#return; 30913#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30911#factFINAL assume true; 30909#factEXIT >#70#return; 30905#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30906#factFINAL assume true; 30901#factEXIT >#70#return; 30900#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30898#factFINAL assume true; 30897#factEXIT >#82#return; 30839#L30-8 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; 30837#binomialCoefficient_returnLabel#2 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; 30770#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 30771#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30936#L43 [2024-10-12 00:14:10,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash -758704542, now seen corresponding path program 1 times [2024-10-12 00:14:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:10,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216883638] [2024-10-12 00:14:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:10,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:10,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 00:14:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 00:14:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 00:14:11,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216883638] [2024-10-12 00:14:11,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216883638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101278542] [2024-10-12 00:14:11,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:11,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:11,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:11,025 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:11,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2024-10-12 00:14:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:14:11,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-12 00:14:11,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 00:14:11,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101278542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:11,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 00:14:11,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-10-12 00:14:11,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000885847] [2024-10-12 00:14:11,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:11,130 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:11,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash 953465596, now seen corresponding path program 7 times [2024-10-12 00:14:11,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:11,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439086627] [2024-10-12 00:14:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:11,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:14:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 00:14:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 00:14:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 33 proven. 300 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-10-12 00:14:11,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439086627] [2024-10-12 00:14:11,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439086627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190097124] [2024-10-12 00:14:11,581 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-12 00:14:11,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:11,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:11,583 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:11,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2024-10-12 00:14:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:11,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 00:14:11,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 290 proven. 140 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-10-12 00:14:11,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 26 proven. 364 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-12 00:14:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190097124] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:12,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 22] total 35 [2024-10-12 00:14:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949446118] [2024-10-12 00:14:12,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:12,868 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:12,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:14:12,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 00:14:12,869 INFO L87 Difference]: Start difference. First operand 1105 states and 1836 transitions. cyclomatic complexity: 754 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 00:14:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:13,003 INFO L93 Difference]: Finished difference Result 979 states and 1577 transitions. [2024-10-12 00:14:13,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 979 states and 1577 transitions. [2024-10-12 00:14:13,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 72 [2024-10-12 00:14:13,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 979 states to 749 states and 1230 transitions. [2024-10-12 00:14:13,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2024-10-12 00:14:13,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2024-10-12 00:14:13,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 749 states and 1230 transitions. [2024-10-12 00:14:13,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:13,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 749 states and 1230 transitions. [2024-10-12 00:14:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states and 1230 transitions. [2024-10-12 00:14:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 719. [2024-10-12 00:14:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 457 states have (on average 1.1378555798687089) internal successors, (520), 446 states have internal predecessors, (520), 168 states have call successors, (168), 102 states have call predecessors, (168), 94 states have return successors, (484), 170 states have call predecessors, (484), 168 states have call successors, (484) [2024-10-12 00:14:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1172 transitions. [2024-10-12 00:14:13,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 719 states and 1172 transitions. [2024-10-12 00:14:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:14:13,041 INFO L425 stractBuchiCegarLoop]: Abstraction has 719 states and 1172 transitions. [2024-10-12 00:14:13,041 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-12 00:14:13,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 719 states and 1172 transitions. [2024-10-12 00:14:13,044 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 67 [2024-10-12 00:14:13,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:13,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:13,045 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] [2024-10-12 00:14:13,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:13,046 INFO L745 eck$LassoCheckResult]: Stem: 33862#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 33807#L-1 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; 33808#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 33829#L38 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; 33816#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 33818#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 33844#L43 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; 34064#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 34065#$Ultimate##0 ~n := #in~n; 34068#L25 assume ~n <= 0;#res := 1; 34067#factFINAL assume true; 34063#factEXIT >#72#return; 34060#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 34061#$Ultimate##0 ~n := #in~n; 34066#L25 assume ~n <= 0;#res := 1; 34062#factFINAL assume true; 34059#factEXIT >#74#return; 34057#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 34058#$Ultimate##0 ~n := #in~n; 34070#L25 assume !(~n <= 0); 34071#L26 call #t~ret0 := fact(~n - 1);< 34084#$Ultimate##0 ~n := #in~n; 34092#L25 assume ~n <= 0;#res := 1; 34086#factFINAL assume true; 34080#factEXIT >#70#return; 34078#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34076#factFINAL assume true; 34075#factEXIT >#76#return; 33821#L30-3 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; 33822#binomialCoefficient_returnLabel#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; 33837#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 34074#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 34039#L43 [2024-10-12 00:14:13,046 INFO L747 eck$LassoCheckResult]: Loop: 34039#L43 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; 33840#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 33858#$Ultimate##0 ~n := #in~n; 34038#L25 assume !(~n <= 0); 33790#L26 call #t~ret0 := fact(~n - 1);< 34110#$Ultimate##0 ~n := #in~n; 34106#L25 assume !(~n <= 0); 34089#L26 call #t~ret0 := fact(~n - 1);< 34094#$Ultimate##0 ~n := #in~n; 34106#L25 assume !(~n <= 0); 34089#L26 call #t~ret0 := fact(~n - 1);< 34094#$Ultimate##0 ~n := #in~n; 34106#L25 assume !(~n <= 0); 34089#L26 call #t~ret0 := fact(~n - 1);< 34094#$Ultimate##0 ~n := #in~n; 34108#L25 assume ~n <= 0;#res := 1; 34109#factFINAL assume true; 34107#factEXIT >#70#return; 34104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34103#factFINAL assume true; 34102#factEXIT >#70#return; 34100#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34098#factFINAL assume true; 34096#factEXIT >#70#return; 34091#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34093#factFINAL assume true; 34087#factEXIT >#70#return; 34085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34079#factFINAL assume true; 34077#factEXIT >#78#return; 33842#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 33858#$Ultimate##0 ~n := #in~n; 34038#L25 assume !(~n <= 0); 33790#L26 call #t~ret0 := fact(~n - 1);< 34110#$Ultimate##0 ~n := #in~n; 34106#L25 assume !(~n <= 0); 34089#L26 call #t~ret0 := fact(~n - 1);< 34094#$Ultimate##0 ~n := #in~n; 34108#L25 assume ~n <= 0;#res := 1; 34109#factFINAL assume true; 34107#factEXIT >#70#return; 34104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34103#factFINAL assume true; 34102#factEXIT >#70#return; 34097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34111#factFINAL assume true; 34112#factEXIT >#80#return; 33841#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 33853#$Ultimate##0 ~n := #in~n; 33854#L25 assume !(~n <= 0); 33790#L26 call #t~ret0 := fact(~n - 1);< 34110#$Ultimate##0 ~n := #in~n; 34106#L25 assume !(~n <= 0); 34089#L26 call #t~ret0 := fact(~n - 1);< 34094#$Ultimate##0 ~n := #in~n; 34108#L25 assume ~n <= 0;#res := 1; 34109#factFINAL assume true; 34107#factEXIT >#70#return; 34104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34103#factFINAL assume true; 34102#factEXIT >#70#return; 34097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34111#factFINAL assume true; 34112#factEXIT >#82#return; 33896#L30-8 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; 33830#binomialCoefficient_returnLabel#2 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; 33831#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 33861#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 34039#L43 [2024-10-12 00:14:13,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash -946042969, now seen corresponding path program 2 times [2024-10-12 00:14:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:13,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220134491] [2024-10-12 00:14:13,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:13,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:13,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:13,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:13,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:13,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 00:14:13,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220134491] [2024-10-12 00:14:13,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220134491] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939161298] [2024-10-12 00:14:13,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:13,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:13,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:13,127 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:13,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2024-10-12 00:14:13,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:13,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:13,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:14:13,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 00:14:13,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 00:14:13,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939161298] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:13,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:13,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-10-12 00:14:13,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004902971] [2024-10-12 00:14:13,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:13,306 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:13,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1689132932, now seen corresponding path program 8 times [2024-10-12 00:14:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:13,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518998476] [2024-10-12 00:14:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:13,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903883955] [2024-10-12 00:14:13,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:13,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:13,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:13,319 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:13,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2024-10-12 00:14:13,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:13,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:14:13,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:13,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:13,834 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:13,834 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:13,834 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:13,834 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:13,834 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:13,834 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:13,834 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:13,834 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:13,834 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2024-10-12 00:14:13,834 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:13,834 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:13,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:13,903 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:13,903 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:13,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:13,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:13,906 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:13,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:13,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:13,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-12 00:14:13,925 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:13,925 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: [] [2024-10-12 00:14:13,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:13,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:13,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:13,942 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:13,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-12 00:14:13,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:13,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:13,958 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:13,958 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: [] [2024-10-12 00:14:13,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-10-12 00:14:13,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:13,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:13,974 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:13,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-10-12 00:14:13,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:13,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:14,016 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:14,017 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: [] [2024-10-12 00:14:14,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:14,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,040 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-10-12 00:14:14,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:14,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:14,059 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:14,059 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=5} Honda state: {ULTIMATE.start_main_~x~0#1=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:14,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:14,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,071 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-10-12 00:14:14,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:14,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:14,083 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:14,083 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: [] [2024-10-12 00:14:14,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-10-12 00:14:14,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,095 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-10-12 00:14:14,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:14,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:14,107 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:14,107 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=2} Honda state: {ULTIMATE.start_main_~n~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:14,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-10-12 00:14:14,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,120 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-10-12 00:14:14,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:14,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:14,132 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:14,132 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: [] [2024-10-12 00:14:14,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-10-12 00:14:14,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,144 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-10-12 00:14:14,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:14,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:14,156 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:14,156 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: [] [2024-10-12 00:14:14,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-10-12 00:14:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,167 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-10-12 00:14:14,169 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:14,169 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:14,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-10-12 00:14:14,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,192 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-10-12 00:14:14,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:14,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:14,206 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:14,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:14,216 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:14,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:14,216 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:14,216 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:14,216 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:14,216 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,216 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:14,216 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:14,216 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2024-10-12 00:14:14,216 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:14,217 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:14,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:14,290 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:14,290 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:14,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,293 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-10-12 00:14:14,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:14,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:14,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:14,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:14,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:14,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:14,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:14,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:14,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:14,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:14,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,321 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-10-12 00:14:14,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:14,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:14,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:14,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:14,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:14,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:14,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:14,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:14,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:14,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-10-12 00:14:14,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,346 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-10-12 00:14:14,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 [2024-10-12 00:14:14,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:14,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:14,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:14,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:14,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:14,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:14,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:14,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:14,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-10-12 00:14:14,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,371 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-10-12 00:14:14,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:14,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:14,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:14,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:14,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:14,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:14,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:14,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:14,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:14,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:14,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,401 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-10-12 00:14:14,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:14,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:14,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:14,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:14,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:14,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:14,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:14,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:14,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:14,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-10-12 00:14:14,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,426 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-10-12 00:14:14,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:14,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:14,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:14,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:14,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:14,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:14,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:14,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:14,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:14,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-10-12 00:14:14,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,451 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-10-12 00:14:14,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:14,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:14,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:14,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:14,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:14,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:14,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:14,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:14,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:14,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-10-12 00:14:14,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,476 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-10-12 00:14:14,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:14,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:14,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:14,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:14,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:14,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:14,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:14,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:14,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:14,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-10-12 00:14:14,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,501 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-10-12 00:14:14,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:14,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:14,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:14,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:14,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:14,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:14,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:14,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:14,515 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:14,516 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:14,516 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:14,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:14,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:14,518 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:14,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-10-12 00:14:14,519 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:14,519 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:14,519 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:14,519 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 [] [2024-10-12 00:14:14,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-10-12 00:14:14,530 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:14,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:14,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:14,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:14,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:14,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 00:14:14,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-12 00:14:15,146 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2024-10-12 00:14:15,146 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 719 states and 1172 transitions. cyclomatic complexity: 470 Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 13 states have internal predecessors, (38), 6 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-12 00:14:15,547 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 719 states and 1172 transitions. cyclomatic complexity: 470. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 13 states have internal predecessors, (38), 6 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Result 1580 states and 2508 transitions. Complement of second has 77 states. [2024-10-12 00:14:15,547 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 [2024-10-12 00:14:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 13 states have internal predecessors, (38), 6 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-12 00:14:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2024-10-12 00:14:15,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 82 transitions. Stem has 32 letters. Loop has 68 letters. [2024-10-12 00:14:15,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:15,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 82 transitions. Stem has 100 letters. Loop has 68 letters. [2024-10-12 00:14:15,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:15,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 82 transitions. Stem has 32 letters. Loop has 136 letters. [2024-10-12 00:14:15,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:15,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1580 states and 2508 transitions. [2024-10-12 00:14:15,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 67 [2024-10-12 00:14:15,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1580 states to 1086 states and 1762 transitions. [2024-10-12 00:14:15,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2024-10-12 00:14:15,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2024-10-12 00:14:15,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1086 states and 1762 transitions. [2024-10-12 00:14:15,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:15,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1086 states and 1762 transitions. [2024-10-12 00:14:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states and 1762 transitions. [2024-10-12 00:14:15,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 943. [2024-10-12 00:14:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 601 states have (on average 1.1331114808652247) internal successors, (681), 589 states have internal predecessors, (681), 208 states have call successors, (208), 130 states have call predecessors, (208), 134 states have return successors, (644), 223 states have call predecessors, (644), 208 states have call successors, (644) [2024-10-12 00:14:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1533 transitions. [2024-10-12 00:14:15,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 943 states and 1533 transitions. [2024-10-12 00:14:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:15,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 00:14:15,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-12 00:14:15,606 INFO L87 Difference]: Start difference. First operand 943 states and 1533 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 00:14:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:15,812 INFO L93 Difference]: Finished difference Result 995 states and 1673 transitions. [2024-10-12 00:14:15,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 995 states and 1673 transitions. [2024-10-12 00:14:15,820 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 91 [2024-10-12 00:14:15,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 995 states to 952 states and 1604 transitions. [2024-10-12 00:14:15,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2024-10-12 00:14:15,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 244 [2024-10-12 00:14:15,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 952 states and 1604 transitions. [2024-10-12 00:14:15,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:15,831 INFO L218 hiAutomatonCegarLoop]: Abstraction has 952 states and 1604 transitions. [2024-10-12 00:14:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states and 1604 transitions. [2024-10-12 00:14:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2024-10-12 00:14:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 592 states have (on average 1.1283783783783783) internal successors, (668), 579 states have internal predecessors, (668), 232 states have call successors, (232), 126 states have call predecessors, (232), 126 states have return successors, (702), 244 states have call predecessors, (702), 232 states have call successors, (702) [2024-10-12 00:14:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1602 transitions. [2024-10-12 00:14:15,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 950 states and 1602 transitions. [2024-10-12 00:14:15,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:14:15,858 INFO L425 stractBuchiCegarLoop]: Abstraction has 950 states and 1602 transitions. [2024-10-12 00:14:15,858 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-12 00:14:15,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 950 states and 1602 transitions. [2024-10-12 00:14:15,861 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 91 [2024-10-12 00:14:15,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:15,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:15,862 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] [2024-10-12 00:14:15,862 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:15,863 INFO L745 eck$LassoCheckResult]: Stem: 38738#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 38690#L-1 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; 38691#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 38714#L38 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; 38701#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 38703#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38718#L43 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; 38677#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38678#$Ultimate##0 ~n := #in~n; 38926#L25 assume ~n <= 0;#res := 1; 38924#factFINAL assume true; 38922#factEXIT >#72#return; 38729#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38730#$Ultimate##0 ~n := #in~n; 38948#L25 assume ~n <= 0;#res := 1; 38947#factFINAL assume true; 38946#factEXIT >#74#return; 38673#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 38674#$Ultimate##0 ~n := #in~n; 38993#L25 assume ~n <= 0;#res := 1; 38992#factFINAL assume true; 38990#factEXIT >#76#return; 38989#L30-3 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; 38987#binomialCoefficient_returnLabel#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; 38983#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 38979#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38981#L43 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; 39187#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39191#$Ultimate##0 ~n := #in~n; 39348#L25 assume !(~n <= 0); 39205#L26 call #t~ret0 := fact(~n - 1);< 39215#$Ultimate##0 ~n := #in~n; 39342#L25 assume ~n <= 0;#res := 1; 39347#factFINAL assume true; 39214#factEXIT >#70#return; 39210#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39193#factFINAL assume true; 39184#factEXIT >#78#return; 39180#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39181#$Ultimate##0 ~n := #in~n; 39260#L25 assume ~n <= 0;#res := 1; 39258#factFINAL assume true; 39250#factEXIT >#80#return; 39008#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39245#$Ultimate##0 ~n := #in~n; 39282#L25 assume !(~n <= 0); 39199#L26 call #t~ret0 := fact(~n - 1);< 39257#$Ultimate##0 ~n := #in~n; 39290#L25 assume ~n <= 0;#res := 1; 39273#factFINAL assume true; 39252#factEXIT >#70#return; 39251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39246#factFINAL assume true; 39242#factEXIT >#82#return; 39009#L30-8 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; 39002#binomialCoefficient_returnLabel#2 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; 39003#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 39228#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38949#L43 [2024-10-12 00:14:15,863 INFO L747 eck$LassoCheckResult]: Loop: 38949#L43 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; 38682#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38735#$Ultimate##0 ~n := #in~n; 38971#L25 assume !(~n <= 0); 38668#L26 call #t~ret0 := fact(~n - 1);< 38986#$Ultimate##0 ~n := #in~n; 38967#L25 assume !(~n <= 0); 38954#L26 call #t~ret0 := fact(~n - 1);< 38959#$Ultimate##0 ~n := #in~n; 38967#L25 assume !(~n <= 0); 38954#L26 call #t~ret0 := fact(~n - 1);< 38959#$Ultimate##0 ~n := #in~n; 38967#L25 assume !(~n <= 0); 38954#L26 call #t~ret0 := fact(~n - 1);< 38959#$Ultimate##0 ~n := #in~n; 38967#L25 assume !(~n <= 0); 38954#L26 call #t~ret0 := fact(~n - 1);< 38959#$Ultimate##0 ~n := #in~n; 38975#L25 assume ~n <= 0;#res := 1; 38984#factFINAL assume true; 38982#factEXIT >#70#return; 38978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38976#factFINAL assume true; 38973#factEXIT >#70#return; 38972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38970#factFINAL assume true; 38968#factEXIT >#70#return; 38964#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38962#factFINAL assume true; 38960#factEXIT >#70#return; 38957#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38958#factFINAL assume true; 38953#factEXIT >#70#return; 38952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38951#factFINAL assume true; 38950#factEXIT >#78#return; 38683#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38735#$Ultimate##0 ~n := #in~n; 38971#L25 assume ~n <= 0;#res := 1; 38969#factFINAL assume true; 38966#factEXIT >#80#return; 38739#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 38740#$Ultimate##0 ~n := #in~n; 38965#L25 assume !(~n <= 0); 38956#L26 call #t~ret0 := fact(~n - 1);< 38963#$Ultimate##0 ~n := #in~n; 38967#L25 assume !(~n <= 0); 38954#L26 call #t~ret0 := fact(~n - 1);< 38959#$Ultimate##0 ~n := #in~n; 38975#L25 assume ~n <= 0;#res := 1; 38984#factFINAL assume true; 38982#factEXIT >#70#return; 38978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38976#factFINAL assume true; 38973#factEXIT >#70#return; 38961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38998#factFINAL assume true; 38997#factEXIT >#82#return; 38692#L30-8 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; 38693#binomialCoefficient_returnLabel#2 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; 38715#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 38737#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38949#L43 [2024-10-12 00:14:15,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:15,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1417569890, now seen corresponding path program 2 times [2024-10-12 00:14:15,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:15,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417521342] [2024-10-12 00:14:15,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:15,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116642163] [2024-10-12 00:14:15,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:15,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:15,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:15,875 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:15,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2024-10-12 00:14:15,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:15,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:14:15,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:16,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:16,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1312274244, now seen corresponding path program 9 times [2024-10-12 00:14:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:16,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029216951] [2024-10-12 00:14:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 00:14:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 00:14:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 00:14:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 79 proven. 58 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-12 00:14:16,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:16,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029216951] [2024-10-12 00:14:16,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029216951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:16,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696133855] [2024-10-12 00:14:16,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:16,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:16,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:16,296 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:16,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2024-10-12 00:14:16,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-12 00:14:16,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:16,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:14:16,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 77 proven. 76 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-12 00:14:16,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 77 proven. 86 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 00:14:16,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696133855] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:16,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:16,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 16] total 25 [2024-10-12 00:14:16,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389486030] [2024-10-12 00:14:16,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:16,972 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:16,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:16,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 00:14:16,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2024-10-12 00:14:16,973 INFO L87 Difference]: Start difference. First operand 950 states and 1602 transitions. cyclomatic complexity: 672 Second operand has 25 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (20), 15 states have call predecessors, (20), 13 states have call successors, (20) [2024-10-12 00:14:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:17,496 INFO L93 Difference]: Finished difference Result 1238 states and 2078 transitions. [2024-10-12 00:14:17,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1238 states and 2078 transitions. [2024-10-12 00:14:17,506 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 150 [2024-10-12 00:14:17,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1238 states to 1230 states and 2070 transitions. [2024-10-12 00:14:17,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2024-10-12 00:14:17,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2024-10-12 00:14:17,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1230 states and 2070 transitions. [2024-10-12 00:14:17,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:17,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1230 states and 2070 transitions. [2024-10-12 00:14:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states and 2070 transitions. [2024-10-12 00:14:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1068. [2024-10-12 00:14:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 658 states have (on average 1.115501519756839) internal successors, (734), 643 states have internal predecessors, (734), 276 states have call successors, (276), 152 states have call predecessors, (276), 134 states have return successors, (838), 272 states have call predecessors, (838), 276 states have call successors, (838) [2024-10-12 00:14:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1848 transitions. [2024-10-12 00:14:17,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1068 states and 1848 transitions. [2024-10-12 00:14:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 00:14:17,556 INFO L425 stractBuchiCegarLoop]: Abstraction has 1068 states and 1848 transitions. [2024-10-12 00:14:17,556 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-12 00:14:17,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1068 states and 1848 transitions. [2024-10-12 00:14:17,560 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2024-10-12 00:14:17,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:17,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:17,561 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] [2024-10-12 00:14:17,561 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:17,562 INFO L745 eck$LassoCheckResult]: Stem: 41494#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 41430#L-1 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; 41431#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 41455#L38 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; 41442#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 41444#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41460#L43 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; 41426#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 41427#$Ultimate##0 ~n := #in~n; 41681#L25 assume ~n <= 0;#res := 1; 41678#factFINAL assume true; 41677#factEXIT >#72#return; 41481#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 41482#$Ultimate##0 ~n := #in~n; 41685#L25 assume ~n <= 0;#res := 1; 41683#factFINAL assume true; 41682#factEXIT >#74#return; 41415#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 41416#$Ultimate##0 ~n := #in~n; 41736#L25 assume ~n <= 0;#res := 1; 41735#factFINAL assume true; 41733#factEXIT >#76#return; 41731#L30-3 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; 41729#binomialCoefficient_returnLabel#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; 41727#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41723#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41725#L43 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; 41960#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42090#$Ultimate##0 ~n := #in~n; 42088#L25 assume !(~n <= 0); 41976#L26 call #t~ret0 := fact(~n - 1);< 42086#$Ultimate##0 ~n := #in~n; 42087#L25 assume ~n <= 0;#res := 1; 42148#factFINAL assume true; 42127#factEXIT >#70#return; 42126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42124#factFINAL assume true; 42123#factEXIT >#78#return; 42118#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42120#$Ultimate##0 ~n := #in~n; 42122#L25 assume ~n <= 0;#res := 1; 42048#factFINAL assume true; 42117#factEXIT >#80#return; 41945#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42145#$Ultimate##0 ~n := #in~n; 42152#L25 assume !(~n <= 0); 41979#L26 call #t~ret0 := fact(~n - 1);< 42132#$Ultimate##0 ~n := #in~n; 42075#L25 assume ~n <= 0;#res := 1; 42135#factFINAL assume true; 42128#factEXIT >#70#return; 42130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42150#factFINAL assume true; 42149#factEXIT >#82#return; 41942#L30-8 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; 41943#binomialCoefficient_returnLabel#2 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; 42163#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 42162#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41689#L43 [2024-10-12 00:14:17,562 INFO L747 eck$LassoCheckResult]: Loop: 41689#L43 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; 41403#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 41404#$Ultimate##0 ~n := #in~n; 41744#L25 assume !(~n <= 0); 41408#L26 call #t~ret0 := fact(~n - 1);< 41748#$Ultimate##0 ~n := #in~n; 41487#L25 assume !(~n <= 0); 41706#L26 call #t~ret0 := fact(~n - 1);< 41710#$Ultimate##0 ~n := #in~n; 41487#L25 assume !(~n <= 0); 41706#L26 call #t~ret0 := fact(~n - 1);< 41710#$Ultimate##0 ~n := #in~n; 41487#L25 assume !(~n <= 0); 41706#L26 call #t~ret0 := fact(~n - 1);< 41710#$Ultimate##0 ~n := #in~n; 41487#L25 assume !(~n <= 0); 41706#L26 call #t~ret0 := fact(~n - 1);< 41710#$Ultimate##0 ~n := #in~n; 41734#L25 assume ~n <= 0;#res := 1; 41732#factFINAL assume true; 41730#factEXIT >#70#return; 41728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41726#factFINAL assume true; 41722#factEXIT >#70#return; 41721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41720#factFINAL assume true; 41717#factEXIT >#70#return; 41715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41713#factFINAL assume true; 41711#factEXIT >#70#return; 41708#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41709#factFINAL assume true; 41703#factEXIT >#70#return; 41702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41701#factFINAL assume true; 41698#factEXIT >#78#return; 41464#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 41404#$Ultimate##0 ~n := #in~n; 41744#L25 assume ~n <= 0;#res := 1; 41743#factFINAL assume true; 41742#factEXIT >#80#return; 41699#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 41741#$Ultimate##0 ~n := #in~n; 41738#L25 assume !(~n <= 0); 41705#L26 call #t~ret0 := fact(~n - 1);< 41714#$Ultimate##0 ~n := #in~n; 41737#L25 assume !(~n <= 0); 41707#L26 call #t~ret0 := fact(~n - 1);< 41718#$Ultimate##0 ~n := #in~n; 41487#L25 assume !(~n <= 0); 41706#L26 call #t~ret0 := fact(~n - 1);< 41710#$Ultimate##0 ~n := #in~n; 41487#L25 assume !(~n <= 0); 41706#L26 call #t~ret0 := fact(~n - 1);< 41710#$Ultimate##0 ~n := #in~n; 41487#L25 assume !(~n <= 0); 41706#L26 call #t~ret0 := fact(~n - 1);< 41710#$Ultimate##0 ~n := #in~n; 41734#L25 assume ~n <= 0;#res := 1; 41732#factFINAL assume true; 41730#factEXIT >#70#return; 41728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41726#factFINAL assume true; 41722#factEXIT >#70#return; 41721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41720#factFINAL assume true; 41717#factEXIT >#70#return; 41715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41713#factFINAL assume true; 41711#factEXIT >#70#return; 41708#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41709#factFINAL assume true; 41703#factEXIT >#70#return; 41702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41701#factFINAL assume true; 41698#factEXIT >#82#return; 41700#L30-8 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; 41456#binomialCoefficient_returnLabel#2 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; 41457#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41491#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41689#L43 [2024-10-12 00:14:17,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:17,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1417569890, now seen corresponding path program 3 times [2024-10-12 00:14:17,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:17,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515417347] [2024-10-12 00:14:17,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:17,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905938046] [2024-10-12 00:14:17,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:17,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:17,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:17,575 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:17,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2024-10-12 00:14:17,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-12 00:14:17,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:14:17,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:17,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:17,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1577096060, now seen corresponding path program 10 times [2024-10-12 00:14:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:17,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450544345] [2024-10-12 00:14:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:17,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794079023] [2024-10-12 00:14:17,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:17,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:17,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:17,713 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:17,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2024-10-12 00:14:17,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:17,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:14:17,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:17,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:17,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1824296925, now seen corresponding path program 4 times [2024-10-12 00:14:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:17,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215670200] [2024-10-12 00:14:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 00:14:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 00:14:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 00:14:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 00:14:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 128 proven. 116 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2024-10-12 00:14:18,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:18,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215670200] [2024-10-12 00:14:18,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215670200] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:18,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2514158] [2024-10-12 00:14:18,212 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:18,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:18,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:18,214 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:18,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2024-10-12 00:14:18,327 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:18,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:18,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:14:18,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 588 proven. 25 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-12 00:14:18,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 126 proven. 122 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2024-10-12 00:14:18,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2514158] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:18,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:18,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 12] total 17 [2024-10-12 00:14:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569872196] [2024-10-12 00:14:18,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:19,284 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:19,285 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:19,285 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:19,285 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:19,285 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:19,285 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,285 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:19,285 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:19,285 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2024-10-12 00:14:19,285 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:19,285 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:19,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,348 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:19,348 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:19,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,350 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-10-12 00:14:19,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:19,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,362 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:19,362 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: [] [2024-10-12 00:14:19,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:19,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,374 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-10-12 00:14:19,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:19,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,387 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:19,387 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: [] [2024-10-12 00:14:19,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2024-10-12 00:14:19,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,401 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-10-12 00:14:19,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:19,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,413 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:19,413 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: [] [2024-10-12 00:14:19,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-10-12 00:14:19,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,425 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-10-12 00:14:19,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:19,427 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,437 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:19,437 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: [] [2024-10-12 00:14:19,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:19,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,450 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-10-12 00:14:19,451 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:19,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,462 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:19,462 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: [] [2024-10-12 00:14:19,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-10-12 00:14:19,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,474 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-10-12 00:14:19,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:19,476 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,486 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:19,486 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: [] [2024-10-12 00:14:19,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2024-10-12 00:14:19,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,498 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-10-12 00:14:19,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:19,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,517 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:19,517 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=6} Honda state: {ULTIMATE.start_main_~x~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:19,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2024-10-12 00:14:19,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,529 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-10-12 00:14:19,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:19,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,542 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:19,542 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: [] [2024-10-12 00:14:19,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:19,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,554 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-10-12 00:14:19,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:19,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,568 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:19,568 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: [] [2024-10-12 00:14:19,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-10-12 00:14:19,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,579 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-10-12 00:14:19,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:19,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-10-12 00:14:19,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,603 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-10-12 00:14:19,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:19,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:19,616 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:19,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-10-12 00:14:19,626 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:19,626 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:19,626 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:19,626 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:19,626 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:19,626 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,626 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:19,626 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:19,626 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2024-10-12 00:14:19,626 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:19,627 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:19,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:19,694 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:19,694 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:19,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,696 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-10-12 00:14:19,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:19,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:19,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:19,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:19,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:19,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:19,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:19,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:19,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:19,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-10-12 00:14:19,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,721 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-10-12 00:14:19,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:19,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:19,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:19,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:19,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:19,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:19,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:19,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:19,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:19,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-10-12 00:14:19,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,745 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-10-12 00:14:19,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 [2024-10-12 00:14:19,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:19,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:19,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:19,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:19,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:19,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:19,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:19,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:19,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-10-12 00:14:19,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,774 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-10-12 00:14:19,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:19,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:19,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:19,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:19,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:19,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:19,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:19,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:19,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:19,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-10-12 00:14:19,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,799 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-10-12 00:14:19,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:19,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:19,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:19,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:19,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:19,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:19,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:19,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:19,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:19,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-10-12 00:14:19,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,824 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-10-12 00:14:19,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:19,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:19,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:19,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:19,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:19,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:19,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:19,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:19,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:19,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-10-12 00:14:19,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,850 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-10-12 00:14:19,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:19,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:19,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:19,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:19,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:19,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:19,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:19,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:19,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:19,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:19,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,875 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-10-12 00:14:19,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:19,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:19,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:19,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:19,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:19,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:19,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:19,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:19,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:19,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-10-12 00:14:19,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,901 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-10-12 00:14:19,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:19,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:19,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:19,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:19,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:19,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:19,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:19,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:19,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:19,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2024-10-12 00:14:19,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,928 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-10-12 00:14:19,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:19,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:19,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:19,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:19,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:19,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:19,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:19,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:19,942 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:19,944 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:19,944 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:19,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:19,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:19,946 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:19,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-10-12 00:14:19,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:19,947 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:19,947 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:19,947 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 11 Supporting invariants [] [2024-10-12 00:14:19,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:19,958 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:19,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:20,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:14:20,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:20,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-12 00:14:20,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-12 00:14:20,678 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2024-10-12 00:14:20,678 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1068 states and 1848 transitions. cyclomatic complexity: 800 Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-12 00:14:21,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1068 states and 1848 transitions. cyclomatic complexity: 800. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 2438 states and 4397 transitions. Complement of second has 89 states. [2024-10-12 00:14:21,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-12 00:14:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 85 transitions. [2024-10-12 00:14:21,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 85 transitions. Stem has 58 letters. Loop has 80 letters. [2024-10-12 00:14:21,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:21,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 85 transitions. Stem has 138 letters. Loop has 80 letters. [2024-10-12 00:14:21,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:21,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 85 transitions. Stem has 58 letters. Loop has 160 letters. [2024-10-12 00:14:21,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:21,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2438 states and 4397 transitions. [2024-10-12 00:14:21,151 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2024-10-12 00:14:21,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2438 states to 1580 states and 2861 transitions. [2024-10-12 00:14:21,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2024-10-12 00:14:21,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2024-10-12 00:14:21,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1580 states and 2861 transitions. [2024-10-12 00:14:21,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:21,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1580 states and 2861 transitions. [2024-10-12 00:14:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states and 2861 transitions. [2024-10-12 00:14:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1354. [2024-10-12 00:14:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 840 states have (on average 1.1130952380952381) internal successors, (935), 825 states have internal predecessors, (935), 330 states have call successors, (330), 188 states have call predecessors, (330), 184 states have return successors, (1112), 340 states have call predecessors, (1112), 330 states have call successors, (1112) [2024-10-12 00:14:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 2377 transitions. [2024-10-12 00:14:21,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1354 states and 2377 transitions. [2024-10-12 00:14:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:21,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 00:14:21,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-10-12 00:14:21,218 INFO L87 Difference]: Start difference. First operand 1354 states and 2377 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 11 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2024-10-12 00:14:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:21,506 INFO L93 Difference]: Finished difference Result 1637 states and 3142 transitions. [2024-10-12 00:14:21,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1637 states and 3142 transitions. [2024-10-12 00:14:21,551 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 157 [2024-10-12 00:14:21,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1637 states to 1577 states and 3022 transitions. [2024-10-12 00:14:21,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2024-10-12 00:14:21,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2024-10-12 00:14:21,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1577 states and 3022 transitions. [2024-10-12 00:14:21,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:21,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1577 states and 3022 transitions. [2024-10-12 00:14:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states and 3022 transitions. [2024-10-12 00:14:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1450. [2024-10-12 00:14:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 880 states have (on average 1.1193181818181819) internal successors, (985), 859 states have internal predecessors, (985), 386 states have call successors, (386), 176 states have call predecessors, (386), 184 states have return successors, (1272), 414 states have call predecessors, (1272), 386 states have call successors, (1272) [2024-10-12 00:14:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2643 transitions. [2024-10-12 00:14:21,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1450 states and 2643 transitions. [2024-10-12 00:14:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 00:14:21,654 INFO L425 stractBuchiCegarLoop]: Abstraction has 1450 states and 2643 transitions. [2024-10-12 00:14:21,655 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-10-12 00:14:21,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1450 states and 2643 transitions. [2024-10-12 00:14:21,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2024-10-12 00:14:21,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:21,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:21,664 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, 1, 1] [2024-10-12 00:14:21,665 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, 1, 1] [2024-10-12 00:14:21,665 INFO L745 eck$LassoCheckResult]: Stem: 49652#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 49597#L-1 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; 49598#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 49621#L38 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; 49609#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 49611#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50168#L43 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; 49595#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49596#$Ultimate##0 ~n := #in~n; 50412#L25 assume ~n <= 0;#res := 1; 50410#factFINAL assume true; 50190#factEXIT >#72#return; 50186#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50383#$Ultimate##0 ~n := #in~n; 50400#L25 assume ~n <= 0;#res := 1; 50185#factFINAL assume true; 50187#factEXIT >#74#return; 49582#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 49583#$Ultimate##0 ~n := #in~n; 50218#L25 assume ~n <= 0;#res := 1; 50217#factFINAL assume true; 50216#factEXIT >#76#return; 49616#L30-3 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; 49617#binomialCoefficient_returnLabel#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; 49635#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 50688#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50686#L43 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; 50649#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50652#$Ultimate##0 ~n := #in~n; 50680#L25 assume !(~n <= 0); 50678#L26 call #t~ret0 := fact(~n - 1);< 50679#$Ultimate##0 ~n := #in~n; 50683#L25 assume ~n <= 0;#res := 1; 50682#factFINAL assume true; 50677#factEXIT >#70#return; 50666#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50668#factFINAL assume true; 50644#factEXIT >#78#return; 50633#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50639#$Ultimate##0 ~n := #in~n; 50654#L25 assume ~n <= 0;#res := 1; 50641#factFINAL assume true; 50631#factEXIT >#80#return; 50627#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50630#$Ultimate##0 ~n := #in~n; 50716#L25 assume !(~n <= 0); 50660#L26 call #t~ret0 := fact(~n - 1);< 50673#$Ultimate##0 ~n := #in~n; 50676#L25 assume ~n <= 0;#res := 1; 50670#factFINAL assume true; 50659#factEXIT >#70#return; 50655#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50642#factFINAL assume true; 50637#factEXIT >#82#return; 50623#L30-8 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; 50622#binomialCoefficient_returnLabel#2 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; 50621#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49838#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 49656#L42-4 havoc main_~k~0#1; 49657#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 49837#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 49836#L42-3 [2024-10-12 00:14:21,665 INFO L747 eck$LassoCheckResult]: Loop: 49836#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 49835#L43 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; 49701#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49718#$Ultimate##0 ~n := #in~n; 49834#L25 assume !(~n <= 0); 49727#L26 call #t~ret0 := fact(~n - 1);< 49767#$Ultimate##0 ~n := #in~n; 49764#L25 assume !(~n <= 0); 49739#L26 call #t~ret0 := fact(~n - 1);< 49755#$Ultimate##0 ~n := #in~n; 49764#L25 assume !(~n <= 0); 49739#L26 call #t~ret0 := fact(~n - 1);< 49755#$Ultimate##0 ~n := #in~n; 49766#L25 assume ~n <= 0;#res := 1; 49757#factFINAL assume true; 49751#factEXIT >#70#return; 49749#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49736#factFINAL assume true; 49741#factEXIT >#70#return; 49754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49825#factFINAL assume true; 49820#factEXIT >#70#return; 49817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49814#factFINAL assume true; 49809#factEXIT >#72#return; 49696#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 49718#$Ultimate##0 ~n := #in~n; 49834#L25 assume ~n <= 0;#res := 1; 49799#factFINAL assume true; 49829#factEXIT >#74#return; 49734#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 49824#$Ultimate##0 ~n := #in~n; 49819#L25 assume !(~n <= 0); 49730#L26 call #t~ret0 := fact(~n - 1);< 49735#$Ultimate##0 ~n := #in~n; 49840#L25 assume !(~n <= 0); 49740#L26 call #t~ret0 := fact(~n - 1);< 49746#$Ultimate##0 ~n := #in~n; 49764#L25 assume !(~n <= 0); 49739#L26 call #t~ret0 := fact(~n - 1);< 49755#$Ultimate##0 ~n := #in~n; 49766#L25 assume ~n <= 0;#res := 1; 49757#factFINAL assume true; 49751#factEXIT >#70#return; 49749#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49736#factFINAL assume true; 49741#factEXIT >#70#return; 49754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49825#factFINAL assume true; 49820#factEXIT >#70#return; 49817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49814#factFINAL assume true; 49809#factEXIT >#76#return; 49705#L30-3 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; 49878#binomialCoefficient_returnLabel#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; 49876#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49875#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 49874#L43 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; 49700#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49718#$Ultimate##0 ~n := #in~n; 49834#L25 assume !(~n <= 0); 49727#L26 call #t~ret0 := fact(~n - 1);< 49767#$Ultimate##0 ~n := #in~n; 49764#L25 assume !(~n <= 0); 49739#L26 call #t~ret0 := fact(~n - 1);< 49755#$Ultimate##0 ~n := #in~n; 49766#L25 assume ~n <= 0;#res := 1; 49757#factFINAL assume true; 49751#factEXIT >#70#return; 49749#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49736#factFINAL assume true; 49741#factEXIT >#70#return; 49720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49715#factFINAL assume true; 49716#factEXIT >#78#return; 49688#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 49717#$Ultimate##0 ~n := #in~n; 49844#L25 assume !(~n <= 0); 49722#L26 call #t~ret0 := fact(~n - 1);< 49750#$Ultimate##0 ~n := #in~n; 49747#L25 assume ~n <= 0;#res := 1; 49748#factFINAL assume true; 49721#factEXIT >#70#return; 49729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49856#factFINAL assume true; 49667#factEXIT >#80#return; 49694#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 49848#$Ultimate##0 ~n := #in~n; 49794#L25 assume !(~n <= 0); 49727#L26 call #t~ret0 := fact(~n - 1);< 49767#$Ultimate##0 ~n := #in~n; 49764#L25 assume !(~n <= 0); 49739#L26 call #t~ret0 := fact(~n - 1);< 49755#$Ultimate##0 ~n := #in~n; 49764#L25 assume !(~n <= 0); 49739#L26 call #t~ret0 := fact(~n - 1);< 49755#$Ultimate##0 ~n := #in~n; 49766#L25 assume ~n <= 0;#res := 1; 49757#factFINAL assume true; 49751#factEXIT >#70#return; 49749#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49736#factFINAL assume true; 49741#factEXIT >#70#return; 49754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49825#factFINAL assume true; 49820#factEXIT >#70#return; 49817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49814#factFINAL assume true; 49809#factEXIT >#82#return; 49702#L30-8 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; 49868#binomialCoefficient_returnLabel#2 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; 49660#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49658#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 49655#L42-4 havoc main_~k~0#1; 49618#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 49619#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 49836#L42-3 [2024-10-12 00:14:21,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 1 times [2024-10-12 00:14:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565776004] [2024-10-12 00:14:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:21,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236554265] [2024-10-12 00:14:21,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:21,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:21,685 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:21,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2024-10-12 00:14:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:21,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1609441497, now seen corresponding path program 1 times [2024-10-12 00:14:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:21,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635904033] [2024-10-12 00:14:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 00:14:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 00:14:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 00:14:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 00:14:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 00:14:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 34 proven. 44 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2024-10-12 00:14:21,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:21,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635904033] [2024-10-12 00:14:21,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635904033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:21,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121013824] [2024-10-12 00:14:21,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:21,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:21,999 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2024-10-12 00:14:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:22,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:14:22,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 419 proven. 80 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-12 00:14:22,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 23 proven. 228 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2024-10-12 00:14:22,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121013824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:22,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:22,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 14] total 23 [2024-10-12 00:14:22,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742482569] [2024-10-12 00:14:22,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:22,653 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:22,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:22,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 00:14:22,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2024-10-12 00:14:22,655 INFO L87 Difference]: Start difference. First operand 1450 states and 2643 transitions. cyclomatic complexity: 1217 Second operand has 23 states, 18 states have (on average 3.0) internal successors, (54), 21 states have internal predecessors, (54), 14 states have call successors, (22), 2 states have call predecessors, (22), 6 states have return successors, (23), 11 states have call predecessors, (23), 14 states have call successors, (23) [2024-10-12 00:14:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:23,319 INFO L93 Difference]: Finished difference Result 1805 states and 3390 transitions. [2024-10-12 00:14:23,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1805 states and 3390 transitions. [2024-10-12 00:14:23,390 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 252 [2024-10-12 00:14:23,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1805 states to 1801 states and 3386 transitions. [2024-10-12 00:14:23,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 465 [2024-10-12 00:14:23,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 465 [2024-10-12 00:14:23,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1801 states and 3386 transitions. [2024-10-12 00:14:23,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:23,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1801 states and 3386 transitions. [2024-10-12 00:14:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states and 3386 transitions. [2024-10-12 00:14:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1544. [2024-10-12 00:14:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 940 states have (on average 1.1053191489361702) internal successors, (1039), 913 states have internal predecessors, (1039), 420 states have call successors, (420), 176 states have call predecessors, (420), 184 states have return successors, (1414), 454 states have call predecessors, (1414), 420 states have call successors, (1414) [2024-10-12 00:14:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2873 transitions. [2024-10-12 00:14:23,456 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1544 states and 2873 transitions. [2024-10-12 00:14:23,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 00:14:23,457 INFO L425 stractBuchiCegarLoop]: Abstraction has 1544 states and 2873 transitions. [2024-10-12 00:14:23,457 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-10-12 00:14:23,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1544 states and 2873 transitions. [2024-10-12 00:14:23,463 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 173 [2024-10-12 00:14:23,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:23,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:23,464 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, 1, 1] [2024-10-12 00:14:23,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 11, 11, 11, 11, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:23,464 INFO L745 eck$LassoCheckResult]: Stem: 53843#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 53788#L-1 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; 53789#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 53813#L38 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; 53800#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 53802#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54403#L43 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; 54404#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54635#$Ultimate##0 ~n := #in~n; 54639#L25 assume ~n <= 0;#res := 1; 54638#factFINAL assume true; 54634#factEXIT >#72#return; 54449#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54453#$Ultimate##0 ~n := #in~n; 54454#L25 assume ~n <= 0;#res := 1; 54448#factFINAL assume true; 54450#factEXIT >#74#return; 53773#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53774#$Ultimate##0 ~n := #in~n; 54637#L25 assume ~n <= 0;#res := 1; 54636#factFINAL assume true; 54488#factEXIT >#76#return; 54487#L30-3 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; 53824#binomialCoefficient_returnLabel#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; 53825#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54988#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54984#L43 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; 54980#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54982#$Ultimate##0 ~n := #in~n; 55087#L25 assume !(~n <= 0); 55002#L26 call #t~ret0 := fact(~n - 1);< 55003#$Ultimate##0 ~n := #in~n; 55040#L25 assume ~n <= 0;#res := 1; 55035#factFINAL assume true; 55031#factEXIT >#70#return; 54989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54985#factFINAL assume true; 54983#factEXIT >#78#return; 54967#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54970#$Ultimate##0 ~n := #in~n; 55047#L25 assume ~n <= 0;#res := 1; 54973#factFINAL assume true; 54966#factEXIT >#80#return; 54955#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54960#$Ultimate##0 ~n := #in~n; 55043#L25 assume !(~n <= 0); 54996#L26 call #t~ret0 := fact(~n - 1);< 55023#$Ultimate##0 ~n := #in~n; 55039#L25 assume ~n <= 0;#res := 1; 55032#factFINAL assume true; 54994#factEXIT >#70#return; 55000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54971#factFINAL assume true; 54961#factEXIT >#82#return; 54953#L30-8 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; 54924#binomialCoefficient_returnLabel#2 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; 54921#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 53854#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 53855#L42-4 havoc main_~k~0#1; 53811#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 53812#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54077#L42-3 [2024-10-12 00:14:23,465 INFO L747 eck$LassoCheckResult]: Loop: 54077#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54074#L43 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; 53864#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53835#$Ultimate##0 ~n := #in~n; 54076#L25 assume !(~n <= 0); 53917#L26 call #t~ret0 := fact(~n - 1);< 53967#$Ultimate##0 ~n := #in~n; 53934#L25 assume ~n <= 0;#res := 1; 53925#factFINAL assume true; 53916#factEXIT >#70#return; 53915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53913#factFINAL assume true; 53857#factEXIT >#72#return; 53885#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53835#$Ultimate##0 ~n := #in~n; 54076#L25 assume ~n <= 0;#res := 1; 54073#factFINAL assume true; 54068#factEXIT >#74#return; 53858#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53935#$Ultimate##0 ~n := #in~n; 54007#L25 assume !(~n <= 0); 53917#L26 call #t~ret0 := fact(~n - 1);< 53967#$Ultimate##0 ~n := #in~n; 53934#L25 assume ~n <= 0;#res := 1; 53925#factFINAL assume true; 53916#factEXIT >#70#return; 53915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53913#factFINAL assume true; 53857#factEXIT >#76#return; 53897#L30-3 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; 54219#binomialCoefficient_returnLabel#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; 54214#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54213#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54212#L43 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; 53889#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53835#$Ultimate##0 ~n := #in~n; 54076#L25 assume !(~n <= 0); 53917#L26 call #t~ret0 := fact(~n - 1);< 53967#$Ultimate##0 ~n := #in~n; 54040#L25 assume !(~n <= 0); 53954#L26 call #t~ret0 := fact(~n - 1);< 54023#$Ultimate##0 ~n := #in~n; 54040#L25 assume !(~n <= 0); 53954#L26 call #t~ret0 := fact(~n - 1);< 54023#$Ultimate##0 ~n := #in~n; 54038#L25 assume ~n <= 0;#res := 1; 54026#factFINAL assume true; 54020#factEXIT >#70#return; 54016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54011#factFINAL assume true; 53950#factEXIT >#70#return; 53955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53971#factFINAL assume true; 53962#factEXIT >#70#return; 53936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53906#factFINAL assume true; 53909#factEXIT >#72#return; 53872#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53835#$Ultimate##0 ~n := #in~n; 54076#L25 assume !(~n <= 0); 53917#L26 call #t~ret0 := fact(~n - 1);< 53967#$Ultimate##0 ~n := #in~n; 54040#L25 assume !(~n <= 0); 53954#L26 call #t~ret0 := fact(~n - 1);< 54023#$Ultimate##0 ~n := #in~n; 54038#L25 assume ~n <= 0;#res := 1; 54026#factFINAL assume true; 54020#factEXIT >#70#return; 54016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54011#factFINAL assume true; 53950#factEXIT >#70#return; 53947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53944#factFINAL assume true; 53912#factEXIT >#74#return; 53875#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53910#$Ultimate##0 ~n := #in~n; 54089#L25 assume ~n <= 0;#res := 1; 54073#factFINAL assume true; 54068#factEXIT >#76#return; 54069#L30-3 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; 54010#binomialCoefficient_returnLabel#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; 53949#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 53946#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 53942#L43 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; 53892#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53835#$Ultimate##0 ~n := #in~n; 54076#L25 assume !(~n <= 0); 53917#L26 call #t~ret0 := fact(~n - 1);< 53967#$Ultimate##0 ~n := #in~n; 54040#L25 assume !(~n <= 0); 53954#L26 call #t~ret0 := fact(~n - 1);< 54023#$Ultimate##0 ~n := #in~n; 54038#L25 assume ~n <= 0;#res := 1; 54026#factFINAL assume true; 54020#factEXIT >#70#return; 54016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54011#factFINAL assume true; 53950#factEXIT >#70#return; 53947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53944#factFINAL assume true; 53912#factEXIT >#78#return; 53893#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53910#$Ultimate##0 ~n := #in~n; 54089#L25 assume !(~n <= 0); 53922#L26 call #t~ret0 := fact(~n - 1);< 53924#$Ultimate##0 ~n := #in~n; 53934#L25 assume ~n <= 0;#res := 1; 53925#factFINAL assume true; 53916#factEXIT >#70#return; 53915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53913#factFINAL assume true; 53857#factEXIT >#80#return; 53869#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53935#$Ultimate##0 ~n := #in~n; 54007#L25 assume !(~n <= 0); 53917#L26 call #t~ret0 := fact(~n - 1);< 53967#$Ultimate##0 ~n := #in~n; 53934#L25 assume ~n <= 0;#res := 1; 53925#factFINAL assume true; 53916#factEXIT >#70#return; 53915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53913#factFINAL assume true; 53857#factEXIT >#82#return; 53853#L30-8 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; 53852#binomialCoefficient_returnLabel#2 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; 53851#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 53849#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 53846#L42-4 havoc main_~k~0#1; 53809#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 53810#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54077#L42-3 [2024-10-12 00:14:23,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:23,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 2 times [2024-10-12 00:14:23,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:23,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509005010] [2024-10-12 00:14:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:23,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:23,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810547326] [2024-10-12 00:14:23,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:23,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:23,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:23,478 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:23,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2024-10-12 00:14:23,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:23,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:14:23,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:23,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:23,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1118128720, now seen corresponding path program 2 times [2024-10-12 00:14:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:23,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655939310] [2024-10-12 00:14:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:23,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 00:14:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 00:14:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 00:14:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 00:14:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 00:14:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 00:14:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 00:14:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 52 proven. 220 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2024-10-12 00:14:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655939310] [2024-10-12 00:14:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655939310] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914047285] [2024-10-12 00:14:23,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:23,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:23,874 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:23,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2024-10-12 00:14:23,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:23,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:23,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:14:24,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 505 proven. 60 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2024-10-12 00:14:24,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 49 proven. 230 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2024-10-12 00:14:24,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914047285] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:24,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:24,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 22 [2024-10-12 00:14:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813731840] [2024-10-12 00:14:24,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:24,391 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:24,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 00:14:24,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-10-12 00:14:24,392 INFO L87 Difference]: Start difference. First operand 1544 states and 2873 transitions. cyclomatic complexity: 1353 Second operand has 22 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 20 states have internal predecessors, (59), 15 states have call successors, (26), 2 states have call predecessors, (26), 6 states have return successors, (27), 9 states have call predecessors, (27), 15 states have call successors, (27) [2024-10-12 00:14:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:24,745 INFO L93 Difference]: Finished difference Result 1652 states and 3021 transitions. [2024-10-12 00:14:24,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1652 states and 3021 transitions. [2024-10-12 00:14:24,759 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 211 [2024-10-12 00:14:24,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1652 states to 1650 states and 3019 transitions. [2024-10-12 00:14:24,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2024-10-12 00:14:24,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2024-10-12 00:14:24,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1650 states and 3019 transitions. [2024-10-12 00:14:24,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:24,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1650 states and 3019 transitions. [2024-10-12 00:14:24,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states and 3019 transitions. [2024-10-12 00:14:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1600. [2024-10-12 00:14:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 978 states have (on average 1.1094069529652353) internal successors, (1085), 949 states have internal predecessors, (1085), 438 states have call successors, (438), 176 states have call predecessors, (438), 184 states have return successors, (1402), 474 states have call predecessors, (1402), 438 states have call successors, (1402) [2024-10-12 00:14:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2925 transitions. [2024-10-12 00:14:24,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1600 states and 2925 transitions. [2024-10-12 00:14:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 00:14:24,869 INFO L425 stractBuchiCegarLoop]: Abstraction has 1600 states and 2925 transitions. [2024-10-12 00:14:24,869 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-10-12 00:14:24,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1600 states and 2925 transitions. [2024-10-12 00:14:24,876 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 203 [2024-10-12 00:14:24,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:24,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:24,880 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, 1, 1] [2024-10-12 00:14:24,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [25, 25, 16, 16, 16, 16, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:24,880 INFO L745 eck$LassoCheckResult]: Stem: 58040#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 57968#L-1 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; 57969#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 57991#L38 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; 57979#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 57981#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58719#L43 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; 57966#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57967#$Ultimate##0 ~n := #in~n; 58710#L25 assume ~n <= 0;#res := 1; 58707#factFINAL assume true; 58702#factEXIT >#72#return; 58018#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58019#$Ultimate##0 ~n := #in~n; 58733#L25 assume ~n <= 0;#res := 1; 58732#factFINAL assume true; 58731#factEXIT >#74#return; 57954#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57955#$Ultimate##0 ~n := #in~n; 58727#L25 assume ~n <= 0;#res := 1; 58728#factFINAL assume true; 58722#factEXIT >#76#return; 58723#L30-3 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; 58003#binomialCoefficient_returnLabel#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; 58004#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59222#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 59218#L43 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; 59213#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 59216#$Ultimate##0 ~n := #in~n; 59325#L25 assume !(~n <= 0); 59229#L26 call #t~ret0 := fact(~n - 1);< 59230#$Ultimate##0 ~n := #in~n; 59277#L25 assume ~n <= 0;#res := 1; 59266#factFINAL assume true; 59228#factEXIT >#70#return; 59223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59219#factFINAL assume true; 59217#factEXIT >#78#return; 59201#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 59203#$Ultimate##0 ~n := #in~n; 59282#L25 assume ~n <= 0;#res := 1; 59207#factFINAL assume true; 59199#factEXIT >#80#return; 59188#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 59193#$Ultimate##0 ~n := #in~n; 59284#L25 assume !(~n <= 0); 59243#L26 call #t~ret0 := fact(~n - 1);< 59252#$Ultimate##0 ~n := #in~n; 59278#L25 assume ~n <= 0;#res := 1; 59267#factFINAL assume true; 59261#factEXIT >#70#return; 59264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 59204#factFINAL assume true; 59194#factEXIT >#82#return; 59186#L30-8 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; 59158#binomialCoefficient_returnLabel#2 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; 59155#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58270#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 58266#L42-4 havoc main_~k~0#1; 58261#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 58260#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 58255#L42-3 [2024-10-12 00:14:24,880 INFO L747 eck$LassoCheckResult]: Loop: 58255#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58249#L43 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; 58064#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58017#$Ultimate##0 ~n := #in~n; 58253#L25 assume !(~n <= 0); 58154#L26 call #t~ret0 := fact(~n - 1);< 58187#$Ultimate##0 ~n := #in~n; 58168#L25 assume ~n <= 0;#res := 1; 58169#factFINAL assume true; 58149#factEXIT >#70#return; 58156#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58257#factFINAL assume true; 58254#factEXIT >#72#return; 58016#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58017#$Ultimate##0 ~n := #in~n; 58253#L25 assume ~n <= 0;#res := 1; 58189#factFINAL assume true; 58234#factEXIT >#74#return; 58063#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58259#$Ultimate##0 ~n := #in~n; 58190#L25 assume !(~n <= 0); 58154#L26 call #t~ret0 := fact(~n - 1);< 58187#$Ultimate##0 ~n := #in~n; 58183#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58177#$Ultimate##0 ~n := #in~n; 58183#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58177#$Ultimate##0 ~n := #in~n; 58183#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58177#$Ultimate##0 ~n := #in~n; 58184#L25 assume ~n <= 0;#res := 1; 58181#factFINAL assume true; 58174#factEXIT >#70#return; 58170#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58159#factFINAL assume true; 58164#factEXIT >#70#return; 58172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58256#factFINAL assume true; 58250#factEXIT >#70#return; 58229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58231#factFINAL assume true; 58227#factEXIT >#70#return; 58228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58342#factFINAL assume true; 58341#factEXIT >#76#return; 58108#L30-3 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; 58350#binomialCoefficient_returnLabel#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; 58349#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58348#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58347#L43 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; 58022#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58020#$Ultimate##0 ~n := #in~n; 58024#L25 assume !(~n <= 0); 58008#L26 call #t~ret0 := fact(~n - 1);< 58178#$Ultimate##0 ~n := #in~n; 58168#L25 assume ~n <= 0;#res := 1; 58169#factFINAL assume true; 58149#factEXIT >#70#return; 58156#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58257#factFINAL assume true; 58254#factEXIT >#72#return; 58082#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58017#$Ultimate##0 ~n := #in~n; 58253#L25 assume !(~n <= 0); 58154#L26 call #t~ret0 := fact(~n - 1);< 58187#$Ultimate##0 ~n := #in~n; 58183#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58177#$Ultimate##0 ~n := #in~n; 58183#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58177#$Ultimate##0 ~n := #in~n; 58183#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58177#$Ultimate##0 ~n := #in~n; 58184#L25 assume ~n <= 0;#res := 1; 58181#factFINAL assume true; 58174#factEXIT >#70#return; 58170#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58159#factFINAL assume true; 58164#factEXIT >#70#return; 58172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58256#factFINAL assume true; 58250#factEXIT >#70#return; 58229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58231#factFINAL assume true; 58227#factEXIT >#70#return; 58228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58342#factFINAL assume true; 58341#factEXIT >#74#return; 58240#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57953#$Ultimate##0 ~n := #in~n; 58252#L25 assume ~n <= 0;#res := 1; 58189#factFINAL assume true; 58234#factEXIT >#76#return; 58246#L30-3 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; 58340#binomialCoefficient_returnLabel#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; 58339#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58338#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58335#L43 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; 58098#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58017#$Ultimate##0 ~n := #in~n; 58253#L25 assume !(~n <= 0); 58154#L26 call #t~ret0 := fact(~n - 1);< 58187#$Ultimate##0 ~n := #in~n; 58183#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58177#$Ultimate##0 ~n := #in~n; 58184#L25 assume ~n <= 0;#res := 1; 58181#factFINAL assume true; 58174#factEXIT >#70#return; 58170#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58159#factFINAL assume true; 58164#factEXIT >#70#return; 58171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58115#factFINAL assume true; 58054#factEXIT >#78#return; 58026#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58020#$Ultimate##0 ~n := #in~n; 58024#L25 assume ~n <= 0;#res := 1; 58189#factFINAL assume true; 58234#factEXIT >#80#return; 58069#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58259#$Ultimate##0 ~n := #in~n; 58190#L25 assume !(~n <= 0); 58154#L26 call #t~ret0 := fact(~n - 1);< 58187#$Ultimate##0 ~n := #in~n; 58183#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58177#$Ultimate##0 ~n := #in~n; 58183#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58177#$Ultimate##0 ~n := #in~n; 58183#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58177#$Ultimate##0 ~n := #in~n; 58184#L25 assume ~n <= 0;#res := 1; 58181#factFINAL assume true; 58174#factEXIT >#70#return; 58170#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58159#factFINAL assume true; 58164#factEXIT >#70#return; 58172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58256#factFINAL assume true; 58250#factEXIT >#70#return; 58229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58231#factFINAL assume true; 58227#factEXIT >#70#return; 58228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58342#factFINAL assume true; 58341#factEXIT >#82#return; 58050#L30-8 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; 58051#binomialCoefficient_returnLabel#2 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; 58377#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58376#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 58044#L42-4 havoc main_~k~0#1; 57988#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 57989#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 58255#L42-3 [2024-10-12 00:14:24,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 3 times [2024-10-12 00:14:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510729921] [2024-10-12 00:14:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369287120] [2024-10-12 00:14:24,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:24,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:24,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,895 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2024-10-12 00:14:25,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-12 00:14:25,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:14:25,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:25,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:25,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1197743600, now seen corresponding path program 3 times [2024-10-12 00:14:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186164939] [2024-10-12 00:14:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 00:14:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 00:14:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 00:14:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 00:14:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 00:14:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 00:14:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 00:14:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-12 00:14:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 65 proven. 115 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2024-10-12 00:14:25,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:25,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186164939] [2024-10-12 00:14:25,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186164939] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:25,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705751050] [2024-10-12 00:14:25,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:25,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:25,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:25,280 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:25,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2024-10-12 00:14:25,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-12 00:14:25,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:25,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 00:14:25,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 377 proven. 7 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2024-10-12 00:14:25,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 377 proven. 16 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2024-10-12 00:14:26,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705751050] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:26,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:26,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 13] total 23 [2024-10-12 00:14:26,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491322338] [2024-10-12 00:14:26,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:26,056 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:26,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:26,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 00:14:26,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-10-12 00:14:26,057 INFO L87 Difference]: Start difference. First operand 1600 states and 2925 transitions. cyclomatic complexity: 1349 Second operand has 23 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 23 states have internal predecessors, (60), 15 states have call successors, (29), 1 states have call predecessors, (29), 6 states have return successors, (31), 13 states have call predecessors, (31), 15 states have call successors, (31) [2024-10-12 00:14:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:26,834 INFO L93 Difference]: Finished difference Result 2141 states and 4162 transitions. [2024-10-12 00:14:26,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2141 states and 4162 transitions. [2024-10-12 00:14:26,852 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 322 [2024-10-12 00:14:26,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2141 states to 1847 states and 3474 transitions. [2024-10-12 00:14:26,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 555 [2024-10-12 00:14:26,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2024-10-12 00:14:26,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1847 states and 3474 transitions. [2024-10-12 00:14:26,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:26,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1847 states and 3474 transitions. [2024-10-12 00:14:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states and 3474 transitions. [2024-10-12 00:14:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1750. [2024-10-12 00:14:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1001 states have (on average 1.1258741258741258) internal successors, (1127), 989 states have internal predecessors, (1127), 555 states have call successors, (555), 171 states have call predecessors, (555), 194 states have return successors, (1676), 589 states have call predecessors, (1676), 555 states have call successors, (1676) [2024-10-12 00:14:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3358 transitions. [2024-10-12 00:14:26,944 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1750 states and 3358 transitions. [2024-10-12 00:14:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-12 00:14:26,945 INFO L425 stractBuchiCegarLoop]: Abstraction has 1750 states and 3358 transitions. [2024-10-12 00:14:26,945 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-10-12 00:14:26,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1750 states and 3358 transitions. [2024-10-12 00:14:26,952 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 304 [2024-10-12 00:14:26,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:26,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:26,954 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, 1, 1] [2024-10-12 00:14:26,954 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:26,954 INFO L745 eck$LassoCheckResult]: Stem: 63133#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 63038#L-1 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; 63039#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 63063#L38 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; 63134#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63212#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63208#L43 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; 63209#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63359#$Ultimate##0 ~n := #in~n; 63360#L25 assume ~n <= 0;#res := 1; 63257#factFINAL assume true; 63258#factEXIT >#72#return; 63100#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63101#$Ultimate##0 ~n := #in~n; 63871#L25 assume ~n <= 0;#res := 1; 63870#factFINAL assume true; 63339#factEXIT >#74#return; 63025#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63026#$Ultimate##0 ~n := #in~n; 63858#L25 assume ~n <= 0;#res := 1; 63365#factFINAL assume true; 63362#factEXIT >#76#return; 63059#L30-3 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; 63060#binomialCoefficient_returnLabel#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; 63091#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64354#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64353#L43 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; 64343#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64351#$Ultimate##0 ~n := #in~n; 64364#L25 assume !(~n <= 0); 64359#L26 call #t~ret0 := fact(~n - 1);< 64360#$Ultimate##0 ~n := #in~n; 64366#L25 assume ~n <= 0;#res := 1; 64363#factFINAL assume true; 64358#factEXIT >#70#return; 64337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64355#factFINAL assume true; 64352#factEXIT >#78#return; 64323#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 64327#$Ultimate##0 ~n := #in~n; 64362#L25 assume ~n <= 0;#res := 1; 64329#factFINAL assume true; 64320#factEXIT >#80#return; 64302#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 64316#$Ultimate##0 ~n := #in~n; 64407#L25 assume !(~n <= 0); 64335#L26 call #t~ret0 := fact(~n - 1);< 64361#$Ultimate##0 ~n := #in~n; 64373#L25 assume ~n <= 0;#res := 1; 64368#factFINAL assume true; 64330#factEXIT >#70#return; 64328#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64317#factFINAL assume true; 64300#factEXIT >#82#return; 64299#L30-8 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; 64298#binomialCoefficient_returnLabel#2 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; 64297#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 63140#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 63139#L42-4 havoc main_~k~0#1; 63062#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 63054#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63056#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63617#L43 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; 63413#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63470#$Ultimate##0 ~n := #in~n; 63614#L25 assume !(~n <= 0); 63477#L26 call #t~ret0 := fact(~n - 1);< 63516#$Ultimate##0 ~n := #in~n; 63510#L25 assume ~n <= 0;#res := 1; 63513#factFINAL assume true; 63592#factEXIT >#70#return; 63590#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63585#factFINAL assume true; 63582#factEXIT >#72#return; 63385#L30-1 [2024-10-12 00:14:26,955 INFO L747 eck$LassoCheckResult]: Loop: 63385#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63470#$Ultimate##0 ~n := #in~n; 63614#L25 assume ~n <= 0;#res := 1; 63610#factFINAL assume true; 63594#factEXIT >#74#return; 63107#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63102#$Ultimate##0 ~n := #in~n; 63115#L25 assume !(~n <= 0); 63477#L26 call #t~ret0 := fact(~n - 1);< 63516#$Ultimate##0 ~n := #in~n; 63494#L25 assume !(~n <= 0); 63476#L26 call #t~ret0 := fact(~n - 1);< 63519#$Ultimate##0 ~n := #in~n; 63559#L25 assume ~n <= 0;#res := 1; 63551#factFINAL assume true; 63517#factEXIT >#70#return; 63514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63504#factFINAL assume true; 63500#factEXIT >#70#return; 63503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63619#factFINAL assume true; 63376#factEXIT >#76#return; 63455#L30-3 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; 63911#binomialCoefficient_returnLabel#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; 63909#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 63907#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63906#L43 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; 63579#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63586#$Ultimate##0 ~n := #in~n; 63580#L25 assume !(~n <= 0); 63512#L26 call #t~ret0 := fact(~n - 1);< 63515#$Ultimate##0 ~n := #in~n; 63510#L25 assume ~n <= 0;#res := 1; 63513#factFINAL assume true; 63592#factEXIT >#70#return; 63590#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63585#factFINAL assume true; 63582#factEXIT >#72#return; 63424#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63470#$Ultimate##0 ~n := #in~n; 63614#L25 assume !(~n <= 0); 63477#L26 call #t~ret0 := fact(~n - 1);< 63516#$Ultimate##0 ~n := #in~n; 63494#L25 assume !(~n <= 0); 63476#L26 call #t~ret0 := fact(~n - 1);< 63519#$Ultimate##0 ~n := #in~n; 63559#L25 assume ~n <= 0;#res := 1; 63551#factFINAL assume true; 63517#factEXIT >#70#return; 63514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63504#factFINAL assume true; 63500#factEXIT >#70#return; 63503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63619#factFINAL assume true; 63376#factEXIT >#74#return; 63460#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63612#$Ultimate##0 ~n := #in~n; 63615#L25 assume ~n <= 0;#res := 1; 63610#factFINAL assume true; 63594#factEXIT >#76#return; 63609#L30-3 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; 63905#binomialCoefficient_returnLabel#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; 63904#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 63903#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63902#L43 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; 63419#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63470#$Ultimate##0 ~n := #in~n; 63614#L25 assume !(~n <= 0); 63477#L26 call #t~ret0 := fact(~n - 1);< 63516#$Ultimate##0 ~n := #in~n; 63494#L25 assume !(~n <= 0); 63476#L26 call #t~ret0 := fact(~n - 1);< 63519#$Ultimate##0 ~n := #in~n; 63559#L25 assume ~n <= 0;#res := 1; 63551#factFINAL assume true; 63517#factEXIT >#70#return; 63514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63504#factFINAL assume true; 63500#factEXIT >#70#return; 63503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63619#factFINAL assume true; 63376#factEXIT >#78#return; 63449#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63586#$Ultimate##0 ~n := #in~n; 63580#L25 assume !(~n <= 0); 63512#L26 call #t~ret0 := fact(~n - 1);< 63515#$Ultimate##0 ~n := #in~n; 63510#L25 assume ~n <= 0;#res := 1; 63513#factFINAL assume true; 63592#factEXIT >#70#return; 63590#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63585#factFINAL assume true; 63582#factEXIT >#80#return; 63109#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63102#$Ultimate##0 ~n := #in~n; 63115#L25 assume !(~n <= 0); 63477#L26 call #t~ret0 := fact(~n - 1);< 63516#$Ultimate##0 ~n := #in~n; 63510#L25 assume ~n <= 0;#res := 1; 63513#factFINAL assume true; 63592#factEXIT >#70#return; 63590#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63585#factFINAL assume true; 63582#factEXIT >#82#return; 63584#L30-8 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; 63735#binomialCoefficient_returnLabel#2 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; 63734#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 63733#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 63138#L42-4 havoc main_~k~0#1; 63061#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 63052#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63053#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63618#L43 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; 63126#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63102#$Ultimate##0 ~n := #in~n; 63115#L25 assume !(~n <= 0); 63477#L26 call #t~ret0 := fact(~n - 1);< 63516#$Ultimate##0 ~n := #in~n; 63510#L25 assume ~n <= 0;#res := 1; 63513#factFINAL assume true; 63592#factEXIT >#70#return; 63590#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63585#factFINAL assume true; 63582#factEXIT >#72#return; 63385#L30-1 [2024-10-12 00:14:26,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash -115555602, now seen corresponding path program 4 times [2024-10-12 00:14:26,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:26,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103887688] [2024-10-12 00:14:26,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:26,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:26,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258525832] [2024-10-12 00:14:26,967 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:26,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:26,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,969 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2024-10-12 00:14:27,091 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:27,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:14:27,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:27,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1030687726, now seen corresponding path program 4 times [2024-10-12 00:14:27,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676589043] [2024-10-12 00:14:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 00:14:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 00:14:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 00:14:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 00:14:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 00:14:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 00:14:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 00:14:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 155 proven. 44 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-10-12 00:14:27,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:27,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676589043] [2024-10-12 00:14:27,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676589043] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:27,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724561296] [2024-10-12 00:14:27,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:27,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:27,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:27,346 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:27,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2024-10-12 00:14:27,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:27,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:27,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 00:14:27,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 489 proven. 27 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-10-12 00:14:27,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 79 proven. 179 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2024-10-12 00:14:27,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724561296] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:27,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:27,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 22 [2024-10-12 00:14:27,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918099123] [2024-10-12 00:14:27,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:27,860 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:27,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 00:14:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2024-10-12 00:14:27,860 INFO L87 Difference]: Start difference. First operand 1750 states and 3358 transitions. cyclomatic complexity: 1635 Second operand has 22 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 20 states have internal predecessors, (69), 15 states have call successors, (31), 2 states have call predecessors, (31), 6 states have return successors, (31), 10 states have call predecessors, (31), 15 states have call successors, (31) [2024-10-12 00:14:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:28,685 INFO L93 Difference]: Finished difference Result 2585 states and 5407 transitions. [2024-10-12 00:14:28,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2585 states and 5407 transitions. [2024-10-12 00:14:28,713 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 424 [2024-10-12 00:14:28,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2585 states to 2547 states and 5339 transitions. [2024-10-12 00:14:28,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 810 [2024-10-12 00:14:28,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 815 [2024-10-12 00:14:28,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2547 states and 5339 transitions. [2024-10-12 00:14:28,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:28,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2547 states and 5339 transitions. [2024-10-12 00:14:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states and 5339 transitions. [2024-10-12 00:14:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2185. [2024-10-12 00:14:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2185 states, 1208 states have (on average 1.1374172185430464) internal successors, (1374), 1196 states have internal predecessors, (1374), 783 states have call successors, (783), 177 states have call predecessors, (783), 194 states have return successors, (2367), 811 states have call predecessors, (2367), 783 states have call successors, (2367) [2024-10-12 00:14:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 4524 transitions. [2024-10-12 00:14:28,850 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2185 states and 4524 transitions. [2024-10-12 00:14:28,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-12 00:14:28,851 INFO L425 stractBuchiCegarLoop]: Abstraction has 2185 states and 4524 transitions. [2024-10-12 00:14:28,851 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-10-12 00:14:28,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2185 states and 4524 transitions. [2024-10-12 00:14:28,861 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 349 [2024-10-12 00:14:28,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:28,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:28,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 6, 3, 3, 3, 3, 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, 1] [2024-10-12 00:14:28,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [23, 23, 14, 14, 14, 14, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:28,865 INFO L745 eck$LassoCheckResult]: Stem: 68403#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 68340#L-1 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; 68341#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 68368#L38 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; 68404#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 68599#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 68597#L43 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; 68552#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 68553#$Ultimate##0 ~n := #in~n; 68855#L25 assume ~n <= 0;#res := 1; 68854#factFINAL assume true; 68551#factEXIT >#72#return; 68528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 68851#$Ultimate##0 ~n := #in~n; 68853#L25 assume ~n <= 0;#res := 1; 68527#factFINAL assume true; 68529#factEXIT >#74#return; 68325#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 68326#$Ultimate##0 ~n := #in~n; 68850#L25 assume ~n <= 0;#res := 1; 68849#factFINAL assume true; 68683#factEXIT >#76#return; 68684#L30-3 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; 68846#binomialCoefficient_returnLabel#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; 68844#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 68839#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 68830#L43 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; 68810#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 68816#$Ultimate##0 ~n := #in~n; 68857#L25 assume !(~n <= 0); 68842#L26 call #t~ret0 := fact(~n - 1);< 68843#$Ultimate##0 ~n := #in~n; 68852#L25 assume !(~n <= 0); 68872#L26 call #t~ret0 := fact(~n - 1);< 68889#$Ultimate##0 ~n := #in~n; 68895#L25 assume ~n <= 0;#res := 1; 68891#factFINAL assume true; 68886#factEXIT >#70#return; 68882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68878#factFINAL assume true; 68867#factEXIT >#70#return; 68866#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68864#factFINAL assume true; 68860#factEXIT >#78#return; 68760#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 68788#$Ultimate##0 ~n := #in~n; 68901#L25 assume ~n <= 0;#res := 1; 68801#factFINAL assume true; 68790#factEXIT >#80#return; 68761#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 68786#$Ultimate##0 ~n := #in~n; 68897#L25 assume !(~n <= 0); 68821#L26 call #t~ret0 := fact(~n - 1);< 68838#$Ultimate##0 ~n := #in~n; 68840#L25 assume ~n <= 0;#res := 1; 68831#factFINAL assume true; 68817#factEXIT >#70#return; 68800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68787#factFINAL assume true; 68756#factEXIT >#82#return; 68755#L30-8 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; 68753#binomialCoefficient_returnLabel#2 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; 68751#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 68413#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 68409#L42-4 [2024-10-12 00:14:28,865 INFO L747 eck$LassoCheckResult]: Loop: 68409#L42-4 havoc main_~k~0#1; 68366#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 68357#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 68358#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69791#L43 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; 69370#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69492#$Ultimate##0 ~n := #in~n; 69636#L25 assume !(~n <= 0); 69504#L26 call #t~ret0 := fact(~n - 1);< 69505#$Ultimate##0 ~n := #in~n; 69559#L25 assume !(~n <= 0); 69507#L26 call #t~ret0 := fact(~n - 1);< 69566#$Ultimate##0 ~n := #in~n; 69607#L25 assume ~n <= 0;#res := 1; 69568#factFINAL assume true; 69561#factEXIT >#70#return; 69563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69702#factFINAL assume true; 69698#factEXIT >#70#return; 69697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69696#factFINAL assume true; 69694#factEXIT >#72#return; 69418#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 68390#$Ultimate##0 ~n := #in~n; 69722#L25 assume ~n <= 0;#res := 1; 69721#factFINAL assume true; 69714#factEXIT >#74#return; 69452#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69489#$Ultimate##0 ~n := #in~n; 69679#L25 assume !(~n <= 0); 69499#L26 call #t~ret0 := fact(~n - 1);< 69637#$Ultimate##0 ~n := #in~n; 69559#L25 assume !(~n <= 0); 69507#L26 call #t~ret0 := fact(~n - 1);< 69566#$Ultimate##0 ~n := #in~n; 69559#L25 assume !(~n <= 0); 69507#L26 call #t~ret0 := fact(~n - 1);< 69566#$Ultimate##0 ~n := #in~n; 69559#L25 assume !(~n <= 0); 69507#L26 call #t~ret0 := fact(~n - 1);< 69566#$Ultimate##0 ~n := #in~n; 69607#L25 assume ~n <= 0;#res := 1; 69568#factFINAL assume true; 69561#factEXIT >#70#return; 69563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69702#factFINAL assume true; 69698#factEXIT >#70#return; 69699#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69506#factFINAL assume true; 69512#factEXIT >#70#return; 69536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69537#factFINAL assume true; 69564#factEXIT >#70#return; 69493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69494#factFINAL assume true; 69703#factEXIT >#76#return; 69487#L30-3 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; 69783#binomialCoefficient_returnLabel#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; 69782#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 69781#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69780#L43 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; 69376#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69492#$Ultimate##0 ~n := #in~n; 69636#L25 assume !(~n <= 0); 69504#L26 call #t~ret0 := fact(~n - 1);< 69505#$Ultimate##0 ~n := #in~n; 69559#L25 assume !(~n <= 0); 69507#L26 call #t~ret0 := fact(~n - 1);< 69566#$Ultimate##0 ~n := #in~n; 69607#L25 assume ~n <= 0;#res := 1; 69568#factFINAL assume true; 69561#factEXIT >#70#return; 69563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69702#factFINAL assume true; 69698#factEXIT >#70#return; 69697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69696#factFINAL assume true; 69694#factEXIT >#72#return; 69447#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 68390#$Ultimate##0 ~n := #in~n; 69722#L25 assume !(~n <= 0); 69499#L26 call #t~ret0 := fact(~n - 1);< 69637#$Ultimate##0 ~n := #in~n; 69559#L25 assume !(~n <= 0); 69507#L26 call #t~ret0 := fact(~n - 1);< 69566#$Ultimate##0 ~n := #in~n; 69607#L25 assume ~n <= 0;#res := 1; 69568#factFINAL assume true; 69561#factEXIT >#70#return; 69563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69702#factFINAL assume true; 69698#factEXIT >#70#return; 69697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69696#factFINAL assume true; 69694#factEXIT >#74#return; 69571#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69686#$Ultimate##0 ~n := #in~n; 69687#L25 assume ~n <= 0;#res := 1; 69721#factFINAL assume true; 69714#factEXIT >#76#return; 69716#L30-3 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; 69760#binomialCoefficient_returnLabel#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; 69759#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 69757#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69751#L43 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; 69428#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69492#$Ultimate##0 ~n := #in~n; 69636#L25 assume !(~n <= 0); 69504#L26 call #t~ret0 := fact(~n - 1);< 69505#$Ultimate##0 ~n := #in~n; 69559#L25 assume !(~n <= 0); 69507#L26 call #t~ret0 := fact(~n - 1);< 69566#$Ultimate##0 ~n := #in~n; 69607#L25 assume ~n <= 0;#res := 1; 69568#factFINAL assume true; 69561#factEXIT >#70#return; 69563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69702#factFINAL assume true; 69698#factEXIT >#70#return; 69697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69696#factFINAL assume true; 69694#factEXIT >#78#return; 69549#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69689#$Ultimate##0 ~n := #in~n; 69538#L25 assume !(~n <= 0); 69496#L26 call #t~ret0 := fact(~n - 1);< 69560#$Ultimate##0 ~n := #in~n; 69534#L25 assume ~n <= 0;#res := 1; 69535#factFINAL assume true; 69495#factEXIT >#70#return; 69502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69701#factFINAL assume true; 69690#factEXIT >#80#return; 69364#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69489#$Ultimate##0 ~n := #in~n; 69679#L25 assume !(~n <= 0); 69499#L26 call #t~ret0 := fact(~n - 1);< 69637#$Ultimate##0 ~n := #in~n; 69534#L25 assume ~n <= 0;#res := 1; 69535#factFINAL assume true; 69495#factEXIT >#70#return; 69502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69701#factFINAL assume true; 69690#factEXIT >#82#return; 69691#L30-8 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; 69746#binomialCoefficient_returnLabel#2 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; 69731#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 69732#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 68409#L42-4 [2024-10-12 00:14:28,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2035631200, now seen corresponding path program 1 times [2024-10-12 00:14:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:28,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539291464] [2024-10-12 00:14:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 00:14:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 00:14:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 29 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 00:14:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539291464] [2024-10-12 00:14:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539291464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058723786] [2024-10-12 00:14:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:28,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:28,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,978 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2024-10-12 00:14:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:14:29,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-12 00:14:29,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-12 00:14:29,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058723786] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:29,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:29,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 14 [2024-10-12 00:14:29,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926665057] [2024-10-12 00:14:29,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:29,263 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:29,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash 11863442, now seen corresponding path program 5 times [2024-10-12 00:14:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:29,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35061141] [2024-10-12 00:14:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:29,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 00:14:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 00:14:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 00:14:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 00:14:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 00:14:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 00:14:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 00:14:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 00:14:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 123 proven. 70 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-10-12 00:14:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35061141] [2024-10-12 00:14:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35061141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747814334] [2024-10-12 00:14:29,428 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:14:29,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:29,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:29,430 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:29,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2024-10-12 00:14:29,580 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-12 00:14:29,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:29,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:14:29,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 687 proven. 38 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-12 00:14:29,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 127 proven. 127 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2024-10-12 00:14:29,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747814334] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:29,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:29,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 18 [2024-10-12 00:14:29,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156575785] [2024-10-12 00:14:29,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:29,976 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:29,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 00:14:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:14:29,977 INFO L87 Difference]: Start difference. First operand 2185 states and 4524 transitions. cyclomatic complexity: 2384 Second operand has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 10 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-12 00:14:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:30,100 INFO L93 Difference]: Finished difference Result 2208 states and 4587 transitions. [2024-10-12 00:14:30,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2208 states and 4587 transitions. [2024-10-12 00:14:30,116 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 374 [2024-10-12 00:14:30,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2208 states to 2196 states and 4569 transitions. [2024-10-12 00:14:30,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 720 [2024-10-12 00:14:30,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 720 [2024-10-12 00:14:30,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2196 states and 4569 transitions. [2024-10-12 00:14:30,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:30,143 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2196 states and 4569 transitions. [2024-10-12 00:14:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states and 4569 transitions. [2024-10-12 00:14:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2137. [2024-10-12 00:14:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 1180 states have (on average 1.1338983050847458) internal successors, (1338), 1166 states have internal predecessors, (1338), 765 states have call successors, (765), 175 states have call predecessors, (765), 192 states have return successors, (2335), 795 states have call predecessors, (2335), 765 states have call successors, (2335) [2024-10-12 00:14:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 4438 transitions. [2024-10-12 00:14:30,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2137 states and 4438 transitions. [2024-10-12 00:14:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:14:30,223 INFO L425 stractBuchiCegarLoop]: Abstraction has 2137 states and 4438 transitions. [2024-10-12 00:14:30,223 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-10-12 00:14:30,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2137 states and 4438 transitions. [2024-10-12 00:14:30,232 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 349 [2024-10-12 00:14:30,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:30,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:30,235 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 8, 5, 5, 5, 5, 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, 1, 1] [2024-10-12 00:14:30,235 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:30,235 INFO L745 eck$LassoCheckResult]: Stem: 74481#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 74413#L-1 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; 74414#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 74438#L38 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; 74482#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 74629#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74626#L43 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; 74627#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75015#$Ultimate##0 ~n := #in~n; 75017#L25 assume ~n <= 0;#res := 1; 75016#factFINAL assume true; 75014#factEXIT >#72#return; 74588#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74618#$Ultimate##0 ~n := #in~n; 74631#L25 assume ~n <= 0;#res := 1; 74619#factFINAL assume true; 74587#factEXIT >#74#return; 74589#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74777#$Ultimate##0 ~n := #in~n; 74778#L25 assume ~n <= 0;#res := 1; 74773#factFINAL assume true; 74774#factEXIT >#76#return; 75011#L30-3 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; 75010#binomialCoefficient_returnLabel#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; 75009#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 75004#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75002#L43 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; 74990#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74991#$Ultimate##0 ~n := #in~n; 75021#L25 assume !(~n <= 0); 75006#L26 call #t~ret0 := fact(~n - 1);< 75007#$Ultimate##0 ~n := #in~n; 75022#L25 assume ~n <= 0;#res := 1; 75020#factFINAL assume true; 75005#factEXIT >#70#return; 74986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74998#factFINAL assume true; 74989#factEXIT >#78#return; 74847#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74852#$Ultimate##0 ~n := #in~n; 74853#L25 assume ~n <= 0;#res := 1; 74851#factFINAL assume true; 74840#factEXIT >#80#return; 74816#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74831#$Ultimate##0 ~n := #in~n; 74996#L25 assume !(~n <= 0); 74884#L26 call #t~ret0 := fact(~n - 1);< 74988#$Ultimate##0 ~n := #in~n; 74917#L25 assume ~n <= 0;#res := 1; 74992#factFINAL assume true; 74983#factEXIT >#70#return; 74980#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74974#factFINAL assume true; 74967#factEXIT >#82#return; 74968#L30-8 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; 75008#binomialCoefficient_returnLabel#2 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; 75003#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 75001#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 74486#L42-4 havoc main_~k~0#1; 74437#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 74429#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 74431#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75787#L43 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; 75434#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75660#$Ultimate##0 ~n := #in~n; 75736#L25 assume !(~n <= 0); 75556#L26 call #t~ret0 := fact(~n - 1);< 75637#$Ultimate##0 ~n := #in~n; 75617#L25 assume !(~n <= 0); 75553#L26 call #t~ret0 := fact(~n - 1);< 75641#$Ultimate##0 ~n := #in~n; 75617#L25 assume !(~n <= 0); 75553#L26 call #t~ret0 := fact(~n - 1);< 75641#$Ultimate##0 ~n := #in~n; 75650#L25 assume ~n <= 0;#res := 1; 75642#factFINAL assume true; 75638#factEXIT >#70#return; 75636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75587#factFINAL assume true; 75590#factEXIT >#70#return; 75651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75652#factFINAL assume true; 75550#factEXIT >#70#return; 75548#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75549#factFINAL assume true; 75403#factEXIT >#72#return; 75503#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75660#$Ultimate##0 ~n := #in~n; 75736#L25 assume ~n <= 0;#res := 1; 75732#factFINAL assume true; 75716#factEXIT >#74#return; 75407#L30-2 [2024-10-12 00:14:30,235 INFO L747 eck$LassoCheckResult]: Loop: 75407#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75631#$Ultimate##0 ~n := #in~n; 75629#L25 assume !(~n <= 0); 75557#L26 call #t~ret0 := fact(~n - 1);< 75618#$Ultimate##0 ~n := #in~n; 75619#L25 assume !(~n <= 0); 75558#L26 call #t~ret0 := fact(~n - 1);< 75616#$Ultimate##0 ~n := #in~n; 75617#L25 assume !(~n <= 0); 75553#L26 call #t~ret0 := fact(~n - 1);< 75641#$Ultimate##0 ~n := #in~n; 75617#L25 assume !(~n <= 0); 75553#L26 call #t~ret0 := fact(~n - 1);< 75641#$Ultimate##0 ~n := #in~n; 75650#L25 assume ~n <= 0;#res := 1; 75642#factFINAL assume true; 75638#factEXIT >#70#return; 75636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75587#factFINAL assume true; 75590#factEXIT >#70#return; 75651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75652#factFINAL assume true; 75550#factEXIT >#70#return; 75560#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75627#factFINAL assume true; 75628#factEXIT >#70#return; 75671#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75668#factFINAL assume true; 75667#factEXIT >#76#return; 75510#L30-3 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; 75922#binomialCoefficient_returnLabel#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; 75798#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 75771#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75770#L43 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; 75418#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75631#$Ultimate##0 ~n := #in~n; 75629#L25 assume !(~n <= 0); 75557#L26 call #t~ret0 := fact(~n - 1);< 75618#$Ultimate##0 ~n := #in~n; 75619#L25 assume !(~n <= 0); 75558#L26 call #t~ret0 := fact(~n - 1);< 75616#$Ultimate##0 ~n := #in~n; 75617#L25 assume !(~n <= 0); 75553#L26 call #t~ret0 := fact(~n - 1);< 75641#$Ultimate##0 ~n := #in~n; 75650#L25 assume ~n <= 0;#res := 1; 75642#factFINAL assume true; 75638#factEXIT >#70#return; 75636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75587#factFINAL assume true; 75590#factEXIT >#70#return; 75651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75652#factFINAL assume true; 75550#factEXIT >#70#return; 75548#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75549#factFINAL assume true; 75403#factEXIT >#72#return; 75461#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75660#$Ultimate##0 ~n := #in~n; 75736#L25 assume ~n <= 0;#res := 1; 75732#factFINAL assume true; 75716#factEXIT >#74#return; 75407#L30-2 [2024-10-12 00:14:30,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash 66559041, now seen corresponding path program 5 times [2024-10-12 00:14:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:30,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445724330] [2024-10-12 00:14:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 00:14:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 00:14:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 00:14:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 71 proven. 19 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-12 00:14:30,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445724330] [2024-10-12 00:14:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445724330] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724647161] [2024-10-12 00:14:30,369 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:14:30,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:30,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,371 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2024-10-12 00:14:30,511 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-12 00:14:30,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:30,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:14:30,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 136 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-10-12 00:14:30,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 88 proven. 36 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-10-12 00:14:30,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724647161] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:30,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:30,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 18 [2024-10-12 00:14:30,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768480379] [2024-10-12 00:14:30,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:30,817 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1556900246, now seen corresponding path program 3 times [2024-10-12 00:14:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990294509] [2024-10-12 00:14:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:30,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45552557] [2024-10-12 00:14:30,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:30,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:30,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,829 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2024-10-12 00:14:30,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-12 00:14:30,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:14:30,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:30,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:31,394 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:31,394 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:31,394 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:31,394 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:31,394 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:31,394 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,394 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:31,394 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:31,394 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2024-10-12 00:14:31,394 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:31,394 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:31,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,473 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:31,473 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:31,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,475 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2024-10-12 00:14:31,476 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:31,476 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:31,487 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:31,487 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:31,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2024-10-12 00:14:31,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,499 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-10-12 00:14:31,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:31,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:31,511 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:31,511 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: [] [2024-10-12 00:14:31,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-10-12 00:14:31,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,523 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-10-12 00:14:31,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:31,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:31,561 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:31,561 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: [] [2024-10-12 00:14:31,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2024-10-12 00:14:31,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,572 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-10-12 00:14:31,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:31,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:31,585 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:31,585 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: [] [2024-10-12 00:14:31,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:31,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,597 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-10-12 00:14:31,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:31,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:31,609 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:31,610 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=3} Honda state: {ULTIMATE.start_main_~n~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:31,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2024-10-12 00:14:31,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,622 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-10-12 00:14:31,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:31,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:31,639 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:31,639 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: [] [2024-10-12 00:14:31,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2024-10-12 00:14:31,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,651 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-10-12 00:14:31,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:31,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:31,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2024-10-12 00:14:31,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,676 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-10-12 00:14:31,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:31,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:31,887 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:31,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2024-10-12 00:14:31,892 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:31,892 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:31,892 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:31,892 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:31,892 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:31,892 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,892 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:31,892 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:31,893 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2024-10-12 00:14:31,893 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:31,893 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:31,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:31,966 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:31,966 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:31,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,968 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-10-12 00:14:31,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:31,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:31,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:31,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:31,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:31,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:31,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:31,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:31,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:31,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:31,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:31,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:31,993 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:31,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-10-12 00:14:31,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:32,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:32,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:32,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:32,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:32,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:32,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:32,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:32,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:32,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2024-10-12 00:14:32,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,019 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-10-12 00:14:32,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:32,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:32,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:32,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:32,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:32,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:32,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:32,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:32,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:32,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2024-10-12 00:14:32,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,045 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-10-12 00:14:32,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:32,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:32,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:32,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:32,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:32,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:32,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:32,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:32,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:32,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2024-10-12 00:14:32,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,070 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-10-12 00:14:32,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:32,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:32,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:32,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:32,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:32,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:32,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:32,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:32,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:32,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2024-10-12 00:14:32,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,095 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-10-12 00:14:32,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:32,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:32,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:32,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:32,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:32,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:32,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:32,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:32,110 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:32,112 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-12 00:14:32,112 INFO L444 ModelExtractionUtils]: 4 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:32,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:32,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:32,114 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:32,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2024-10-12 00:14:32,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:32,115 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:32,115 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:32,115 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 [] [2024-10-12 00:14:32,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2024-10-12 00:14:32,126 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:32,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:32,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:14:32,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:32,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:14:32,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-12 00:14:32,728 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2024-10-12 00:14:32,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2137 states and 4438 transitions. cyclomatic complexity: 2344 Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 00:14:32,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2137 states and 4438 transitions. cyclomatic complexity: 2344. Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Result 3392 states and 6921 transitions. Complement of second has 26 states. [2024-10-12 00:14:32,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 00:14:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2024-10-12 00:14:32,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 91 letters. Loop has 62 letters. [2024-10-12 00:14:32,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:32,878 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:32,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:32,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:14:32,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:33,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:14:33,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-12 00:14:33,597 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2024-10-12 00:14:33,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2137 states and 4438 transitions. cyclomatic complexity: 2344 Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 00:14:33,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2137 states and 4438 transitions. cyclomatic complexity: 2344. Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Result 3392 states and 6921 transitions. Complement of second has 26 states. [2024-10-12 00:14:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 00:14:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2024-10-12 00:14:33,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 91 letters. Loop has 62 letters. [2024-10-12 00:14:33,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:33,737 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:33,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:33,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:14:33,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:33,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2024-10-12 00:14:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:34,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:14:34,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-12 00:14:34,465 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2024-10-12 00:14:34,465 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2137 states and 4438 transitions. cyclomatic complexity: 2344 Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 00:14:34,696 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2137 states and 4438 transitions. cyclomatic complexity: 2344. Second operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Result 4698 states and 9326 transitions. Complement of second has 55 states. [2024-10-12 00:14:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-12 00:14:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2024-10-12 00:14:34,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 74 transitions. Stem has 91 letters. Loop has 62 letters. [2024-10-12 00:14:34,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:34,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 74 transitions. Stem has 153 letters. Loop has 62 letters. [2024-10-12 00:14:34,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:34,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 74 transitions. Stem has 91 letters. Loop has 124 letters. [2024-10-12 00:14:34,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:34,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4698 states and 9326 transitions. [2024-10-12 00:14:34,783 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 402 [2024-10-12 00:14:34,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4698 states to 2780 states and 5401 transitions. [2024-10-12 00:14:34,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 814 [2024-10-12 00:14:34,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 824 [2024-10-12 00:14:34,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2780 states and 5401 transitions. [2024-10-12 00:14:34,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:34,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2780 states and 5401 transitions. [2024-10-12 00:14:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states and 5401 transitions. [2024-10-12 00:14:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2503. [2024-10-12 00:14:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2503 states, 1425 states have (on average 1.1256140350877193) internal successors, (1604), 1409 states have internal predecessors, (1604), 830 states have call successors, (844), 229 states have call predecessors, (844), 248 states have return successors, (2434), 864 states have call predecessors, (2434), 830 states have call successors, (2434) [2024-10-12 00:14:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 4882 transitions. [2024-10-12 00:14:34,912 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2503 states and 4882 transitions. [2024-10-12 00:14:34,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:34,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 00:14:34,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-12 00:14:34,913 INFO L87 Difference]: Start difference. First operand 2503 states and 4882 transitions. Second operand has 18 states, 15 states have (on average 3.8) internal successors, (57), 17 states have internal predecessors, (57), 11 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) [2024-10-12 00:14:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:35,363 INFO L93 Difference]: Finished difference Result 2820 states and 5510 transitions. [2024-10-12 00:14:35,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2820 states and 5510 transitions. [2024-10-12 00:14:35,391 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 471 [2024-10-12 00:14:35,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2820 states to 2412 states and 4387 transitions. [2024-10-12 00:14:35,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 934 [2024-10-12 00:14:35,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 934 [2024-10-12 00:14:35,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2412 states and 4387 transitions. [2024-10-12 00:14:35,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:35,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2412 states and 4387 transitions. [2024-10-12 00:14:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states and 4387 transitions. [2024-10-12 00:14:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2243. [2024-10-12 00:14:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2243 states, 1293 states have (on average 1.1152358855375097) internal successors, (1442), 1284 states have internal predecessors, (1442), 720 states have call successors, (731), 199 states have call predecessors, (731), 230 states have return successors, (1896), 759 states have call predecessors, (1896), 720 states have call successors, (1896) [2024-10-12 00:14:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 4069 transitions. [2024-10-12 00:14:35,598 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2243 states and 4069 transitions. [2024-10-12 00:14:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 00:14:35,599 INFO L425 stractBuchiCegarLoop]: Abstraction has 2243 states and 4069 transitions. [2024-10-12 00:14:35,599 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-10-12 00:14:35,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2243 states and 4069 transitions. [2024-10-12 00:14:35,612 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 403 [2024-10-12 00:14:35,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:35,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:35,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 12, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:35,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:35,614 INFO L745 eck$LassoCheckResult]: Stem: 95510#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 95449#L-1 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; 95450#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 95475#L38 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; 95511#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 95826#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 95839#L43 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; 95837#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95838#$Ultimate##0 ~n := #in~n; 95845#L25 assume ~n <= 0;#res := 1; 95846#factFINAL assume true; 95836#factEXIT >#72#return; 95501#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95502#$Ultimate##0 ~n := #in~n; 96804#L25 assume ~n <= 0;#res := 1; 96803#factFINAL assume true; 96030#factEXIT >#74#return; 96031#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 96775#$Ultimate##0 ~n := #in~n; 96780#L25 assume ~n <= 0;#res := 1; 96779#factFINAL assume true; 96774#factEXIT >#76#return; 96772#L30-3 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; 95486#binomialCoefficient_returnLabel#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; 95487#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97344#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97345#L43 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; 97381#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97383#$Ultimate##0 ~n := #in~n; 97398#L25 assume !(~n <= 0); 97394#L26 call #t~ret0 := fact(~n - 1);< 97395#$Ultimate##0 ~n := #in~n; 97403#L25 assume ~n <= 0;#res := 1; 97402#factFINAL assume true; 97393#factEXIT >#70#return; 97387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97390#factFINAL assume true; 97376#factEXIT >#78#return; 97368#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97373#$Ultimate##0 ~n := #in~n; 97389#L25 assume ~n <= 0;#res := 1; 97375#factFINAL assume true; 97361#factEXIT >#80#return; 97352#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97359#$Ultimate##0 ~n := #in~n; 97399#L25 assume !(~n <= 0); 97385#L26 call #t~ret0 := fact(~n - 1);< 97388#$Ultimate##0 ~n := #in~n; 97400#L25 assume ~n <= 0;#res := 1; 97392#factFINAL assume true; 97384#factEXIT >#70#return; 97374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97360#factFINAL assume true; 97349#factEXIT >#82#return; 97348#L30-8 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; 97347#binomialCoefficient_returnLabel#2 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; 97346#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 95517#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 95516#L42-4 havoc main_~k~0#1; 95474#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 95467#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 95469#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 95962#L43 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; 95911#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95917#$Ultimate##0 ~n := #in~n; 96009#L25 assume ~n <= 0;#res := 1; 95959#factFINAL assume true; 95909#factEXIT >#72#return; 95914#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 96050#$Ultimate##0 ~n := #in~n; 96052#L25 assume ~n <= 0;#res := 1; 96051#factFINAL assume true; 96049#factEXIT >#74#return; 96046#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 96047#$Ultimate##0 ~n := #in~n; 97254#L25 assume ~n <= 0;#res := 1; 97253#factFINAL assume true; 97252#factEXIT >#76#return; 97251#L30-3 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; 97249#binomialCoefficient_returnLabel#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; 97250#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97260#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97259#L43 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; 96240#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95446#$Ultimate##0 ~n := #in~n; 97246#L25 assume !(~n <= 0); 96237#L26 call #t~ret0 := fact(~n - 1);< 96232#$Ultimate##0 ~n := #in~n; 96285#L25 assume ~n <= 0;#res := 1; 96286#factFINAL assume true; 96252#factEXIT >#70#return; 96257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97282#factFINAL assume true; 97281#factEXIT >#72#return; 96241#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95446#$Ultimate##0 ~n := #in~n; 97246#L25 assume !(~n <= 0); 96237#L26 call #t~ret0 := fact(~n - 1);< 96232#$Ultimate##0 ~n := #in~n; 96285#L25 assume ~n <= 0;#res := 1; 96286#factFINAL assume true; 96252#factEXIT >#70#return; 96257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97282#factFINAL assume true; 97281#factEXIT >#74#return; 95429#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 95437#$Ultimate##0 ~n := #in~n; 95503#L25 assume ~n <= 0;#res := 1; 97280#factFINAL assume true; 97277#factEXIT >#76#return; 97276#L30-3 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; 97275#binomialCoefficient_returnLabel#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; 97268#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97267#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97266#L43 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; 96238#L30 [2024-10-12 00:14:35,614 INFO L747 eck$LassoCheckResult]: Loop: 96238#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95446#$Ultimate##0 ~n := #in~n; 97246#L25 assume !(~n <= 0); 96237#L26 call #t~ret0 := fact(~n - 1);< 96232#$Ultimate##0 ~n := #in~n; 96285#L25 assume ~n <= 0;#res := 1; 96286#factFINAL assume true; 96252#factEXIT >#70#return; 96257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97282#factFINAL assume true; 97281#factEXIT >#72#return; 96239#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95446#$Ultimate##0 ~n := #in~n; 97246#L25 assume !(~n <= 0); 96237#L26 call #t~ret0 := fact(~n - 1);< 96232#$Ultimate##0 ~n := #in~n; 96285#L25 assume ~n <= 0;#res := 1; 96286#factFINAL assume true; 96252#factEXIT >#70#return; 96257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97282#factFINAL assume true; 97281#factEXIT >#74#return; 95428#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 95437#$Ultimate##0 ~n := #in~n; 95503#L25 assume !(~n <= 0); 96186#L26 call #t~ret0 := fact(~n - 1);< 96288#$Ultimate##0 ~n := #in~n; 96285#L25 assume ~n <= 0;#res := 1; 96286#factFINAL assume true; 96252#factEXIT >#70#return; 95482#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95440#factFINAL assume true; 95427#factEXIT >#76#return; 95431#L30-3 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; 95470#binomialCoefficient_returnLabel#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; 95485#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 97307#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97294#L43 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; 96238#L30 [2024-10-12 00:14:35,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:35,615 INFO L85 PathProgramCache]: Analyzing trace with hash 795798191, now seen corresponding path program 6 times [2024-10-12 00:14:35,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:35,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466991811] [2024-10-12 00:14:35,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:35,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 00:14:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 00:14:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 00:14:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 00:14:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 00:14:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 00:14:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 00:14:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 59 proven. 21 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-10-12 00:14:35,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:35,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466991811] [2024-10-12 00:14:35,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466991811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:35,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750411185] [2024-10-12 00:14:35,755 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:14:35,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:35,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:35,757 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:35,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2024-10-12 00:14:35,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-10-12 00:14:35,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:35,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:35,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2024-10-12 00:14:36,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2024-10-12 00:14:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750411185] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:36,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:36,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-10-12 00:14:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691892861] [2024-10-12 00:14:36,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:36,123 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:36,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2027508586, now seen corresponding path program 4 times [2024-10-12 00:14:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481440404] [2024-10-12 00:14:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:36,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 00:14:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 00:14:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 00:14:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 00:14:36,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:36,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481440404] [2024-10-12 00:14:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481440404] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:36,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030744003] [2024-10-12 00:14:36,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:36,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:36,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:36,254 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:36,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2024-10-12 00:14:36,362 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:36,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:36,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:14:36,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 00:14:36,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-12 00:14:36,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030744003] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:36,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:36,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 16 [2024-10-12 00:14:36,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714269772] [2024-10-12 00:14:36,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:36,587 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:36,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:36,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 00:14:36,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-10-12 00:14:36,587 INFO L87 Difference]: Start difference. First operand 2243 states and 4069 transitions. cyclomatic complexity: 1871 Second operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-12 00:14:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:36,778 INFO L93 Difference]: Finished difference Result 2189 states and 3878 transitions. [2024-10-12 00:14:36,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2189 states and 3878 transitions. [2024-10-12 00:14:36,798 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 337 [2024-10-12 00:14:36,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2189 states to 2189 states and 3878 transitions. [2024-10-12 00:14:36,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 737 [2024-10-12 00:14:36,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 737 [2024-10-12 00:14:36,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2189 states and 3878 transitions. [2024-10-12 00:14:36,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:36,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2189 states and 3878 transitions. [2024-10-12 00:14:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states and 3878 transitions. [2024-10-12 00:14:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2116. [2024-10-12 00:14:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1230 states have (on average 1.113821138211382) internal successors, (1370), 1220 states have internal predecessors, (1370), 657 states have call successors, (667), 199 states have call predecessors, (667), 229 states have return successors, (1749), 696 states have call predecessors, (1749), 657 states have call successors, (1749) [2024-10-12 00:14:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3786 transitions. [2024-10-12 00:14:36,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2116 states and 3786 transitions. [2024-10-12 00:14:36,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 00:14:36,885 INFO L425 stractBuchiCegarLoop]: Abstraction has 2116 states and 3786 transitions. [2024-10-12 00:14:36,886 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-10-12 00:14:36,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2116 states and 3786 transitions. [2024-10-12 00:14:36,896 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 313 [2024-10-12 00:14:36,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:36,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:36,900 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 12, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:36,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:36,901 INFO L745 eck$LassoCheckResult]: Stem: 101030#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 100967#L-1 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; 100968#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 100993#L38 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; 101031#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 101348#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 101359#L43 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; 101354#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 101356#$Ultimate##0 ~n := #in~n; 102346#L25 assume ~n <= 0;#res := 1; 102345#factFINAL assume true; 101353#factEXIT >#72#return; 101355#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 101573#$Ultimate##0 ~n := #in~n; 101574#L25 assume ~n <= 0;#res := 1; 101569#factFINAL assume true; 101570#factEXIT >#74#return; 101551#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 101553#$Ultimate##0 ~n := #in~n; 102344#L25 assume ~n <= 0;#res := 1; 102343#factFINAL assume true; 101550#factEXIT >#76#return; 101552#L30-3 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; 101004#binomialCoefficient_returnLabel#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; 101005#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 102727#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102728#L43 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; 102765#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 102767#$Ultimate##0 ~n := #in~n; 102787#L25 assume !(~n <= 0); 102777#L26 call #t~ret0 := fact(~n - 1);< 102778#$Ultimate##0 ~n := #in~n; 102786#L25 assume ~n <= 0;#res := 1; 102785#factFINAL assume true; 102776#factEXIT >#70#return; 102771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102774#factFINAL assume true; 102760#factEXIT >#78#return; 102747#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 102757#$Ultimate##0 ~n := #in~n; 102773#L25 assume ~n <= 0;#res := 1; 102759#factFINAL assume true; 102745#factEXIT >#80#return; 102738#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 102743#$Ultimate##0 ~n := #in~n; 102784#L25 assume !(~n <= 0); 102770#L26 call #t~ret0 := fact(~n - 1);< 102772#$Ultimate##0 ~n := #in~n; 102782#L25 assume ~n <= 0;#res := 1; 102779#factFINAL assume true; 102768#factEXIT >#70#return; 102758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 102744#factFINAL assume true; 102733#factEXIT >#82#return; 102732#L30-8 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; 102731#binomialCoefficient_returnLabel#2 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; 102730#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 101042#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 101037#L42-4 havoc main_~k~0#1; 100992#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 100984#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 100985#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 101466#L43 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; 101425#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 101431#$Ultimate##0 ~n := #in~n; 101509#L25 assume ~n <= 0;#res := 1; 101464#factFINAL assume true; 101423#factEXIT >#72#return; 101428#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 101541#$Ultimate##0 ~n := #in~n; 101545#L25 assume ~n <= 0;#res := 1; 101543#factFINAL assume true; 101540#factEXIT >#74#return; 101396#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 101537#$Ultimate##0 ~n := #in~n; 102023#L25 assume ~n <= 0;#res := 1; 102031#factFINAL assume true; 102030#factEXIT >#76#return; 102029#L30-3 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; 102028#binomialCoefficient_returnLabel#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; 102027#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 102026#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102025#L43 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; 101916#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100950#$Ultimate##0 ~n := #in~n; 101920#L25 assume !(~n <= 0); 101707#L26 call #t~ret0 := fact(~n - 1);< 101724#$Ultimate##0 ~n := #in~n; 101720#L25 assume ~n <= 0;#res := 1; 101721#factFINAL assume true; 101702#factEXIT >#70#return; 101713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101919#factFINAL assume true; 101915#factEXIT >#72#return; 101917#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100950#$Ultimate##0 ~n := #in~n; 101920#L25 assume !(~n <= 0); 101707#L26 call #t~ret0 := fact(~n - 1);< 101724#$Ultimate##0 ~n := #in~n; 101720#L25 assume ~n <= 0;#res := 1; 101721#factFINAL assume true; 101702#factEXIT >#70#return; 101713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101919#factFINAL assume true; 101915#factEXIT >#74#return; 101918#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100946#$Ultimate##0 ~n := #in~n; 102063#L25 assume ~n <= 0;#res := 1; 102062#factFINAL assume true; 102060#factEXIT >#76#return; 102059#L30-3 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; 102057#binomialCoefficient_returnLabel#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; 102055#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 102053#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102050#L43 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; 100949#L30 [2024-10-12 00:14:36,901 INFO L747 eck$LassoCheckResult]: Loop: 100949#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100950#$Ultimate##0 ~n := #in~n; 101920#L25 assume !(~n <= 0); 101707#L26 call #t~ret0 := fact(~n - 1);< 101724#$Ultimate##0 ~n := #in~n; 101720#L25 assume ~n <= 0;#res := 1; 101721#factFINAL assume true; 101702#factEXIT >#70#return; 101713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101919#factFINAL assume true; 101915#factEXIT >#72#return; 101021#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100950#$Ultimate##0 ~n := #in~n; 101920#L25 assume !(~n <= 0); 101707#L26 call #t~ret0 := fact(~n - 1);< 101724#$Ultimate##0 ~n := #in~n; 101720#L25 assume ~n <= 0;#res := 1; 101721#factFINAL assume true; 101702#factEXIT >#70#return; 101713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101919#factFINAL assume true; 101915#factEXIT >#74#return; 100945#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100946#$Ultimate##0 ~n := #in~n; 102063#L25 assume ~n <= 0;#res := 1; 102062#factFINAL assume true; 102060#factEXIT >#76#return; 102061#L30-3 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; 102077#binomialCoefficient_returnLabel#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; 102076#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 102074#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 102051#L43 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; 100949#L30 [2024-10-12 00:14:36,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:36,901 INFO L85 PathProgramCache]: Analyzing trace with hash 795798191, now seen corresponding path program 7 times [2024-10-12 00:14:36,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:36,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740992006] [2024-10-12 00:14:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:36,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 00:14:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 00:14:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 00:14:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:37,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 00:14:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:37,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 00:14:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:37,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:37,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 00:14:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:37,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:37,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 00:14:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 59 proven. 21 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-10-12 00:14:37,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740992006] [2024-10-12 00:14:37,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740992006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130490539] [2024-10-12 00:14:37,017 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-12 00:14:37,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:37,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:37,019 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:37,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2024-10-12 00:14:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:37,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:14:37,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 318 proven. 1 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-12 00:14:37,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-10-12 00:14:37,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130490539] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:37,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:37,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-12 00:14:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585481101] [2024-10-12 00:14:37,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:37,354 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:37,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1210289834, now seen corresponding path program 5 times [2024-10-12 00:14:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:37,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034929927] [2024-10-12 00:14:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:14:37,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [16185091] [2024-10-12 00:14:37,367 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:14:37,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:37,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:37,369 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:37,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2024-10-12 00:14:37,475 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-12 00:14:37,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:14:37,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:37,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:37,674 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:37,674 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:37,674 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:37,674 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:37,674 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:37,674 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:37,674 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:37,674 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:37,674 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration26_Loop [2024-10-12 00:14:37,674 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:37,674 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:37,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:37,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:37,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:37,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:37,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:37,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:37,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:37,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:37,739 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:37,740 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:37,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:37,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:37,741 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:37,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-10-12 00:14:37,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:37,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:37,754 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:37,754 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: [] [2024-10-12 00:14:37,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2024-10-12 00:14:37,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:37,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:37,766 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:37,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-10-12 00:14:37,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:37,767 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:37,778 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:37,778 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: [] [2024-10-12 00:14:37,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2024-10-12 00:14:37,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:37,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:37,790 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:37,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-10-12 00:14:37,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:37,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:37,802 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:37,803 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: [] [2024-10-12 00:14:37,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2024-10-12 00:14:37,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:37,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:37,815 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:37,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-10-12 00:14:37,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:37,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:37,827 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:37,827 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: [] [2024-10-12 00:14:37,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2024-10-12 00:14:37,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:37,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:37,839 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:37,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-10-12 00:14:37,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:37,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:37,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2024-10-12 00:14:37,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:37,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:37,863 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:37,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-10-12 00:14:37,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:37,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:37,988 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:37,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:37,993 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:37,993 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:37,993 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:37,993 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:37,993 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:37,993 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:37,993 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:37,993 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:37,993 INFO L132 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration26_Loop [2024-10-12 00:14:37,993 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:37,993 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:37,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:37,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:37,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:38,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:38,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:38,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:38,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:38,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:38,064 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:38,064 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:38,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:38,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:38,066 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:38,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-10-12 00:14:38,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:38,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:38,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:38,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:38,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:38,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:38,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:38,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:38,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:38,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:38,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:38,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:38,092 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:38,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-10-12 00:14:38,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:38,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:38,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:38,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:38,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:38,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:38,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:38,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:38,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:38,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2024-10-12 00:14:38,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:38,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:38,122 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:38,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-10-12 00:14:38,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:38,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:38,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:38,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:38,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:38,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:38,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:38,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:38,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:38,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2024-10-12 00:14:38,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:38,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:38,147 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:38,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-10-12 00:14:38,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:38,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:38,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:38,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:38,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:38,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:38,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:38,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:38,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:38,170 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:38,170 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:38,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:38,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:38,172 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:38,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-10-12 00:14:38,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:38,173 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:38,173 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:38,173 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~k~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2024-10-12 00:14:38,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2024-10-12 00:14:38,184 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:38,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 00:14:38,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:38,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:14:38,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-12 00:14:38,813 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-12 00:14:38,813 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2116 states and 3786 transitions. cyclomatic complexity: 1709 Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 00:14:38,891 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2116 states and 3786 transitions. cyclomatic complexity: 1709. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Result 3116 states and 5531 transitions. Complement of second has 13 states. [2024-10-12 00:14:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 00:14:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2024-10-12 00:14:38,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 115 letters. Loop has 32 letters. [2024-10-12 00:14:38,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:38,893 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:38,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 00:14:39,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:14:39,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-12 00:14:39,604 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-12 00:14:39,605 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2116 states and 3786 transitions. cyclomatic complexity: 1709 Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 00:14:39,695 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2116 states and 3786 transitions. cyclomatic complexity: 1709. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Result 3144 states and 5584 transitions. Complement of second has 17 states. [2024-10-12 00:14:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 00:14:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2024-10-12 00:14:39,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 115 letters. Loop has 32 letters. [2024-10-12 00:14:39,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:39,696 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:39,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 00:14:39,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:39,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:14:40,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-12 00:14:40,395 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-12 00:14:40,395 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2116 states and 3786 transitions. cyclomatic complexity: 1709 Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 00:14:40,541 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2116 states and 3786 transitions. cyclomatic complexity: 1709. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Result 4288 states and 7578 transitions. Complement of second has 18 states. [2024-10-12 00:14:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 00:14:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-10-12 00:14:40,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 65 transitions. Stem has 115 letters. Loop has 32 letters. [2024-10-12 00:14:40,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:40,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 65 transitions. Stem has 147 letters. Loop has 32 letters. [2024-10-12 00:14:40,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:40,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 65 transitions. Stem has 115 letters. Loop has 64 letters. [2024-10-12 00:14:40,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:40,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4288 states and 7578 transitions. [2024-10-12 00:14:40,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 184 [2024-10-12 00:14:40,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4288 states to 1824 states and 3039 transitions. [2024-10-12 00:14:40,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2024-10-12 00:14:40,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2024-10-12 00:14:40,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1824 states and 3039 transitions. [2024-10-12 00:14:40,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:40,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1824 states and 3039 transitions. [2024-10-12 00:14:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states and 3039 transitions. [2024-10-12 00:14:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1620. [2024-10-12 00:14:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 939 states have (on average 1.1182108626198084) internal successors, (1050), 952 states have internal predecessors, (1050), 480 states have call successors, (487), 167 states have call predecessors, (487), 201 states have return successors, (1068), 500 states have call predecessors, (1068), 480 states have call successors, (1068) [2024-10-12 00:14:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2605 transitions. [2024-10-12 00:14:40,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1620 states and 2605 transitions. [2024-10-12 00:14:40,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:40,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 00:14:40,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-12 00:14:40,656 INFO L87 Difference]: Start difference. First operand 1620 states and 2605 transitions. Second operand has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 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) [2024-10-12 00:14:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:40,817 INFO L93 Difference]: Finished difference Result 1222 states and 1905 transitions. [2024-10-12 00:14:40,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1222 states and 1905 transitions. [2024-10-12 00:14:40,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 167 [2024-10-12 00:14:40,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1222 states to 1215 states and 1898 transitions. [2024-10-12 00:14:40,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2024-10-12 00:14:40,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2024-10-12 00:14:40,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1215 states and 1898 transitions. [2024-10-12 00:14:40,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:40,838 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1215 states and 1898 transitions. [2024-10-12 00:14:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states and 1898 transitions. [2024-10-12 00:14:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2024-10-12 00:14:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 715 states have (on average 1.1048951048951048) internal successors, (790), 728 states have internal predecessors, (790), 335 states have call successors, (340), 120 states have call predecessors, (340), 165 states have return successors, (768), 366 states have call predecessors, (768), 335 states have call successors, (768) [2024-10-12 00:14:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1898 transitions. [2024-10-12 00:14:40,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1215 states and 1898 transitions. [2024-10-12 00:14:40,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:14:40,867 INFO L425 stractBuchiCegarLoop]: Abstraction has 1215 states and 1898 transitions. [2024-10-12 00:14:40,867 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-10-12 00:14:40,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1215 states and 1898 transitions. [2024-10-12 00:14:40,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 167 [2024-10-12 00:14:40,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:40,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:40,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [18, 18, 12, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:40,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 12, 12, 12, 12, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:40,873 INFO L745 eck$LassoCheckResult]: Stem: 118706#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 118654#L-1 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; 118655#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 118670#L38 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; 118707#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 118888#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 118886#L43 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; 118882#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 118883#$Ultimate##0 ~n := #in~n; 118887#L25 assume ~n <= 0;#res := 1; 118884#factFINAL assume true; 118881#factEXIT >#72#return; 118877#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 118878#$Ultimate##0 ~n := #in~n; 118885#L25 assume ~n <= 0;#res := 1; 118880#factFINAL assume true; 118876#factEXIT >#74#return; 118873#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 118874#$Ultimate##0 ~n := #in~n; 118879#L25 assume ~n <= 0;#res := 1; 118875#factFINAL assume true; 118872#factEXIT >#76#return; 118871#L30-3 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; 118869#binomialCoefficient_returnLabel#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; 118866#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 118856#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 118852#L43 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; 118853#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 119711#$Ultimate##0 ~n := #in~n; 119709#L25 assume !(~n <= 0); 119705#L26 call #t~ret0 := fact(~n - 1);< 119707#$Ultimate##0 ~n := #in~n; 119710#L25 assume ~n <= 0;#res := 1; 119708#factFINAL assume true; 119704#factEXIT >#70#return; 119706#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119773#factFINAL assume true; 119772#factEXIT >#78#return; 119765#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 119769#$Ultimate##0 ~n := #in~n; 119771#L25 assume ~n <= 0;#res := 1; 119770#factFINAL assume true; 119761#factEXIT >#80#return; 119725#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 119733#$Ultimate##0 ~n := #in~n; 119731#L25 assume !(~n <= 0); 119718#L26 call #t~ret0 := fact(~n - 1);< 119723#$Ultimate##0 ~n := #in~n; 119717#L25 assume ~n <= 0;#res := 1; 119720#factFINAL assume true; 119741#factEXIT >#70#return; 119739#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119738#factFINAL assume true; 119737#factEXIT >#82#return; 118723#L30-8 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; 119212#binomialCoefficient_returnLabel#2 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; 119211#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 119210#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 119209#L42-4 havoc main_~k~0#1; 119206#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 119205#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 118685#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 118686#L43 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; 118642#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 118643#$Ultimate##0 ~n := #in~n; 119230#L25 assume !(~n <= 0); 119200#L26 call #t~ret0 := fact(~n - 1);< 119228#$Ultimate##0 ~n := #in~n; 119231#L25 assume ~n <= 0;#res := 1; 119229#factFINAL assume true; 119227#factEXIT >#70#return; 119226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119224#factFINAL assume true; 119222#factEXIT >#72#return; 119189#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 119192#$Ultimate##0 ~n := #in~n; 119194#L25 assume ~n <= 0;#res := 1; 119193#factFINAL assume true; 119188#factEXIT >#74#return; 119178#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 119183#$Ultimate##0 ~n := #in~n; 119234#L25 assume !(~n <= 0); 119137#L26 call #t~ret0 := fact(~n - 1);< 119259#$Ultimate##0 ~n := #in~n; 119244#L25 assume ~n <= 0;#res := 1; 119245#factFINAL assume true; 119135#factEXIT >#70#return; 119145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119184#factFINAL assume true; 119175#factEXIT >#76#return; 119174#L30-3 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; 119173#binomialCoefficient_returnLabel#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; 119171#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 119172#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 119167#L43 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; 119168#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 119287#$Ultimate##0 ~n := #in~n; 119303#L25 assume !(~n <= 0); 119138#L26 call #t~ret0 := fact(~n - 1);< 119149#$Ultimate##0 ~n := #in~n; 119244#L25 assume ~n <= 0;#res := 1; 119245#factFINAL assume true; 119135#factEXIT >#70#return; 119146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119288#factFINAL assume true; 119285#factEXIT >#72#return; 119129#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 119130#$Ultimate##0 ~n := #in~n; 119150#L25 assume !(~n <= 0); 119140#L26 call #t~ret0 := fact(~n - 1);< 119149#$Ultimate##0 ~n := #in~n; 119244#L25 assume ~n <= 0;#res := 1; 119245#factFINAL assume true; 119135#factEXIT >#70#return; 119134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119131#factFINAL assume true; 119133#factEXIT >#74#return; 119026#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 119032#$Ultimate##0 ~n := #in~n; 119034#L25 assume ~n <= 0;#res := 1; 119033#factFINAL assume true; 119009#factEXIT >#76#return; 119031#L30-3 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; 119297#binomialCoefficient_returnLabel#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; 119005#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 119003#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 119004#L43 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; 118627#L30-5 [2024-10-12 00:14:40,873 INFO L747 eck$LassoCheckResult]: Loop: 118627#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 118628#$Ultimate##0 ~n := #in~n; 118700#L25 assume !(~n <= 0); 118954#L26 call #t~ret0 := fact(~n - 1);< 118974#$Ultimate##0 ~n := #in~n; 118971#L25 assume !(~n <= 0); 118633#L26 call #t~ret0 := fact(~n - 1);< 118956#$Ultimate##0 ~n := #in~n; 118975#L25 assume ~n <= 0;#res := 1; 118972#factFINAL assume true; 118631#factEXIT >#70#return; 118634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 118985#factFINAL assume true; 118983#factEXIT >#70#return; 118982#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 118981#factFINAL assume true; 118980#factEXIT >#78#return; 118960#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 118979#$Ultimate##0 ~n := #in~n; 118978#L25 assume !(~n <= 0); 118690#L26 call #t~ret0 := fact(~n - 1);< 118963#$Ultimate##0 ~n := #in~n; 118688#L25 assume ~n <= 0;#res := 1; 118691#factFINAL assume true; 118988#factEXIT >#70#return; 118989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 118991#factFINAL assume true; 118987#factEXIT >#80#return; 118708#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 118703#$Ultimate##0 ~n := #in~n; 118986#L25 assume !(~n <= 0); 118689#L26 call #t~ret0 := fact(~n - 1);< 118990#$Ultimate##0 ~n := #in~n; 118688#L25 assume ~n <= 0;#res := 1; 118691#factFINAL assume true; 118988#factEXIT >#70#return; 118989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 118991#factFINAL assume true; 118987#factEXIT >#82#return; 118656#L30-8 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; 118657#binomialCoefficient_returnLabel#2 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; 118671#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 118705#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 118711#L42-4 havoc main_~k~0#1; 118669#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 118665#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 118666#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 118673#L43 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; 118674#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 119196#$Ultimate##0 ~n := #in~n; 119213#L25 assume !(~n <= 0); 119202#L26 call #t~ret0 := fact(~n - 1);< 119204#$Ultimate##0 ~n := #in~n; 119214#L25 assume !(~n <= 0); 119201#L26 call #t~ret0 := fact(~n - 1);< 119208#$Ultimate##0 ~n := #in~n; 119221#L25 assume ~n <= 0;#res := 1; 119220#factFINAL assume true; 119219#factEXIT >#70#return; 119218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119217#factFINAL assume true; 119215#factEXIT >#70#return; 119216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119225#factFINAL assume true; 119223#factEXIT >#72#return; 119190#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 119192#$Ultimate##0 ~n := #in~n; 119194#L25 assume ~n <= 0;#res := 1; 119193#factFINAL assume true; 119188#factEXIT >#74#return; 119177#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 119183#$Ultimate##0 ~n := #in~n; 119234#L25 assume !(~n <= 0); 119137#L26 call #t~ret0 := fact(~n - 1);< 119259#$Ultimate##0 ~n := #in~n; 119244#L25 assume ~n <= 0;#res := 1; 119245#factFINAL assume true; 119135#factEXIT >#70#return; 119145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119184#factFINAL assume true; 119175#factEXIT >#76#return; 119181#L30-3 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; 119304#binomialCoefficient_returnLabel#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; 119302#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 119169#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 119170#L43 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; 119163#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 119166#$Ultimate##0 ~n := #in~n; 119442#L25 assume !(~n <= 0); 119155#L26 call #t~ret0 := fact(~n - 1);< 119256#$Ultimate##0 ~n := #in~n; 119261#L25 assume !(~n <= 0); 119156#L26 call #t~ret0 := fact(~n - 1);< 119257#$Ultimate##0 ~n := #in~n; 119261#L25 assume !(~n <= 0); 119156#L26 call #t~ret0 := fact(~n - 1);< 119257#$Ultimate##0 ~n := #in~n; 119268#L25 assume ~n <= 0;#res := 1; 119260#factFINAL assume true; 119253#factEXIT >#70#return; 119255#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119284#factFINAL assume true; 119247#factEXIT >#70#return; 119248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119449#factFINAL assume true; 119280#factEXIT >#70#return; 119282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119243#factFINAL assume true; 119162#factEXIT >#72#return; 119121#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 119270#$Ultimate##0 ~n := #in~n; 119269#L25 assume !(~n <= 0); 119136#L26 call #t~ret0 := fact(~n - 1);< 119259#$Ultimate##0 ~n := #in~n; 119261#L25 assume !(~n <= 0); 119156#L26 call #t~ret0 := fact(~n - 1);< 119257#$Ultimate##0 ~n := #in~n; 119268#L25 assume ~n <= 0;#res := 1; 119260#factFINAL assume true; 119253#factEXIT >#70#return; 119255#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119284#factFINAL assume true; 119247#factEXIT >#70#return; 119249#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 119307#factFINAL assume true; 119308#factEXIT >#74#return; 119014#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 119445#$Ultimate##0 ~n := #in~n; 119465#L25 assume ~n <= 0;#res := 1; 119033#factFINAL assume true; 119009#factEXIT >#76#return; 119008#L30-3 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; 119006#binomialCoefficient_returnLabel#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; 119007#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 119294#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 118949#L43 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; 118627#L30-5 [2024-10-12 00:14:40,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash -799710665, now seen corresponding path program 8 times [2024-10-12 00:14:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510806537] [2024-10-12 00:14:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:40,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 00:14:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 00:14:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 00:14:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 00:14:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 00:14:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 00:14:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 00:14:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-10-12 00:14:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510806537] [2024-10-12 00:14:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510806537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144773815] [2024-10-12 00:14:41,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:41,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:41,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:41,043 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:41,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2024-10-12 00:14:41,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:41,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:41,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:41,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-10-12 00:14:41,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2024-10-12 00:14:41,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144773815] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:41,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:41,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2024-10-12 00:14:41,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596087726] [2024-10-12 00:14:41,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:41,503 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:41,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:41,504 INFO L85 PathProgramCache]: Analyzing trace with hash 733514704, now seen corresponding path program 6 times [2024-10-12 00:14:41,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:41,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401092163] [2024-10-12 00:14:41,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:41,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 00:14:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 00:14:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 00:14:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 00:14:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 00:14:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 00:14:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 00:14:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 00:14:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 140 proven. 147 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2024-10-12 00:14:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401092163] [2024-10-12 00:14:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401092163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081733349] [2024-10-12 00:14:41,805 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:14:41,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:41,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:41,807 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:41,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2024-10-12 00:14:41,961 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2024-10-12 00:14:41,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:41,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:14:41,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 625 proven. 27 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-12 00:14:42,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 139 proven. 155 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2024-10-12 00:14:42,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081733349] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:42,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:42,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 23 [2024-10-12 00:14:42,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527940713] [2024-10-12 00:14:42,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:42,382 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:42,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 00:14:42,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-10-12 00:14:42,383 INFO L87 Difference]: Start difference. First operand 1215 states and 1898 transitions. cyclomatic complexity: 703 Second operand has 21 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-12 00:14:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:42,948 INFO L93 Difference]: Finished difference Result 1649 states and 2800 transitions. [2024-10-12 00:14:42,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1649 states and 2800 transitions. [2024-10-12 00:14:42,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 291 [2024-10-12 00:14:42,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1649 states to 1376 states and 2231 transitions. [2024-10-12 00:14:42,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2024-10-12 00:14:42,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2024-10-12 00:14:42,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1376 states and 2231 transitions. [2024-10-12 00:14:42,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:42,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1376 states and 2231 transitions. [2024-10-12 00:14:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states and 2231 transitions. [2024-10-12 00:14:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1199. [2024-10-12 00:14:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 710 states have (on average 1.0971830985915494) internal successors, (779), 720 states have internal predecessors, (779), 325 states have call successors, (330), 118 states have call predecessors, (330), 164 states have return successors, (754), 360 states have call predecessors, (754), 325 states have call successors, (754) [2024-10-12 00:14:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1863 transitions. [2024-10-12 00:14:43,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1199 states and 1863 transitions. [2024-10-12 00:14:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-12 00:14:43,004 INFO L425 stractBuchiCegarLoop]: Abstraction has 1199 states and 1863 transitions. [2024-10-12 00:14:43,004 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-10-12 00:14:43,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1199 states and 1863 transitions. [2024-10-12 00:14:43,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 161 [2024-10-12 00:14:43,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:43,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:43,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [30, 30, 18, 12, 12, 12, 12, 7, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:43,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [34, 34, 22, 22, 22, 22, 12, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:14:43,010 INFO L745 eck$LassoCheckResult]: Stem: 123522#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 123467#L-1 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; 123468#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 123484#L38 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; 123478#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 123479#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 123689#L43 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; 123687#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 123688#$Ultimate##0 ~n := #in~n; 123697#L25 assume ~n <= 0;#res := 1; 123690#factFINAL assume true; 123686#factEXIT >#72#return; 123684#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 123685#$Ultimate##0 ~n := #in~n; 123696#L25 assume ~n <= 0;#res := 1; 123694#factFINAL assume true; 123683#factEXIT >#74#return; 123658#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 123659#$Ultimate##0 ~n := #in~n; 123682#L25 assume ~n <= 0;#res := 1; 123681#factFINAL assume true; 123657#factEXIT >#76#return; 123651#L30-3 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; 123649#binomialCoefficient_returnLabel#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; 123648#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 123646#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 123640#L43 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; 123638#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 123639#$Ultimate##0 ~n := #in~n; 123695#L25 assume !(~n <= 0); 123692#L26 call #t~ret0 := fact(~n - 1);< 123693#$Ultimate##0 ~n := #in~n; 123699#L25 assume ~n <= 0;#res := 1; 123698#factFINAL assume true; 123691#factEXIT >#70#return; 123644#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123660#factFINAL assume true; 123637#factEXIT >#78#return; 123615#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 123619#$Ultimate##0 ~n := #in~n; 123621#L25 assume ~n <= 0;#res := 1; 123620#factFINAL assume true; 123607#factEXIT >#80#return; 123586#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 123590#$Ultimate##0 ~n := #in~n; 123662#L25 assume !(~n <= 0); 123643#L26 call #t~ret0 := fact(~n - 1);< 123645#$Ultimate##0 ~n := #in~n; 123668#L25 assume ~n <= 0;#res := 1; 123661#factFINAL assume true; 123641#factEXIT >#70#return; 123636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123635#factFINAL assume true; 123634#factEXIT >#82#return; 123633#L30-8 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; 123632#binomialCoefficient_returnLabel#2 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; 123631#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 123630#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 123629#L43 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; 123451#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 124528#$Ultimate##0 ~n := #in~n; 124526#L25 assume !(~n <= 0); 124518#L26 call #t~ret0 := fact(~n - 1);< 124520#$Ultimate##0 ~n := #in~n; 124516#L25 assume ~n <= 0;#res := 1; 124519#factFINAL assume true; 124584#factEXIT >#70#return; 124585#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124633#factFINAL assume true; 123449#factEXIT >#78#return; 123453#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 124541#$Ultimate##0 ~n := #in~n; 124543#L25 assume ~n <= 0;#res := 1; 124542#factFINAL assume true; 124536#factEXIT >#80#return; 124525#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 124529#$Ultimate##0 ~n := #in~n; 124527#L25 assume !(~n <= 0); 124517#L26 call #t~ret0 := fact(~n - 1);< 124520#$Ultimate##0 ~n := #in~n; 124516#L25 assume ~n <= 0;#res := 1; 124519#factFINAL assume true; 124584#factEXIT >#70#return; 124581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124578#factFINAL assume true; 124530#factEXIT >#82#return; 123469#L30-8 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; 123470#binomialCoefficient_returnLabel#2 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; 123485#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 123520#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 123526#L42-4 havoc main_~k~0#1; 123527#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 123530#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 123531#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 123487#L43 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; 123488#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 124089#$Ultimate##0 ~n := #in~n; 124097#L25 assume !(~n <= 0); 124094#L26 call #t~ret0 := fact(~n - 1);< 124095#$Ultimate##0 ~n := #in~n; 124098#L25 assume ~n <= 0;#res := 1; 124096#factFINAL assume true; 124093#factEXIT >#70#return; 124092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124091#factFINAL assume true; 124088#factEXIT >#72#return; 124085#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 124086#$Ultimate##0 ~n := #in~n; 124090#L25 assume ~n <= 0;#res := 1; 124087#factFINAL assume true; 124082#factEXIT >#74#return; 124077#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 124080#$Ultimate##0 ~n := #in~n; 124124#L25 assume !(~n <= 0); 123889#L26 call #t~ret0 := fact(~n - 1);< 123953#$Ultimate##0 ~n := #in~n; 123911#L25 assume ~n <= 0;#res := 1; 123912#factFINAL assume true; 123883#factEXIT >#70#return; 123897#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124298#factFINAL assume true; 124073#factEXIT >#76#return; 124072#L30-3 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; 124071#binomialCoefficient_returnLabel#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; 124069#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 124067#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 124065#L43 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; 124000#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 123987#$Ultimate##0 ~n := #in~n; 124002#L25 assume !(~n <= 0); 123884#L26 call #t~ret0 := fact(~n - 1);< 123915#$Ultimate##0 ~n := #in~n; 123911#L25 assume ~n <= 0;#res := 1; 123912#factFINAL assume true; 123883#factEXIT >#70#return; 123893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124001#factFINAL assume true; 123999#factEXIT >#72#return; 123983#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 123985#$Ultimate##0 ~n := #in~n; 123982#L25 assume !(~n <= 0); 123888#L26 call #t~ret0 := fact(~n - 1);< 123915#$Ultimate##0 ~n := #in~n; 123911#L25 assume ~n <= 0;#res := 1; 123912#factFINAL assume true; 123883#factEXIT >#70#return; 123895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124063#factFINAL assume true; 124044#factEXIT >#74#return; 124030#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 124041#$Ultimate##0 ~n := #in~n; 124060#L25 assume ~n <= 0;#res := 1; 124043#factFINAL assume true; 124028#factEXIT >#76#return; 124026#L30-3 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; 124024#binomialCoefficient_returnLabel#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; 124022#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 124020#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 124018#L43 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; 123837#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 123880#$Ultimate##0 ~n := #in~n; 123951#L25 assume !(~n <= 0); 123898#L26 call #t~ret0 := fact(~n - 1);< 123899#$Ultimate##0 ~n := #in~n; 123947#L25 assume !(~n <= 0); 123902#L26 call #t~ret0 := fact(~n - 1);< 123925#$Ultimate##0 ~n := #in~n; 123952#L25 assume ~n <= 0;#res := 1; 123946#factFINAL assume true; 123922#factEXIT >#70#return; 123924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123981#factFINAL assume true; 123976#factEXIT >#70#return; 123979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123990#factFINAL assume true; 123989#factEXIT >#78#return; 123940#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 123875#$Ultimate##0 ~n := #in~n; 123963#L25 assume !(~n <= 0); 123892#L26 call #t~ret0 := fact(~n - 1);< 123915#$Ultimate##0 ~n := #in~n; 123911#L25 assume ~n <= 0;#res := 1; 123912#factFINAL assume true; 123883#factEXIT >#70#return; 123896#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123973#factFINAL assume true; 123969#factEXIT >#80#return; 123818#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 123964#$Ultimate##0 ~n := #in~n; 123910#L25 assume !(~n <= 0); 123887#L26 call #t~ret0 := fact(~n - 1);< 123953#$Ultimate##0 ~n := #in~n; 123911#L25 assume ~n <= 0;#res := 1; 123912#factFINAL assume true; 123883#factEXIT >#70#return; 123896#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123973#factFINAL assume true; 123969#factEXIT >#82#return; 123971#L30-8 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; 124148#binomialCoefficient_returnLabel#2 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; 124014#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 124010#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 124006#L43 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; 123441#L30-5 [2024-10-12 00:14:43,010 INFO L747 eck$LassoCheckResult]: Loop: 123441#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 123442#$Ultimate##0 ~n := #in~n; 123798#L25 assume !(~n <= 0); 123772#L26 call #t~ret0 := fact(~n - 1);< 123784#$Ultimate##0 ~n := #in~n; 123782#L25 assume !(~n <= 0); 123446#L26 call #t~ret0 := fact(~n - 1);< 123779#$Ultimate##0 ~n := #in~n; 123782#L25 assume !(~n <= 0); 123446#L26 call #t~ret0 := fact(~n - 1);< 123779#$Ultimate##0 ~n := #in~n; 123781#L25 assume ~n <= 0;#res := 1; 123778#factFINAL assume true; 123445#factEXIT >#70#return; 123448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123797#factFINAL assume true; 123795#factEXIT >#70#return; 123796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123799#factFINAL assume true; 123800#factEXIT >#70#return; 123769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123770#factFINAL assume true; 123807#factEXIT >#78#return; 123785#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 123788#$Ultimate##0 ~n := #in~n; 123787#L25 assume !(~n <= 0); 123473#L26 call #t~ret0 := fact(~n - 1);< 123783#$Ultimate##0 ~n := #in~n; 123498#L25 assume ~n <= 0;#res := 1; 123501#factFINAL assume true; 123801#factEXIT >#70#return; 123802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123806#factFINAL assume true; 123805#factEXIT >#80#return; 123536#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 123442#$Ultimate##0 ~n := #in~n; 123798#L25 assume !(~n <= 0); 123772#L26 call #t~ret0 := fact(~n - 1);< 123784#$Ultimate##0 ~n := #in~n; 123782#L25 assume !(~n <= 0); 123446#L26 call #t~ret0 := fact(~n - 1);< 123779#$Ultimate##0 ~n := #in~n; 123781#L25 assume ~n <= 0;#res := 1; 123778#factFINAL assume true; 123445#factEXIT >#70#return; 123448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123797#factFINAL assume true; 123795#factEXIT >#70#return; 123794#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123793#factFINAL assume true; 123792#factEXIT >#82#return; 123540#L30-8 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; 124101#binomialCoefficient_returnLabel#2 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; 124100#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 123505#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 123506#L42-4 havoc main_~k~0#1; 123482#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 123483#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 123528#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 123529#L43 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; 123463#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 123464#$Ultimate##0 ~n := #in~n; 124126#L25 assume !(~n <= 0); 124115#L26 call #t~ret0 := fact(~n - 1);< 124119#$Ultimate##0 ~n := #in~n; 124099#L25 assume !(~n <= 0); 124116#L26 call #t~ret0 := fact(~n - 1);< 124123#$Ultimate##0 ~n := #in~n; 124145#L25 assume ~n <= 0;#res := 1; 124144#factFINAL assume true; 124143#factEXIT >#70#return; 124142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124121#factFINAL assume true; 124122#factEXIT >#70#return; 124110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124111#factFINAL assume true; 124104#factEXIT >#72#return; 124083#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 124086#$Ultimate##0 ~n := #in~n; 124090#L25 assume ~n <= 0;#res := 1; 124087#factFINAL assume true; 124082#factEXIT >#74#return; 124076#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 124080#$Ultimate##0 ~n := #in~n; 124124#L25 assume !(~n <= 0); 123889#L26 call #t~ret0 := fact(~n - 1);< 123953#$Ultimate##0 ~n := #in~n; 123947#L25 assume !(~n <= 0); 123902#L26 call #t~ret0 := fact(~n - 1);< 123925#$Ultimate##0 ~n := #in~n; 123947#L25 assume !(~n <= 0); 123902#L26 call #t~ret0 := fact(~n - 1);< 123925#$Ultimate##0 ~n := #in~n; 123952#L25 assume ~n <= 0;#res := 1; 123946#factFINAL assume true; 123922#factEXIT >#70#return; 123924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123981#factFINAL assume true; 123976#factEXIT >#70#return; 123977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123900#factFINAL assume true; 123907#factEXIT >#70#return; 123921#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124102#factFINAL assume true; 124103#factEXIT >#76#return; 124079#L30-3 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; 124140#binomialCoefficient_returnLabel#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; 124138#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 124134#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 124133#L43 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; 124130#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 124131#$Ultimate##0 ~n := #in~n; 124137#L25 assume !(~n <= 0); 123906#L26 call #t~ret0 := fact(~n - 1);< 123899#$Ultimate##0 ~n := #in~n; 123947#L25 assume !(~n <= 0); 123902#L26 call #t~ret0 := fact(~n - 1);< 123925#$Ultimate##0 ~n := #in~n; 123947#L25 assume !(~n <= 0); 123902#L26 call #t~ret0 := fact(~n - 1);< 123925#$Ultimate##0 ~n := #in~n; 123947#L25 assume !(~n <= 0); 123902#L26 call #t~ret0 := fact(~n - 1);< 123925#$Ultimate##0 ~n := #in~n; 123952#L25 assume ~n <= 0;#res := 1; 123946#factFINAL assume true; 123922#factEXIT >#70#return; 123924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123981#factFINAL assume true; 123976#factEXIT >#70#return; 123977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123900#factFINAL assume true; 123907#factEXIT >#70#return; 123913#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123914#factFINAL assume true; 123916#factEXIT >#70#return; 123919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124132#factFINAL assume true; 124127#factEXIT >#72#return; 124049#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 124059#$Ultimate##0 ~n := #in~n; 124070#L25 assume !(~n <= 0); 123886#L26 call #t~ret0 := fact(~n - 1);< 123953#$Ultimate##0 ~n := #in~n; 123947#L25 assume !(~n <= 0); 123902#L26 call #t~ret0 := fact(~n - 1);< 123925#$Ultimate##0 ~n := #in~n; 123947#L25 assume !(~n <= 0); 123902#L26 call #t~ret0 := fact(~n - 1);< 123925#$Ultimate##0 ~n := #in~n; 123952#L25 assume ~n <= 0;#res := 1; 123946#factFINAL assume true; 123922#factEXIT >#70#return; 123924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123981#factFINAL assume true; 123976#factEXIT >#70#return; 123977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123900#factFINAL assume true; 123907#factEXIT >#70#return; 123918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124068#factFINAL assume true; 124066#factEXIT >#74#return; 123956#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 124042#$Ultimate##0 ~n := #in~n; 124061#L25 assume ~n <= 0;#res := 1; 124043#factFINAL assume true; 124028#factEXIT >#76#return; 124027#L30-3 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; 124025#binomialCoefficient_returnLabel#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; 124023#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 124021#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 124019#L43 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; 123838#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 123880#$Ultimate##0 ~n := #in~n; 123951#L25 assume !(~n <= 0); 123898#L26 call #t~ret0 := fact(~n - 1);< 123899#$Ultimate##0 ~n := #in~n; 123947#L25 assume !(~n <= 0); 123902#L26 call #t~ret0 := fact(~n - 1);< 123925#$Ultimate##0 ~n := #in~n; 123952#L25 assume ~n <= 0;#res := 1; 123946#factFINAL assume true; 123922#factEXIT >#70#return; 123924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123981#factFINAL assume true; 123976#factEXIT >#70#return; 123979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123990#factFINAL assume true; 123989#factEXIT >#78#return; 123878#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 123875#$Ultimate##0 ~n := #in~n; 123963#L25 assume !(~n <= 0); 123892#L26 call #t~ret0 := fact(~n - 1);< 123915#$Ultimate##0 ~n := #in~n; 123911#L25 assume ~n <= 0;#res := 1; 123912#factFINAL assume true; 123883#factEXIT >#70#return; 123896#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123973#factFINAL assume true; 123969#factEXIT >#80#return; 123832#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 123964#$Ultimate##0 ~n := #in~n; 123910#L25 assume !(~n <= 0); 123887#L26 call #t~ret0 := fact(~n - 1);< 123953#$Ultimate##0 ~n := #in~n; 123911#L25 assume ~n <= 0;#res := 1; 123912#factFINAL assume true; 123883#factEXIT >#70#return; 123896#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123973#factFINAL assume true; 123969#factEXIT >#82#return; 123970#L30-8 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; 124167#binomialCoefficient_returnLabel#2 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; 124155#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 124154#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 124152#L43 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; 123441#L30-5 [2024-10-12 00:14:43,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:43,011 INFO L85 PathProgramCache]: Analyzing trace with hash -883117567, now seen corresponding path program 9 times [2024-10-12 00:14:43,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:43,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058086372] [2024-10-12 00:14:43,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:43,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 00:14:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 00:14:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 00:14:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 00:14:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 00:14:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 00:14:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 00:14:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 00:14:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 00:14:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-12 00:14:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-12 00:14:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-12 00:14:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-12 00:14:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1967 backedges. 115 proven. 141 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2024-10-12 00:14:43,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:43,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058086372] [2024-10-12 00:14:43,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058086372] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:43,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741128569] [2024-10-12 00:14:43,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:43,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:43,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:43,209 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:43,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2024-10-12 00:14:43,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-12 00:14:43,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:43,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:14:43,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1967 backedges. 95 proven. 185 refuted. 0 times theorem prover too weak. 1687 trivial. 0 not checked. [2024-10-12 00:14:43,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1967 backedges. 95 proven. 186 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2024-10-12 00:14:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741128569] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:44,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 15] total 30 [2024-10-12 00:14:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415880535] [2024-10-12 00:14:44,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:44,061 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:44,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1537613771, now seen corresponding path program 7 times [2024-10-12 00:14:44,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:44,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43238121] [2024-10-12 00:14:44,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 00:14:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 00:14:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 00:14:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 00:14:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 00:14:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 00:14:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 00:14:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-12 00:14:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-12 00:14:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-12 00:14:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-12 00:14:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-12 00:14:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 231 proven. 74 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-10-12 00:14:44,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43238121] [2024-10-12 00:14:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43238121] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400332606] [2024-10-12 00:14:44,370 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-12 00:14:44,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:44,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:44,372 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:44,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2024-10-12 00:14:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:14:44,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1665 proven. 69 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2024-10-12 00:14:44,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 267 proven. 493 refuted. 0 times theorem prover too weak. 1978 trivial. 0 not checked. [2024-10-12 00:14:45,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400332606] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:45,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:45,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 17] total 26 [2024-10-12 00:14:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448219229] [2024-10-12 00:14:45,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:45,350 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:45,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 00:14:45,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2024-10-12 00:14:45,351 INFO L87 Difference]: Start difference. First operand 1199 states and 1863 transitions. cyclomatic complexity: 684 Second operand has 30 states, 27 states have (on average 4.296296296296297) internal successors, (116), 29 states have internal predecessors, (116), 18 states have call successors, (53), 1 states have call predecessors, (53), 3 states have return successors, (53), 18 states have call predecessors, (53), 18 states have call successors, (53) [2024-10-12 00:14:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:46,618 INFO L93 Difference]: Finished difference Result 1646 states and 2737 transitions. [2024-10-12 00:14:46,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1646 states and 2737 transitions. [2024-10-12 00:14:46,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 295 [2024-10-12 00:14:46,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1646 states to 1391 states and 2257 transitions. [2024-10-12 00:14:46,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2024-10-12 00:14:46,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2024-10-12 00:14:46,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1391 states and 2257 transitions. [2024-10-12 00:14:46,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:46,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1391 states and 2257 transitions. [2024-10-12 00:14:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states and 2257 transitions. [2024-10-12 00:14:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1129. [2024-10-12 00:14:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 677 states have (on average 1.085672082717873) internal successors, (735), 683 states have internal predecessors, (735), 292 states have call successors, (295), 120 states have call predecessors, (295), 160 states have return successors, (674), 325 states have call predecessors, (674), 292 states have call successors, (674) [2024-10-12 00:14:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1704 transitions. [2024-10-12 00:14:46,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1129 states and 1704 transitions. [2024-10-12 00:14:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-12 00:14:46,672 INFO L425 stractBuchiCegarLoop]: Abstraction has 1129 states and 1704 transitions. [2024-10-12 00:14:46,673 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-10-12 00:14:46,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1129 states and 1704 transitions. [2024-10-12 00:14:46,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 161 [2024-10-12 00:14:46,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:46,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:46,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 48, 24, 24, 24, 24, 24, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:46,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [33, 33, 21, 21, 21, 21, 12, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:14:46,678 INFO L745 eck$LassoCheckResult]: Stem: 129598#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 129540#L-1 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; 129541#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 129557#L38 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; 129551#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 129552#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 129771#L43 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; 129767#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129768#$Ultimate##0 ~n := #in~n; 129772#L25 assume ~n <= 0;#res := 1; 129770#factFINAL assume true; 129766#factEXIT >#72#return; 129762#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129763#$Ultimate##0 ~n := #in~n; 129769#L25 assume ~n <= 0;#res := 1; 129765#factFINAL assume true; 129761#factEXIT >#74#return; 129758#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129759#$Ultimate##0 ~n := #in~n; 129764#L25 assume ~n <= 0;#res := 1; 129760#factFINAL assume true; 129757#factEXIT >#76#return; 129756#L30-3 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; 129755#binomialCoefficient_returnLabel#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; 129754#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 129753#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 129752#L43 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; 129725#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129726#$Ultimate##0 ~n := #in~n; 129735#L25 assume !(~n <= 0); 129732#L26 call #t~ret0 := fact(~n - 1);< 129733#$Ultimate##0 ~n := #in~n; 129742#L25 assume ~n <= 0;#res := 1; 129741#factFINAL assume true; 129731#factEXIT >#70#return; 129729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129728#factFINAL assume true; 129724#factEXIT >#78#return; 129675#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129680#$Ultimate##0 ~n := #in~n; 129696#L25 assume ~n <= 0;#res := 1; 129684#factFINAL assume true; 129671#factEXIT >#80#return; 129666#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129668#$Ultimate##0 ~n := #in~n; 129737#L25 assume !(~n <= 0); 129703#L26 call #t~ret0 := fact(~n - 1);< 129708#$Ultimate##0 ~n := #in~n; 129739#L25 assume ~n <= 0;#res := 1; 129738#factFINAL assume true; 129736#factEXIT >#70#return; 129734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129730#factFINAL assume true; 129721#factEXIT >#82#return; 129720#L30-8 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; 129709#binomialCoefficient_returnLabel#2 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; 129695#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 129693#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 129691#L43 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; 129686#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129689#$Ultimate##0 ~n := #in~n; 129718#L25 assume !(~n <= 0); 129702#L26 call #t~ret0 := fact(~n - 1);< 129708#$Ultimate##0 ~n := #in~n; 129740#L25 assume !(~n <= 0); 129704#L26 call #t~ret0 := fact(~n - 1);< 129745#$Ultimate##0 ~n := #in~n; 129748#L25 assume ~n <= 0;#res := 1; 129746#factFINAL assume true; 129744#factEXIT >#70#return; 129743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129712#factFINAL assume true; 129701#factEXIT >#70#return; 129699#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129697#factFINAL assume true; 129685#factEXIT >#78#return; 129677#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129680#$Ultimate##0 ~n := #in~n; 129696#L25 assume ~n <= 0;#res := 1; 129684#factFINAL assume true; 129671#factEXIT >#80#return; 129665#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129668#$Ultimate##0 ~n := #in~n; 129737#L25 assume !(~n <= 0); 129703#L26 call #t~ret0 := fact(~n - 1);< 129708#$Ultimate##0 ~n := #in~n; 129740#L25 assume !(~n <= 0); 129704#L26 call #t~ret0 := fact(~n - 1);< 129745#$Ultimate##0 ~n := #in~n; 129748#L25 assume ~n <= 0;#res := 1; 129746#factFINAL assume true; 129744#factEXIT >#70#return; 129743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129712#factFINAL assume true; 129701#factEXIT >#70#return; 129706#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129818#factFINAL assume true; 129662#factEXIT >#82#return; 129658#L30-8 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; 129655#binomialCoefficient_returnLabel#2 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; 129652#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 129648#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 129650#L43 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; 129773#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130568#$Ultimate##0 ~n := #in~n; 130565#L25 assume !(~n <= 0); 129572#L26 call #t~ret0 := fact(~n - 1);< 129550#$Ultimate##0 ~n := #in~n; 130562#L25 assume !(~n <= 0); 129573#L26 call #t~ret0 := fact(~n - 1);< 130559#$Ultimate##0 ~n := #in~n; 130563#L25 assume ~n <= 0;#res := 1; 130561#factFINAL assume true; 130557#factEXIT >#70#return; 130558#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130560#factFINAL assume true; 130553#factEXIT >#70#return; 130554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130581#factFINAL assume true; 130580#factEXIT >#78#return; 130575#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130577#$Ultimate##0 ~n := #in~n; 130579#L25 assume ~n <= 0;#res := 1; 130578#factFINAL assume true; 130572#factEXIT >#80#return; 129569#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130569#$Ultimate##0 ~n := #in~n; 130566#L25 assume !(~n <= 0); 129574#L26 call #t~ret0 := fact(~n - 1);< 129550#$Ultimate##0 ~n := #in~n; 130562#L25 assume !(~n <= 0); 129573#L26 call #t~ret0 := fact(~n - 1);< 130559#$Ultimate##0 ~n := #in~n; 130562#L25 assume !(~n <= 0); 129573#L26 call #t~ret0 := fact(~n - 1);< 130559#$Ultimate##0 ~n := #in~n; 130563#L25 assume ~n <= 0;#res := 1; 130561#factFINAL assume true; 130557#factEXIT >#70#return; 130558#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130560#factFINAL assume true; 130553#factEXIT >#70#return; 130555#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130624#factFINAL assume true; 130622#factEXIT >#70#return; 130623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130640#factFINAL assume true; 130631#factEXIT >#82#return; 129621#L30-8 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; 130105#binomialCoefficient_returnLabel#2 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; 130104#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 130103#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 130101#L42-4 havoc main_~k~0#1; 129555#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 129556#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 129605#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 129560#L43 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; 129561#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130090#$Ultimate##0 ~n := #in~n; 130100#L25 assume !(~n <= 0); 130095#L26 call #t~ret0 := fact(~n - 1);< 130096#$Ultimate##0 ~n := #in~n; 130099#L25 assume ~n <= 0;#res := 1; 130098#factFINAL assume true; 130094#factEXIT >#70#return; 130093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130092#factFINAL assume true; 130089#factEXIT >#72#return; 130084#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130087#$Ultimate##0 ~n := #in~n; 130091#L25 assume ~n <= 0;#res := 1; 130088#factFINAL assume true; 130083#factEXIT >#74#return; 130058#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130082#$Ultimate##0 ~n := #in~n; 130055#L25 assume !(~n <= 0); 129970#L26 call #t~ret0 := fact(~n - 1);< 130012#$Ultimate##0 ~n := #in~n; 129984#L25 assume ~n <= 0;#res := 1; 129978#factFINAL assume true; 129963#factEXIT >#70#return; 129976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130127#factFINAL assume true; 130079#factEXIT >#76#return; 130077#L30-3 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; 130076#binomialCoefficient_returnLabel#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; 130075#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 130073#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130071#L43 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; 130068#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130069#$Ultimate##0 ~n := #in~n; 130078#L25 assume !(~n <= 0); 129967#L26 call #t~ret0 := fact(~n - 1);< 129977#$Ultimate##0 ~n := #in~n; 129984#L25 assume ~n <= 0;#res := 1; 129978#factFINAL assume true; 129963#factEXIT >#70#return; 129974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130074#factFINAL assume true; 130072#factEXIT >#72#return; 130060#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130070#$Ultimate##0 ~n := #in~n; 130059#L25 assume !(~n <= 0); 129965#L26 call #t~ret0 := fact(~n - 1);< 129977#$Ultimate##0 ~n := #in~n; 129984#L25 assume ~n <= 0;#res := 1; 129978#factFINAL assume true; 129963#factEXIT >#70#return; 129973#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130186#factFINAL assume true; 130185#factEXIT >#74#return; 130135#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130140#$Ultimate##0 ~n := #in~n; 130142#L25 assume ~n <= 0;#res := 1; 130141#factFINAL assume true; 130129#factEXIT >#76#return; 130139#L30-3 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; 130176#binomialCoefficient_returnLabel#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; 130175#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 130174#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130173#L43 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; 129946#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129937#$Ultimate##0 ~n := #in~n; 130015#L25 assume !(~n <= 0); 129994#L26 call #t~ret0 := fact(~n - 1);< 130002#$Ultimate##0 ~n := #in~n; 130022#L25 assume !(~n <= 0); 129993#L26 call #t~ret0 := fact(~n - 1);< 130021#$Ultimate##0 ~n := #in~n; 130036#L25 assume ~n <= 0;#res := 1; 130031#factFINAL assume true; 130018#factEXIT >#70#return; 130017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130005#factFINAL assume true; 129991#factEXIT >#70#return; 129990#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129989#factFINAL assume true; 129988#factEXIT >#78#return; 129912#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129954#$Ultimate##0 ~n := #in~n; 130004#L25 assume !(~n <= 0); 129971#L26 call #t~ret0 := fact(~n - 1);< 129977#$Ultimate##0 ~n := #in~n; 129984#L25 assume ~n <= 0;#res := 1; 129978#factFINAL assume true; 129963#factEXIT >#70#return; 129962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129960#factFINAL assume true; 129891#factEXIT >#80#return; 129911#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129961#$Ultimate##0 ~n := #in~n; 130172#L25 assume !(~n <= 0); 129964#L26 call #t~ret0 := fact(~n - 1);< 130012#$Ultimate##0 ~n := #in~n; 129984#L25 assume ~n <= 0;#res := 1; 129978#factFINAL assume true; 129963#factEXIT >#70#return; 129962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129960#factFINAL assume true; 129891#factEXIT >#82#return; 129934#L30-8 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; 130488#binomialCoefficient_returnLabel#2 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; 130487#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 130486#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130485#L43 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; 129616#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129515#$Ultimate##0 ~n := #in~n; 129870#L25 assume !(~n <= 0); 129850#L26 call #t~ret0 := fact(~n - 1);< 129858#$Ultimate##0 ~n := #in~n; 129857#L25 assume !(~n <= 0); 129519#L26 call #t~ret0 := fact(~n - 1);< 129854#$Ultimate##0 ~n := #in~n; 129856#L25 assume ~n <= 0;#res := 1; 129853#factFINAL assume true; 129518#factEXIT >#70#return; 129521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129869#factFINAL assume true; 129867#factEXIT >#70#return; 129866#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129865#factFINAL assume true; 129864#factEXIT >#78#return; 129842#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129863#$Ultimate##0 ~n := #in~n; 129862#L25 assume !(~n <= 0); 129579#L26 call #t~ret0 := fact(~n - 1);< 129590#$Ultimate##0 ~n := #in~n; 129577#L25 assume ~n <= 0;#res := 1; 129580#factFINAL assume true; 129880#factEXIT >#70#return; 129881#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129836#factFINAL assume true; 129846#factEXIT >#80#return; 129599#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129594#$Ultimate##0 ~n := #in~n; 129872#L25 assume !(~n <= 0); 129578#L26 call #t~ret0 := fact(~n - 1);< 129861#$Ultimate##0 ~n := #in~n; 129857#L25 assume !(~n <= 0); 129519#L26 call #t~ret0 := fact(~n - 1);< 129854#$Ultimate##0 ~n := #in~n; 129856#L25 assume ~n <= 0;#res := 1; 129853#factFINAL assume true; 129518#factEXIT >#70#return; 129521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129869#factFINAL assume true; 129867#factEXIT >#70#return; 129866#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129865#factFINAL assume true; 129864#factEXIT >#82#return; 129542#L30-8 [2024-10-12 00:14:46,679 INFO L747 eck$LassoCheckResult]: Loop: 129542#L30-8 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; 129543#binomialCoefficient_returnLabel#2 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; 129558#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 129584#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 129585#L42-4 havoc main_~k~0#1; 129602#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 130097#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 129603#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 129604#L43 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; 129536#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129537#$Ultimate##0 ~n := #in~n; 130117#L25 assume !(~n <= 0); 130113#L26 call #t~ret0 := fact(~n - 1);< 130116#$Ultimate##0 ~n := #in~n; 130102#L25 assume !(~n <= 0); 130112#L26 call #t~ret0 := fact(~n - 1);< 130120#$Ultimate##0 ~n := #in~n; 130125#L25 assume ~n <= 0;#res := 1; 130124#factFINAL assume true; 130122#factEXIT >#70#return; 130123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130118#factFINAL assume true; 130119#factEXIT >#70#return; 130109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130110#factFINAL assume true; 130106#factEXIT >#72#return; 130085#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130087#$Ultimate##0 ~n := #in~n; 130091#L25 assume ~n <= 0;#res := 1; 130088#factFINAL assume true; 130083#factEXIT >#74#return; 130056#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130082#$Ultimate##0 ~n := #in~n; 130055#L25 assume !(~n <= 0); 129970#L26 call #t~ret0 := fact(~n - 1);< 130012#$Ultimate##0 ~n := #in~n; 130022#L25 assume !(~n <= 0); 129993#L26 call #t~ret0 := fact(~n - 1);< 130021#$Ultimate##0 ~n := #in~n; 130022#L25 assume !(~n <= 0); 129993#L26 call #t~ret0 := fact(~n - 1);< 130021#$Ultimate##0 ~n := #in~n; 130036#L25 assume ~n <= 0;#res := 1; 130031#factFINAL assume true; 130018#factEXIT >#70#return; 130017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130005#factFINAL assume true; 129991#factEXIT >#70#return; 129999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130033#factFINAL assume true; 130023#factEXIT >#70#return; 130027#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130299#factFINAL assume true; 130298#factEXIT >#76#return; 130080#L30-3 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; 130183#binomialCoefficient_returnLabel#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; 130182#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 130181#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130180#L43 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; 130041#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130043#$Ultimate##0 ~n := #in~n; 130039#L25 assume !(~n <= 0); 129996#L26 call #t~ret0 := fact(~n - 1);< 130002#$Ultimate##0 ~n := #in~n; 130022#L25 assume !(~n <= 0); 129993#L26 call #t~ret0 := fact(~n - 1);< 130021#$Ultimate##0 ~n := #in~n; 130036#L25 assume ~n <= 0;#res := 1; 130031#factFINAL assume true; 130018#factEXIT >#70#return; 130017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130005#factFINAL assume true; 129991#factEXIT >#70#return; 130000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130189#factFINAL assume true; 130184#factEXIT >#72#return; 130147#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130159#$Ultimate##0 ~n := #in~n; 130167#L25 assume !(~n <= 0); 129966#L26 call #t~ret0 := fact(~n - 1);< 130012#$Ultimate##0 ~n := #in~n; 130022#L25 assume !(~n <= 0); 129993#L26 call #t~ret0 := fact(~n - 1);< 130021#$Ultimate##0 ~n := #in~n; 130022#L25 assume !(~n <= 0); 129993#L26 call #t~ret0 := fact(~n - 1);< 130021#$Ultimate##0 ~n := #in~n; 130036#L25 assume ~n <= 0;#res := 1; 130031#factFINAL assume true; 130018#factEXIT >#70#return; 130017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130005#factFINAL assume true; 129991#factEXIT >#70#return; 129999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130033#factFINAL assume true; 130023#factEXIT >#70#return; 130026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130160#factFINAL assume true; 130161#factEXIT >#74#return; 130130#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130140#$Ultimate##0 ~n := #in~n; 130142#L25 assume ~n <= 0;#res := 1; 130141#factFINAL assume true; 130129#factEXIT >#76#return; 130136#L30-3 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; 130194#binomialCoefficient_returnLabel#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; 130193#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 130192#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130191#L43 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; 129950#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129937#$Ultimate##0 ~n := #in~n; 130015#L25 assume !(~n <= 0); 129994#L26 call #t~ret0 := fact(~n - 1);< 130002#$Ultimate##0 ~n := #in~n; 130022#L25 assume !(~n <= 0); 129993#L26 call #t~ret0 := fact(~n - 1);< 130021#$Ultimate##0 ~n := #in~n; 130036#L25 assume ~n <= 0;#res := 1; 130031#factFINAL assume true; 130018#factEXIT >#70#return; 130017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130005#factFINAL assume true; 129991#factEXIT >#70#return; 129990#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129989#factFINAL assume true; 129988#factEXIT >#78#return; 129906#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129954#$Ultimate##0 ~n := #in~n; 130004#L25 assume !(~n <= 0); 129971#L26 call #t~ret0 := fact(~n - 1);< 129977#$Ultimate##0 ~n := #in~n; 129984#L25 assume ~n <= 0;#res := 1; 129978#factFINAL assume true; 129963#factEXIT >#70#return; 129962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129960#factFINAL assume true; 129891#factEXIT >#80#return; 129901#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129961#$Ultimate##0 ~n := #in~n; 130172#L25 assume !(~n <= 0); 129964#L26 call #t~ret0 := fact(~n - 1);< 130012#$Ultimate##0 ~n := #in~n; 129984#L25 assume ~n <= 0;#res := 1; 129978#factFINAL assume true; 129963#factEXIT >#70#return; 129962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129960#factFINAL assume true; 129891#factEXIT >#82#return; 129930#L30-8 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; 129944#binomialCoefficient_returnLabel#2 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; 129942#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 129943#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 129877#L43 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; 129615#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129515#$Ultimate##0 ~n := #in~n; 129870#L25 assume !(~n <= 0); 129850#L26 call #t~ret0 := fact(~n - 1);< 129858#$Ultimate##0 ~n := #in~n; 129857#L25 assume !(~n <= 0); 129519#L26 call #t~ret0 := fact(~n - 1);< 129854#$Ultimate##0 ~n := #in~n; 129857#L25 assume !(~n <= 0); 129519#L26 call #t~ret0 := fact(~n - 1);< 129854#$Ultimate##0 ~n := #in~n; 129857#L25 assume !(~n <= 0); 129519#L26 call #t~ret0 := fact(~n - 1);< 129854#$Ultimate##0 ~n := #in~n; 129856#L25 assume ~n <= 0;#res := 1; 129853#factFINAL assume true; 129518#factEXIT >#70#return; 129521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129869#factFINAL assume true; 129867#factEXIT >#70#return; 129868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129876#factFINAL assume true; 129875#factEXIT >#70#return; 129851#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129882#factFINAL assume true; 129849#factEXIT >#70#return; 129847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129848#factFINAL assume true; 129606#factEXIT >#78#return; 129610#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129594#$Ultimate##0 ~n := #in~n; 129872#L25 assume !(~n <= 0); 129578#L26 call #t~ret0 := fact(~n - 1);< 129861#$Ultimate##0 ~n := #in~n; 129577#L25 assume ~n <= 0;#res := 1; 129580#factFINAL assume true; 129880#factEXIT >#70#return; 129881#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129836#factFINAL assume true; 129846#factEXIT >#80#return; 129607#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129515#$Ultimate##0 ~n := #in~n; 129870#L25 assume !(~n <= 0); 129850#L26 call #t~ret0 := fact(~n - 1);< 129858#$Ultimate##0 ~n := #in~n; 129857#L25 assume !(~n <= 0); 129519#L26 call #t~ret0 := fact(~n - 1);< 129854#$Ultimate##0 ~n := #in~n; 129856#L25 assume ~n <= 0;#res := 1; 129853#factFINAL assume true; 129518#factEXIT >#70#return; 129521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129869#factFINAL assume true; 129867#factEXIT >#70#return; 129866#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129865#factFINAL assume true; 129864#factEXIT >#82#return; 129542#L30-8 [2024-10-12 00:14:46,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2072353291, now seen corresponding path program 10 times [2024-10-12 00:14:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:46,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361173765] [2024-10-12 00:14:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:46,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 00:14:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 00:14:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 00:14:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 00:14:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 00:14:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 00:14:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 00:14:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 00:14:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 00:14:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-12 00:14:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-12 00:14:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-12 00:14:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-12 00:14:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-12 00:14:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-12 00:14:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-12 00:14:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-12 00:14:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-12 00:14:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-10-12 00:14:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5207 backedges. 264 proven. 343 refuted. 0 times theorem prover too weak. 4600 trivial. 0 not checked. [2024-10-12 00:14:47,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:47,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361173765] [2024-10-12 00:14:47,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361173765] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:47,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358483492] [2024-10-12 00:14:47,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:47,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:47,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:47,018 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:47,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2024-10-12 00:14:47,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:47,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:47,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:14:47,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5207 backedges. 2680 proven. 9 refuted. 0 times theorem prover too weak. 2518 trivial. 0 not checked. [2024-10-12 00:14:47,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5207 backedges. 264 proven. 347 refuted. 0 times theorem prover too weak. 4596 trivial. 0 not checked. [2024-10-12 00:14:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358483492] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:47,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:47,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 17 [2024-10-12 00:14:47,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700671533] [2024-10-12 00:14:47,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:47,770 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:47,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:47,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2004219443, now seen corresponding path program 8 times [2024-10-12 00:14:47,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:47,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49311747] [2024-10-12 00:14:47,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:47,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 00:14:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:47,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 00:14:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 00:14:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 00:14:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 00:14:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 00:14:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-12 00:14:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 00:14:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-12 00:14:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-12 00:14:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2564 backedges. 68 proven. 312 refuted. 0 times theorem prover too weak. 2184 trivial. 0 not checked. [2024-10-12 00:14:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:48,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49311747] [2024-10-12 00:14:48,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49311747] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:48,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604215661] [2024-10-12 00:14:48,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:48,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:48,068 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:48,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2024-10-12 00:14:48,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:48,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:48,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:14:48,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2564 backedges. 1002 proven. 69 refuted. 0 times theorem prover too weak. 1493 trivial. 0 not checked. [2024-10-12 00:14:48,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2564 backedges. 42 proven. 687 refuted. 0 times theorem prover too weak. 1835 trivial. 0 not checked. [2024-10-12 00:14:48,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604215661] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:48,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:48,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 17] total 28 [2024-10-12 00:14:48,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490446575] [2024-10-12 00:14:48,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:48,901 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:48,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 00:14:48,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2024-10-12 00:14:48,902 INFO L87 Difference]: Start difference. First operand 1129 states and 1704 transitions. cyclomatic complexity: 593 Second operand has 28 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 25 states have internal predecessors, (70), 17 states have call successors, (34), 2 states have call predecessors, (34), 8 states have return successors, (37), 13 states have call predecessors, (37), 17 states have call successors, (37) [2024-10-12 00:14:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:50,118 INFO L93 Difference]: Finished difference Result 1338 states and 1987 transitions. [2024-10-12 00:14:50,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1338 states and 1987 transitions. [2024-10-12 00:14:50,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 257 [2024-10-12 00:14:50,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1338 states to 1318 states and 1963 transitions. [2024-10-12 00:14:50,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2024-10-12 00:14:50,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2024-10-12 00:14:50,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1318 states and 1963 transitions. [2024-10-12 00:14:50,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:50,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1318 states and 1963 transitions. [2024-10-12 00:14:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states and 1963 transitions. [2024-10-12 00:14:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1176. [2024-10-12 00:14:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 706 states have (on average 1.0835694050991502) internal successors, (765), 709 states have internal predecessors, (765), 307 states have call successors, (311), 127 states have call predecessors, (311), 163 states have return successors, (705), 339 states have call predecessors, (705), 307 states have call successors, (705) [2024-10-12 00:14:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1781 transitions. [2024-10-12 00:14:50,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1176 states and 1781 transitions. [2024-10-12 00:14:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-12 00:14:50,163 INFO L425 stractBuchiCegarLoop]: Abstraction has 1176 states and 1781 transitions. [2024-10-12 00:14:50,163 INFO L332 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2024-10-12 00:14:50,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1176 states and 1781 transitions. [2024-10-12 00:14:50,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 182 [2024-10-12 00:14:50,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:50,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:50,191 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 48, 24, 24, 24, 24, 24, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:50,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [44, 44, 29, 29, 29, 29, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:14:50,192 INFO L745 eck$LassoCheckResult]: Stem: 136019#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 135962#L-1 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; 135963#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 135978#L38 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; 135973#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 135974#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136188#L43 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; 136184#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136185#$Ultimate##0 ~n := #in~n; 136189#L25 assume ~n <= 0;#res := 1; 136187#factFINAL assume true; 136183#factEXIT >#72#return; 136177#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136178#$Ultimate##0 ~n := #in~n; 136186#L25 assume ~n <= 0;#res := 1; 136182#factFINAL assume true; 136176#factEXIT >#74#return; 136171#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136172#$Ultimate##0 ~n := #in~n; 136181#L25 assume ~n <= 0;#res := 1; 136175#factFINAL assume true; 136170#factEXIT >#76#return; 136167#L30-3 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; 136166#binomialCoefficient_returnLabel#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; 136165#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136162#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136156#L43 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; 136151#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136152#$Ultimate##0 ~n := #in~n; 136164#L25 assume !(~n <= 0); 136159#L26 call #t~ret0 := fact(~n - 1);< 136160#$Ultimate##0 ~n := #in~n; 136174#L25 assume ~n <= 0;#res := 1; 136169#factFINAL assume true; 136158#factEXIT >#70#return; 136155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136154#factFINAL assume true; 136150#factEXIT >#78#return; 136107#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136111#$Ultimate##0 ~n := #in~n; 136118#L25 assume ~n <= 0;#res := 1; 136112#factFINAL assume true; 136102#factEXIT >#80#return; 136096#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136101#$Ultimate##0 ~n := #in~n; 136161#L25 assume !(~n <= 0); 136127#L26 call #t~ret0 := fact(~n - 1);< 136130#$Ultimate##0 ~n := #in~n; 136163#L25 assume ~n <= 0;#res := 1; 136157#factFINAL assume true; 136153#factEXIT >#70#return; 136148#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136147#factFINAL assume true; 136144#factEXIT >#82#return; 136141#L30-8 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; 136139#binomialCoefficient_returnLabel#2 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; 136131#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136122#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136120#L43 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; 136115#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136117#$Ultimate##0 ~n := #in~n; 136137#L25 assume !(~n <= 0); 136125#L26 call #t~ret0 := fact(~n - 1);< 136130#$Ultimate##0 ~n := #in~n; 136146#L25 assume !(~n <= 0); 136124#L26 call #t~ret0 := fact(~n - 1);< 136143#$Ultimate##0 ~n := #in~n; 136149#L25 assume ~n <= 0;#res := 1; 136145#factFINAL assume true; 136142#factEXIT >#70#return; 136140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136132#factFINAL assume true; 136123#factEXIT >#70#return; 136121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136119#factFINAL assume true; 136113#factEXIT >#78#return; 136103#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136111#$Ultimate##0 ~n := #in~n; 136118#L25 assume ~n <= 0;#res := 1; 136112#factFINAL assume true; 136102#factEXIT >#80#return; 136099#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136101#$Ultimate##0 ~n := #in~n; 136161#L25 assume !(~n <= 0); 136127#L26 call #t~ret0 := fact(~n - 1);< 136130#$Ultimate##0 ~n := #in~n; 136146#L25 assume !(~n <= 0); 136124#L26 call #t~ret0 := fact(~n - 1);< 136143#$Ultimate##0 ~n := #in~n; 136149#L25 assume ~n <= 0;#res := 1; 136145#factFINAL assume true; 136142#factEXIT >#70#return; 136140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136132#factFINAL assume true; 136123#factEXIT >#70#return; 136128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136194#factFINAL assume true; 136095#factEXIT >#82#return; 136094#L30-8 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; 136072#binomialCoefficient_returnLabel#2 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; 136069#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136065#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136066#L43 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; 136193#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 137021#$Ultimate##0 ~n := #in~n; 137019#L25 assume !(~n <= 0); 136998#L26 call #t~ret0 := fact(~n - 1);< 137005#$Ultimate##0 ~n := #in~n; 137010#L25 assume !(~n <= 0); 136993#L26 call #t~ret0 := fact(~n - 1);< 137003#$Ultimate##0 ~n := #in~n; 137012#L25 assume ~n <= 0;#res := 1; 137006#factFINAL assume true; 136992#factEXIT >#70#return; 136994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137007#factFINAL assume true; 136995#factEXIT >#70#return; 136979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136978#factFINAL assume true; 136975#factEXIT >#78#return; 136977#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 137055#$Ultimate##0 ~n := #in~n; 137079#L25 assume ~n <= 0;#res := 1; 137077#factFINAL assume true; 137052#factEXIT >#80#return; 137009#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 137020#$Ultimate##0 ~n := #in~n; 137018#L25 assume !(~n <= 0); 136996#L26 call #t~ret0 := fact(~n - 1);< 137005#$Ultimate##0 ~n := #in~n; 137010#L25 assume !(~n <= 0); 136993#L26 call #t~ret0 := fact(~n - 1);< 137003#$Ultimate##0 ~n := #in~n; 137010#L25 assume !(~n <= 0); 136993#L26 call #t~ret0 := fact(~n - 1);< 137003#$Ultimate##0 ~n := #in~n; 137012#L25 assume ~n <= 0;#res := 1; 137006#factFINAL assume true; 136992#factEXIT >#70#return; 136994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137007#factFINAL assume true; 136995#factEXIT >#70#return; 136999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137066#factFINAL assume true; 137063#factEXIT >#70#return; 137064#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137109#factFINAL assume true; 137106#factEXIT >#82#return; 135964#L30-8 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; 135965#binomialCoefficient_returnLabel#2 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; 136017#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136018#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 136022#L42-4 havoc main_~k~0#1; 136023#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 136026#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 136027#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 135982#L43 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; 135983#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136532#$Ultimate##0 ~n := #in~n; 136539#L25 assume !(~n <= 0); 136536#L26 call #t~ret0 := fact(~n - 1);< 136537#$Ultimate##0 ~n := #in~n; 136540#L25 assume ~n <= 0;#res := 1; 136538#factFINAL assume true; 136535#factEXIT >#70#return; 136534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136533#factFINAL assume true; 136531#factEXIT >#72#return; 136527#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136530#$Ultimate##0 ~n := #in~n; 136547#L25 assume ~n <= 0;#res := 1; 136546#factFINAL assume true; 136526#factEXIT >#74#return; 136522#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136524#$Ultimate##0 ~n := #in~n; 136553#L25 assume !(~n <= 0); 136415#L26 call #t~ret0 := fact(~n - 1);< 136425#$Ultimate##0 ~n := #in~n; 136491#L25 assume ~n <= 0;#res := 1; 136458#factFINAL assume true; 136442#factEXIT >#70#return; 136450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136548#factFINAL assume true; 136519#factEXIT >#76#return; 136518#L30-3 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; 136517#binomialCoefficient_returnLabel#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; 136516#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136514#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136513#L43 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; 136511#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136512#$Ultimate##0 ~n := #in~n; 136525#L25 assume !(~n <= 0); 136443#L26 call #t~ret0 := fact(~n - 1);< 136452#$Ultimate##0 ~n := #in~n; 136491#L25 assume ~n <= 0;#res := 1; 136458#factFINAL assume true; 136442#factEXIT >#70#return; 136449#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136515#factFINAL assume true; 136510#factEXIT >#72#return; 136494#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136509#$Ultimate##0 ~n := #in~n; 136559#L25 assume !(~n <= 0); 136445#L26 call #t~ret0 := fact(~n - 1);< 136452#$Ultimate##0 ~n := #in~n; 136491#L25 assume ~n <= 0;#res := 1; 136458#factFINAL assume true; 136442#factEXIT >#70#return; 136447#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136551#factFINAL assume true; 136492#factEXIT >#74#return; 136484#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136490#$Ultimate##0 ~n := #in~n; 136552#L25 assume ~n <= 0;#res := 1; 136550#factFINAL assume true; 136480#factEXIT >#76#return; 136479#L30-3 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; 136478#binomialCoefficient_returnLabel#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; 136477#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136476#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136475#L43 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; 136326#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136351#$Ultimate##0 ~n := #in~n; 136573#L25 assume !(~n <= 0); 136392#L26 call #t~ret0 := fact(~n - 1);< 136402#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136433#L25 assume ~n <= 0;#res := 1; 136431#factFINAL assume true; 136427#factEXIT >#70#return; 136426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136421#factFINAL assume true; 136412#factEXIT >#70#return; 136418#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136474#factFINAL assume true; 136362#factEXIT >#78#return; 136370#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136440#$Ultimate##0 ~n := #in~n; 136608#L25 assume !(~n <= 0); 136446#L26 call #t~ret0 := fact(~n - 1);< 136452#$Ultimate##0 ~n := #in~n; 136491#L25 assume ~n <= 0;#res := 1; 136458#factFINAL assume true; 136442#factEXIT >#70#return; 136441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136439#factFINAL assume true; 136435#factEXIT >#80#return; 136334#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136384#$Ultimate##0 ~n := #in~n; 136473#L25 assume !(~n <= 0); 136393#L26 call #t~ret0 := fact(~n - 1);< 136451#$Ultimate##0 ~n := #in~n; 136491#L25 assume ~n <= 0;#res := 1; 136458#factFINAL assume true; 136442#factEXIT >#70#return; 136441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136439#factFINAL assume true; 136435#factEXIT >#82#return; 136436#L30-8 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; 136542#binomialCoefficient_returnLabel#2 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; 136356#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136357#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136028#L43 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; 135939#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 135940#$Ultimate##0 ~n := #in~n; 136299#L25 assume !(~n <= 0); 136278#L26 call #t~ret0 := fact(~n - 1);< 136287#$Ultimate##0 ~n := #in~n; 136285#L25 assume !(~n <= 0); 135945#L26 call #t~ret0 := fact(~n - 1);< 136282#$Ultimate##0 ~n := #in~n; 136284#L25 assume ~n <= 0;#res := 1; 136281#factFINAL assume true; 135943#factEXIT >#70#return; 135946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136298#factFINAL assume true; 136296#factEXIT >#70#return; 136295#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136294#factFINAL assume true; 136293#factEXIT >#78#return; 136262#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136292#$Ultimate##0 ~n := #in~n; 136291#L25 assume !(~n <= 0); 135996#L26 call #t~ret0 := fact(~n - 1);< 136280#$Ultimate##0 ~n := #in~n; 135994#L25 assume ~n <= 0;#res := 1; 135997#factFINAL assume true; 136306#factEXIT >#70#return; 136307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136260#factFINAL assume true; 136270#factEXIT >#80#return; 136013#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136005#$Ultimate##0 ~n := #in~n; 136014#L25 assume !(~n <= 0); 135995#L26 call #t~ret0 := fact(~n - 1);< 136290#$Ultimate##0 ~n := #in~n; 136285#L25 assume !(~n <= 0); 135945#L26 call #t~ret0 := fact(~n - 1);< 136282#$Ultimate##0 ~n := #in~n; 136284#L25 assume ~n <= 0;#res := 1; 136281#factFINAL assume true; 135943#factEXIT >#70#return; 135946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136298#factFINAL assume true; 136296#factEXIT >#70#return; 136295#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136294#factFINAL assume true; 136293#factEXIT >#82#return; 136036#L30-8 [2024-10-12 00:14:50,192 INFO L747 eck$LassoCheckResult]: Loop: 136036#L30-8 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; 135979#binomialCoefficient_returnLabel#2 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; 135980#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 135999#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 136000#L42-4 havoc main_~k~0#1; 135975#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 135976#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 136024#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136025#L43 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; 135958#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 135959#$Ultimate##0 ~n := #in~n; 136618#L25 assume !(~n <= 0); 136564#L26 call #t~ret0 := fact(~n - 1);< 136568#$Ultimate##0 ~n := #in~n; 136541#L25 assume !(~n <= 0); 136565#L26 call #t~ret0 := fact(~n - 1);< 136621#$Ultimate##0 ~n := #in~n; 136684#L25 assume ~n <= 0;#res := 1; 136682#factFINAL assume true; 136680#factEXIT >#70#return; 136678#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136634#factFINAL assume true; 136563#factEXIT >#70#return; 136566#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136557#factFINAL assume true; 136558#factEXIT >#72#return; 136528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136530#$Ultimate##0 ~n := #in~n; 136547#L25 assume ~n <= 0;#res := 1; 136546#factFINAL assume true; 136526#factEXIT >#74#return; 136521#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136524#$Ultimate##0 ~n := #in~n; 136553#L25 assume !(~n <= 0); 136415#L26 call #t~ret0 := fact(~n - 1);< 136425#$Ultimate##0 ~n := #in~n; 136491#L25 assume ~n <= 0;#res := 1; 136458#factFINAL assume true; 136442#factEXIT >#70#return; 136450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136548#factFINAL assume true; 136519#factEXIT >#76#return; 136523#L30-3 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; 136586#binomialCoefficient_returnLabel#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; 136587#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136599#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136597#L43 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; 136578#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136593#$Ultimate##0 ~n := #in~n; 136591#L25 assume !(~n <= 0); 136396#L26 call #t~ret0 := fact(~n - 1);< 136402#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136433#L25 assume ~n <= 0;#res := 1; 136431#factFINAL assume true; 136427#factEXIT >#70#return; 136426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136421#factFINAL assume true; 136412#factEXIT >#70#return; 136411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136410#factFINAL assume true; 136407#factEXIT >#70#return; 136398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136403#factFINAL assume true; 136386#factEXIT >#70#return; 136401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136625#factFINAL assume true; 136624#factEXIT >#72#return; 136503#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136555#$Ultimate##0 ~n := #in~n; 136554#L25 assume !(~n <= 0); 136389#L26 call #t~ret0 := fact(~n - 1);< 136451#$Ultimate##0 ~n := #in~n; 136491#L25 assume ~n <= 0;#res := 1; 136458#factFINAL assume true; 136442#factEXIT >#70#return; 136447#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136551#factFINAL assume true; 136492#factEXIT >#74#return; 136423#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136662#$Ultimate##0 ~n := #in~n; 136560#L25 assume !(~n <= 0); 136387#L26 call #t~ret0 := fact(~n - 1);< 136402#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136433#L25 assume ~n <= 0;#res := 1; 136431#factFINAL assume true; 136427#factEXIT >#70#return; 136426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136421#factFINAL assume true; 136412#factEXIT >#70#return; 136411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136410#factFINAL assume true; 136407#factEXIT >#70#return; 136397#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136824#factFINAL assume true; 136819#factEXIT >#76#return; 136487#L30-3 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; 136704#binomialCoefficient_returnLabel#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; 136616#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136614#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136601#L43 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; 136579#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136593#$Ultimate##0 ~n := #in~n; 136591#L25 assume !(~n <= 0); 136396#L26 call #t~ret0 := fact(~n - 1);< 136402#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136433#L25 assume ~n <= 0;#res := 1; 136431#factFINAL assume true; 136427#factEXIT >#70#return; 136426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136421#factFINAL assume true; 136412#factEXIT >#70#return; 136420#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136611#factFINAL assume true; 136600#factEXIT >#72#return; 136502#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136555#$Ultimate##0 ~n := #in~n; 136554#L25 assume !(~n <= 0); 136389#L26 call #t~ret0 := fact(~n - 1);< 136451#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136433#L25 assume ~n <= 0;#res := 1; 136431#factFINAL assume true; 136427#factEXIT >#70#return; 136426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136421#factFINAL assume true; 136412#factEXIT >#70#return; 136417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136576#factFINAL assume true; 136575#factEXIT >#74#return; 136467#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136588#$Ultimate##0 ~n := #in~n; 136571#L25 assume ~n <= 0;#res := 1; 136550#factFINAL assume true; 136480#factEXIT >#76#return; 136486#L30-3 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; 136605#binomialCoefficient_returnLabel#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; 136604#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136603#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136602#L43 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; 136338#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 136351#$Ultimate##0 ~n := #in~n; 136573#L25 assume !(~n <= 0); 136392#L26 call #t~ret0 := fact(~n - 1);< 136402#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136433#L25 assume ~n <= 0;#res := 1; 136431#factFINAL assume true; 136427#factEXIT >#70#return; 136426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136421#factFINAL assume true; 136412#factEXIT >#70#return; 136411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136410#factFINAL assume true; 136407#factEXIT >#70#return; 136398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136403#factFINAL assume true; 136386#factEXIT >#70#return; 136385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136383#factFINAL assume true; 136324#factEXIT >#78#return; 136344#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136384#$Ultimate##0 ~n := #in~n; 136473#L25 assume !(~n <= 0); 136393#L26 call #t~ret0 := fact(~n - 1);< 136451#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136432#L25 assume !(~n <= 0); 136390#L26 call #t~ret0 := fact(~n - 1);< 136430#$Ultimate##0 ~n := #in~n; 136433#L25 assume ~n <= 0;#res := 1; 136431#factFINAL assume true; 136427#factEXIT >#70#return; 136426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136421#factFINAL assume true; 136412#factEXIT >#70#return; 136411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136410#factFINAL assume true; 136407#factEXIT >#70#return; 136408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136456#factFINAL assume true; 136454#factEXIT >#80#return; 136346#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 136384#$Ultimate##0 ~n := #in~n; 136473#L25 assume !(~n <= 0); 136393#L26 call #t~ret0 := fact(~n - 1);< 136451#$Ultimate##0 ~n := #in~n; 136491#L25 assume ~n <= 0;#res := 1; 136458#factFINAL assume true; 136442#factEXIT >#70#return; 136441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136439#factFINAL assume true; 136435#factEXIT >#82#return; 136437#L30-8 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; 136472#binomialCoefficient_returnLabel#2 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; 136323#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 136321#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 136316#L43 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; 136031#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 135940#$Ultimate##0 ~n := #in~n; 136299#L25 assume !(~n <= 0); 136278#L26 call #t~ret0 := fact(~n - 1);< 136287#$Ultimate##0 ~n := #in~n; 136285#L25 assume !(~n <= 0); 135945#L26 call #t~ret0 := fact(~n - 1);< 136282#$Ultimate##0 ~n := #in~n; 136285#L25 assume !(~n <= 0); 135945#L26 call #t~ret0 := fact(~n - 1);< 136282#$Ultimate##0 ~n := #in~n; 136284#L25 assume ~n <= 0;#res := 1; 136281#factFINAL assume true; 135943#factEXIT >#70#return; 135946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136298#factFINAL assume true; 136296#factEXIT >#70#return; 136297#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136305#factFINAL assume true; 136304#factEXIT >#70#return; 136303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136302#factFINAL assume true; 136300#factEXIT >#78#return; 136264#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 136289#$Ultimate##0 ~n := #in~n; 136288#L25 assume !(~n <= 0); 135968#L26 call #t~ret0 := fact(~n - 1);< 136286#$Ultimate##0 ~n := #in~n; 135994#L25 assume ~n <= 0;#res := 1; 135997#factFINAL assume true; 136306#factEXIT >#70#return; 136307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136260#factFINAL assume true; 136270#factEXIT >#80#return; 136032#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 135940#$Ultimate##0 ~n := #in~n; 136299#L25 assume !(~n <= 0); 136278#L26 call #t~ret0 := fact(~n - 1);< 136287#$Ultimate##0 ~n := #in~n; 136285#L25 assume !(~n <= 0); 135945#L26 call #t~ret0 := fact(~n - 1);< 136282#$Ultimate##0 ~n := #in~n; 136284#L25 assume ~n <= 0;#res := 1; 136281#factFINAL assume true; 135943#factEXIT >#70#return; 135946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136298#factFINAL assume true; 136296#factEXIT >#70#return; 136295#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 136294#factFINAL assume true; 136293#factEXIT >#82#return; 136036#L30-8 [2024-10-12 00:14:50,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2072353291, now seen corresponding path program 11 times [2024-10-12 00:14:50,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:50,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416423529] [2024-10-12 00:14:50,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:50,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 00:14:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 00:14:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 00:14:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 00:14:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 00:14:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 00:14:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 00:14:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 00:14:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 00:14:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-12 00:14:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-12 00:14:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-12 00:14:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-12 00:14:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-12 00:14:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-12 00:14:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-12 00:14:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-12 00:14:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-12 00:14:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-10-12 00:14:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5207 backedges. 264 proven. 343 refuted. 0 times theorem prover too weak. 4600 trivial. 0 not checked. [2024-10-12 00:14:50,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:50,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416423529] [2024-10-12 00:14:50,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416423529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:50,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911978571] [2024-10-12 00:14:50,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:14:50,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:50,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:50,504 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:50,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2024-10-12 00:14:50,773 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-10-12 00:14:50,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:50,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 00:14:50,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5207 backedges. 3010 proven. 235 refuted. 0 times theorem prover too weak. 1962 trivial. 0 not checked. [2024-10-12 00:14:50,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5207 backedges. 427 proven. 1105 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2024-10-12 00:14:51,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911978571] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:51,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:51,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 19] total 32 [2024-10-12 00:14:51,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091107289] [2024-10-12 00:14:51,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:51,883 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:51,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash -311670396, now seen corresponding path program 9 times [2024-10-12 00:14:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:51,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235868599] [2024-10-12 00:14:51,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 00:14:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 00:14:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 00:14:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 00:14:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 00:14:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 00:14:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-12 00:14:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-12 00:14:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-12 00:14:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-12 00:14:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-12 00:14:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-12 00:14:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-12 00:14:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 45 proven. 633 refuted. 0 times theorem prover too weak. 3973 trivial. 0 not checked. [2024-10-12 00:14:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:52,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235868599] [2024-10-12 00:14:52,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235868599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:52,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437233002] [2024-10-12 00:14:52,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:14:52,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:52,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:52,306 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:52,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2024-10-12 00:14:52,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-12 00:14:52,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:52,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:14:52,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 530 proven. 283 refuted. 0 times theorem prover too weak. 3838 trivial. 0 not checked. [2024-10-12 00:14:52,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 536 proven. 287 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2024-10-12 00:14:53,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437233002] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:53,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:53,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 26 [2024-10-12 00:14:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091990928] [2024-10-12 00:14:53,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:53,454 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 00:14:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2024-10-12 00:14:53,455 INFO L87 Difference]: Start difference. First operand 1176 states and 1781 transitions. cyclomatic complexity: 623 Second operand has 26 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 23 states have internal predecessors, (69), 15 states have call successors, (33), 1 states have call predecessors, (33), 6 states have return successors, (35), 15 states have call predecessors, (35), 15 states have call successors, (35) [2024-10-12 00:14:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:54,182 INFO L93 Difference]: Finished difference Result 1316 states and 2002 transitions. [2024-10-12 00:14:54,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1316 states and 2002 transitions. [2024-10-12 00:14:54,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 184 [2024-10-12 00:14:54,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1316 states to 1220 states and 1800 transitions. [2024-10-12 00:14:54,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2024-10-12 00:14:54,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2024-10-12 00:14:54,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1220 states and 1800 transitions. [2024-10-12 00:14:54,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:54,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1220 states and 1800 transitions. [2024-10-12 00:14:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states and 1800 transitions. [2024-10-12 00:14:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1124. [2024-10-12 00:14:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 690 states have (on average 1.0724637681159421) internal successors, (740), 692 states have internal predecessors, (740), 275 states have call successors, (279), 131 states have call predecessors, (279), 159 states have return successors, (593), 300 states have call predecessors, (593), 275 states have call successors, (593) [2024-10-12 00:14:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1612 transitions. [2024-10-12 00:14:54,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1124 states and 1612 transitions. [2024-10-12 00:14:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-12 00:14:54,221 INFO L425 stractBuchiCegarLoop]: Abstraction has 1124 states and 1612 transitions. [2024-10-12 00:14:54,221 INFO L332 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2024-10-12 00:14:54,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1124 states and 1612 transitions. [2024-10-12 00:14:54,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 165 [2024-10-12 00:14:54,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:54,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:54,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 48, 24, 24, 24, 24, 24, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:54,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [44, 44, 29, 29, 29, 29, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:14:54,228 INFO L745 eck$LassoCheckResult]: Stem: 143004#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 142958#L-1 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; 142959#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 142975#L38 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; 142969#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 142970#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143173#L43 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; 143170#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143171#$Ultimate##0 ~n := #in~n; 143181#L25 assume ~n <= 0;#res := 1; 143179#factFINAL assume true; 143169#factEXIT >#72#return; 143156#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143157#$Ultimate##0 ~n := #in~n; 143161#L25 assume ~n <= 0;#res := 1; 143159#factFINAL assume true; 143155#factEXIT >#74#return; 143153#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143154#$Ultimate##0 ~n := #in~n; 143165#L25 assume ~n <= 0;#res := 1; 143164#factFINAL assume true; 143152#factEXIT >#76#return; 143150#L30-3 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; 143146#binomialCoefficient_returnLabel#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; 143144#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143142#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143141#L43 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; 143139#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143140#$Ultimate##0 ~n := #in~n; 143151#L25 assume !(~n <= 0); 143148#L26 call #t~ret0 := fact(~n - 1);< 143149#$Ultimate##0 ~n := #in~n; 143167#L25 assume ~n <= 0;#res := 1; 143166#factFINAL assume true; 143147#factEXIT >#70#return; 143145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143143#factFINAL assume true; 143138#factEXIT >#78#return; 143076#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143084#$Ultimate##0 ~n := #in~n; 143097#L25 assume ~n <= 0;#res := 1; 143093#factFINAL assume true; 143073#factEXIT >#80#return; 143070#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143072#$Ultimate##0 ~n := #in~n; 143168#L25 assume !(~n <= 0); 143103#L26 call #t~ret0 := fact(~n - 1);< 143110#$Ultimate##0 ~n := #in~n; 143136#L25 assume ~n <= 0;#res := 1; 143135#factFINAL assume true; 143134#factEXIT >#70#return; 143133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143131#factFINAL assume true; 143124#factEXIT >#82#return; 143121#L30-8 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; 143114#binomialCoefficient_returnLabel#2 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; 143113#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143101#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143098#L43 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; 143087#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143089#$Ultimate##0 ~n := #in~n; 143127#L25 assume !(~n <= 0); 143107#L26 call #t~ret0 := fact(~n - 1);< 143110#$Ultimate##0 ~n := #in~n; 143137#L25 assume !(~n <= 0); 143106#L26 call #t~ret0 := fact(~n - 1);< 143126#$Ultimate##0 ~n := #in~n; 143172#L25 assume ~n <= 0;#res := 1; 143158#factFINAL assume true; 143125#factEXIT >#70#return; 143122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143115#factFINAL assume true; 143102#factEXIT >#70#return; 143099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143094#factFINAL assume true; 143085#factEXIT >#78#return; 143079#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143084#$Ultimate##0 ~n := #in~n; 143097#L25 assume ~n <= 0;#res := 1; 143093#factFINAL assume true; 143073#factEXIT >#80#return; 143071#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143072#$Ultimate##0 ~n := #in~n; 143168#L25 assume !(~n <= 0); 143103#L26 call #t~ret0 := fact(~n - 1);< 143110#$Ultimate##0 ~n := #in~n; 143137#L25 assume !(~n <= 0); 143106#L26 call #t~ret0 := fact(~n - 1);< 143126#$Ultimate##0 ~n := #in~n; 143172#L25 assume ~n <= 0;#res := 1; 143158#factFINAL assume true; 143125#factEXIT >#70#return; 143122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143115#factFINAL assume true; 143102#factEXIT >#70#return; 143108#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143184#factFINAL assume true; 143069#factEXIT >#82#return; 143065#L30-8 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; 143062#binomialCoefficient_returnLabel#2 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; 143059#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143055#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143056#L43 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; 143177#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143963#$Ultimate##0 ~n := #in~n; 143961#L25 assume !(~n <= 0); 143953#L26 call #t~ret0 := fact(~n - 1);< 143958#$Ultimate##0 ~n := #in~n; 143968#L25 assume !(~n <= 0); 143955#L26 call #t~ret0 := fact(~n - 1);< 143965#$Ultimate##0 ~n := #in~n; 143969#L25 assume ~n <= 0;#res := 1; 143966#factFINAL assume true; 143964#factEXIT >#70#return; 143962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143959#factFINAL assume true; 143951#factEXIT >#70#return; 143957#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 144039#factFINAL assume true; 144038#factEXIT >#78#return; 143983#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143984#$Ultimate##0 ~n := #in~n; 143986#L25 assume ~n <= 0;#res := 1; 143985#factFINAL assume true; 143979#factEXIT >#80#return; 143977#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143978#$Ultimate##0 ~n := #in~n; 143987#L25 assume !(~n <= 0); 143954#L26 call #t~ret0 := fact(~n - 1);< 143958#$Ultimate##0 ~n := #in~n; 143968#L25 assume !(~n <= 0); 143955#L26 call #t~ret0 := fact(~n - 1);< 143965#$Ultimate##0 ~n := #in~n; 143968#L25 assume !(~n <= 0); 143955#L26 call #t~ret0 := fact(~n - 1);< 143965#$Ultimate##0 ~n := #in~n; 143969#L25 assume ~n <= 0;#res := 1; 143966#factFINAL assume true; 143964#factEXIT >#70#return; 143962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143959#factFINAL assume true; 143951#factEXIT >#70#return; 143956#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143996#factFINAL assume true; 143992#factEXIT >#70#return; 143993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 144051#factFINAL assume true; 144044#factEXIT >#82#return; 143027#L30-8 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; 143563#binomialCoefficient_returnLabel#2 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; 143562#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 142986#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 142987#L42-4 havoc main_~k~0#1; 142973#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 142974#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 143009#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143010#L43 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; 142944#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 142945#$Ultimate##0 ~n := #in~n; 143558#L25 assume !(~n <= 0); 143542#L26 call #t~ret0 := fact(~n - 1);< 143555#$Ultimate##0 ~n := #in~n; 143560#L25 assume ~n <= 0;#res := 1; 143557#factFINAL assume true; 143554#factEXIT >#70#return; 143551#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143547#factFINAL assume true; 143536#factEXIT >#72#return; 143514#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 142996#$Ultimate##0 ~n := #in~n; 143531#L25 assume ~n <= 0;#res := 1; 143528#factFINAL assume true; 143513#factEXIT >#74#return; 143498#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143501#$Ultimate##0 ~n := #in~n; 143537#L25 assume !(~n <= 0); 143352#L26 call #t~ret0 := fact(~n - 1);< 143358#$Ultimate##0 ~n := #in~n; 143364#L25 assume ~n <= 0;#res := 1; 143359#factFINAL assume true; 143342#factEXIT >#70#return; 143357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143504#factFINAL assume true; 143497#factEXIT >#76#return; 143488#L30-3 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; 143481#binomialCoefficient_returnLabel#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; 143474#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143473#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143470#L43 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; 143452#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143453#$Ultimate##0 ~n := #in~n; 143483#L25 assume !(~n <= 0); 143343#L26 call #t~ret0 := fact(~n - 1);< 143358#$Ultimate##0 ~n := #in~n; 143364#L25 assume ~n <= 0;#res := 1; 143359#factFINAL assume true; 143342#factEXIT >#70#return; 143354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143461#factFINAL assume true; 143451#factEXIT >#72#return; 143434#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143439#$Ultimate##0 ~n := #in~n; 143458#L25 assume !(~n <= 0); 143344#L26 call #t~ret0 := fact(~n - 1);< 143358#$Ultimate##0 ~n := #in~n; 143364#L25 assume ~n <= 0;#res := 1; 143359#factFINAL assume true; 143342#factEXIT >#70#return; 143355#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143445#factFINAL assume true; 143421#factEXIT >#74#return; 143414#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143416#$Ultimate##0 ~n := #in~n; 143443#L25 assume ~n <= 0;#res := 1; 143419#factFINAL assume true; 143408#factEXIT >#76#return; 143405#L30-3 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; 143399#binomialCoefficient_returnLabel#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; 143397#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143391#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143375#L43 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; 143369#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143372#$Ultimate##0 ~n := #in~n; 143396#L25 assume !(~n <= 0); 143379#L26 call #t~ret0 := fact(~n - 1);< 143389#$Ultimate##0 ~n := #in~n; 143407#L25 assume !(~n <= 0); 143380#L26 call #t~ret0 := fact(~n - 1);< 143403#$Ultimate##0 ~n := #in~n; 143417#L25 assume ~n <= 0;#res := 1; 143406#factFINAL assume true; 143401#factEXIT >#70#return; 143398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143392#factFINAL assume true; 143376#factEXIT >#70#return; 143374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143373#factFINAL assume true; 143367#factEXIT >#78#return; 143330#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143338#$Ultimate##0 ~n := #in~n; 143400#L25 assume !(~n <= 0); 143346#L26 call #t~ret0 := fact(~n - 1);< 143358#$Ultimate##0 ~n := #in~n; 143364#L25 assume ~n <= 0;#res := 1; 143359#factFINAL assume true; 143342#factEXIT >#70#return; 143339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143336#factFINAL assume true; 143312#factEXIT >#80#return; 143314#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143335#$Ultimate##0 ~n := #in~n; 143485#L25 assume !(~n <= 0); 143349#L26 call #t~ret0 := fact(~n - 1);< 143455#$Ultimate##0 ~n := #in~n; 143364#L25 assume ~n <= 0;#res := 1; 143359#factFINAL assume true; 143342#factEXIT >#70#return; 143339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143336#factFINAL assume true; 143312#factEXIT >#82#return; 143331#L30-8 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; 143366#binomialCoefficient_returnLabel#2 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; 143365#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143341#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143340#L43 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; 143015#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 142932#$Ultimate##0 ~n := #in~n; 143294#L25 assume !(~n <= 0); 143271#L26 call #t~ret0 := fact(~n - 1);< 143286#$Ultimate##0 ~n := #in~n; 143280#L25 assume !(~n <= 0); 142937#L26 call #t~ret0 := fact(~n - 1);< 143277#$Ultimate##0 ~n := #in~n; 143279#L25 assume ~n <= 0;#res := 1; 143276#factFINAL assume true; 142935#factEXIT >#70#return; 142938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143287#factFINAL assume true; 143288#factEXIT >#70#return; 143295#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143302#factFINAL assume true; 143300#factEXIT >#78#return; 143264#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143000#$Ultimate##0 ~n := #in~n; 143299#L25 assume !(~n <= 0); 143274#L26 call #t~ret0 := fact(~n - 1);< 143275#$Ultimate##0 ~n := #in~n; 143282#L25 assume ~n <= 0;#res := 1; 143297#factFINAL assume true; 143289#factEXIT >#70#return; 143259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143268#factFINAL assume true; 143301#factEXIT >#80#return; 143023#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143296#$Ultimate##0 ~n := #in~n; 143292#L25 assume !(~n <= 0); 143270#L26 call #t~ret0 := fact(~n - 1);< 143298#$Ultimate##0 ~n := #in~n; 143280#L25 assume !(~n <= 0); 142937#L26 call #t~ret0 := fact(~n - 1);< 143277#$Ultimate##0 ~n := #in~n; 143279#L25 assume ~n <= 0;#res := 1; 143276#factFINAL assume true; 142935#factEXIT >#70#return; 142938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143287#factFINAL assume true; 143288#factEXIT >#70#return; 143295#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143302#factFINAL assume true; 143300#factEXIT >#82#return; 142960#L30-8 [2024-10-12 00:14:54,228 INFO L747 eck$LassoCheckResult]: Loop: 142960#L30-8 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; 142961#binomialCoefficient_returnLabel#2 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; 142976#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143003#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 143007#L42-4 havoc main_~k~0#1; 143008#L41-2 main_#t~post10#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 143011#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 143012#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 142979#L43 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; 142980#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143530#$Ultimate##0 ~n := #in~n; 143550#L25 assume !(~n <= 0); 143543#L26 call #t~ret0 := fact(~n - 1);< 143546#$Ultimate##0 ~n := #in~n; 143553#L25 assume !(~n <= 0); 143544#L26 call #t~ret0 := fact(~n - 1);< 143549#$Ultimate##0 ~n := #in~n; 143561#L25 assume ~n <= 0;#res := 1; 143559#factFINAL assume true; 143556#factEXIT >#70#return; 143552#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143548#factFINAL assume true; 143541#factEXIT >#70#return; 143535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143534#factFINAL assume true; 143529#factEXIT >#72#return; 143515#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 142996#$Ultimate##0 ~n := #in~n; 143531#L25 assume ~n <= 0;#res := 1; 143528#factFINAL assume true; 143513#factEXIT >#74#return; 143394#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143525#$Ultimate##0 ~n := #in~n; 143665#L25 assume !(~n <= 0); 143622#L26 call #t~ret0 := fact(~n - 1);< 143650#$Ultimate##0 ~n := #in~n; 143644#L25 assume !(~n <= 0); 143640#L26 call #t~ret0 := fact(~n - 1);< 143641#$Ultimate##0 ~n := #in~n; 143646#L25 assume ~n <= 0;#res := 1; 143643#factFINAL assume true; 143639#factEXIT >#70#return; 143638#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143634#factFINAL assume true; 143619#factEXIT >#70#return; 143631#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143664#factFINAL assume true; 143663#factEXIT >#76#return; 143657#L30-3 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; 143658#binomialCoefficient_returnLabel#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; 143653#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143654#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143648#L43 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; 143615#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143616#$Ultimate##0 ~n := #in~n; 143637#L25 assume !(~n <= 0); 143626#L26 call #t~ret0 := fact(~n - 1);< 143633#$Ultimate##0 ~n := #in~n; 143645#L25 assume !(~n <= 0); 143624#L26 call #t~ret0 := fact(~n - 1);< 143642#$Ultimate##0 ~n := #in~n; 143646#L25 assume ~n <= 0;#res := 1; 143643#factFINAL assume true; 143639#factEXIT >#70#return; 143638#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143634#factFINAL assume true; 143619#factEXIT >#70#return; 143618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143617#factFINAL assume true; 143613#factEXIT >#72#return; 143508#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143512#$Ultimate##0 ~n := #in~n; 143538#L25 assume ~n <= 0;#res := 1; 143520#factFINAL assume true; 143507#factEXIT >#74#return; 143499#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143505#$Ultimate##0 ~n := #in~n; 143533#L25 assume !(~n <= 0); 143351#L26 call #t~ret0 := fact(~n - 1);< 143390#$Ultimate##0 ~n := #in~n; 143418#L25 assume !(~n <= 0); 143402#L26 call #t~ret0 := fact(~n - 1);< 143404#$Ultimate##0 ~n := #in~n; 143417#L25 assume ~n <= 0;#res := 1; 143406#factFINAL assume true; 143401#factEXIT >#70#return; 143398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143392#factFINAL assume true; 143376#factEXIT >#70#return; 143388#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143540#factFINAL assume true; 143522#factEXIT >#76#return; 143523#L30-3 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; 143579#binomialCoefficient_returnLabel#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; 143576#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143574#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143572#L43 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; 143493#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143496#$Ultimate##0 ~n := #in~n; 143532#L25 assume !(~n <= 0); 143381#L26 call #t~ret0 := fact(~n - 1);< 143389#$Ultimate##0 ~n := #in~n; 143407#L25 assume !(~n <= 0); 143380#L26 call #t~ret0 := fact(~n - 1);< 143403#$Ultimate##0 ~n := #in~n; 143407#L25 assume !(~n <= 0); 143380#L26 call #t~ret0 := fact(~n - 1);< 143403#$Ultimate##0 ~n := #in~n; 143407#L25 assume !(~n <= 0); 143380#L26 call #t~ret0 := fact(~n - 1);< 143403#$Ultimate##0 ~n := #in~n; 143417#L25 assume ~n <= 0;#res := 1; 143406#factFINAL assume true; 143401#factEXIT >#70#return; 143398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143392#factFINAL assume true; 143376#factEXIT >#70#return; 143387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143475#factFINAL assume true; 143471#factEXIT >#70#return; 143467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143482#factFINAL assume true; 143462#factEXIT >#70#return; 143468#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143570#factFINAL assume true; 143567#factEXIT >#72#return; 143425#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143457#$Ultimate##0 ~n := #in~n; 143456#L25 assume !(~n <= 0); 143345#L26 call #t~ret0 := fact(~n - 1);< 143455#$Ultimate##0 ~n := #in~n; 143407#L25 assume !(~n <= 0); 143380#L26 call #t~ret0 := fact(~n - 1);< 143403#$Ultimate##0 ~n := #in~n; 143417#L25 assume ~n <= 0;#res := 1; 143406#factFINAL assume true; 143401#factEXIT >#70#return; 143398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143392#factFINAL assume true; 143376#factEXIT >#70#return; 143384#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143601#factFINAL assume true; 143595#factEXIT >#74#return; 143412#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143490#$Ultimate##0 ~n := #in~n; 143487#L25 assume ~n <= 0;#res := 1; 143419#factFINAL assume true; 143408#factEXIT >#76#return; 143415#L30-3 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; 143447#binomialCoefficient_returnLabel#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; 143446#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143444#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143442#L43 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; 143371#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 143372#$Ultimate##0 ~n := #in~n; 143396#L25 assume !(~n <= 0); 143379#L26 call #t~ret0 := fact(~n - 1);< 143389#$Ultimate##0 ~n := #in~n; 143407#L25 assume !(~n <= 0); 143380#L26 call #t~ret0 := fact(~n - 1);< 143403#$Ultimate##0 ~n := #in~n; 143407#L25 assume !(~n <= 0); 143380#L26 call #t~ret0 := fact(~n - 1);< 143403#$Ultimate##0 ~n := #in~n; 143407#L25 assume !(~n <= 0); 143380#L26 call #t~ret0 := fact(~n - 1);< 143403#$Ultimate##0 ~n := #in~n; 143417#L25 assume ~n <= 0;#res := 1; 143406#factFINAL assume true; 143401#factEXIT >#70#return; 143398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143392#factFINAL assume true; 143376#factEXIT >#70#return; 143387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143475#factFINAL assume true; 143471#factEXIT >#70#return; 143467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143482#factFINAL assume true; 143462#factEXIT >#70#return; 143459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143454#factFINAL assume true; 143448#factEXIT >#78#return; 143315#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143335#$Ultimate##0 ~n := #in~n; 143485#L25 assume !(~n <= 0); 143349#L26 call #t~ret0 := fact(~n - 1);< 143455#$Ultimate##0 ~n := #in~n; 143407#L25 assume !(~n <= 0); 143380#L26 call #t~ret0 := fact(~n - 1);< 143403#$Ultimate##0 ~n := #in~n; 143407#L25 assume !(~n <= 0); 143380#L26 call #t~ret0 := fact(~n - 1);< 143403#$Ultimate##0 ~n := #in~n; 143417#L25 assume ~n <= 0;#res := 1; 143406#factFINAL assume true; 143401#factEXIT >#70#return; 143398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143392#factFINAL assume true; 143376#factEXIT >#70#return; 143387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143475#factFINAL assume true; 143471#factEXIT >#70#return; 143460#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143449#factFINAL assume true; 143440#factEXIT >#80#return; 143320#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 143335#$Ultimate##0 ~n := #in~n; 143485#L25 assume !(~n <= 0); 143349#L26 call #t~ret0 := fact(~n - 1);< 143455#$Ultimate##0 ~n := #in~n; 143364#L25 assume ~n <= 0;#res := 1; 143359#factFINAL assume true; 143342#factEXIT >#70#return; 143339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143336#factFINAL assume true; 143312#factEXIT >#82#return; 143311#L30-8 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; 143310#binomialCoefficient_returnLabel#2 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; 143309#L42-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 143307#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 143305#L43 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; 143016#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 142932#$Ultimate##0 ~n := #in~n; 143294#L25 assume !(~n <= 0); 143271#L26 call #t~ret0 := fact(~n - 1);< 143286#$Ultimate##0 ~n := #in~n; 143280#L25 assume !(~n <= 0); 142937#L26 call #t~ret0 := fact(~n - 1);< 143277#$Ultimate##0 ~n := #in~n; 143280#L25 assume !(~n <= 0); 142937#L26 call #t~ret0 := fact(~n - 1);< 143277#$Ultimate##0 ~n := #in~n; 143280#L25 assume !(~n <= 0); 142937#L26 call #t~ret0 := fact(~n - 1);< 143277#$Ultimate##0 ~n := #in~n; 143279#L25 assume ~n <= 0;#res := 1; 143276#factFINAL assume true; 142935#factEXIT >#70#return; 142938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143287#factFINAL assume true; 143288#factEXIT >#70#return; 143293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143290#factFINAL assume true; 143291#factEXIT >#70#return; 143273#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143308#factFINAL assume true; 143269#factEXIT >#70#return; 143272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143303#factFINAL assume true; 143013#factEXIT >#78#return; 143017#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 143296#$Ultimate##0 ~n := #in~n; 143292#L25 assume !(~n <= 0); 143270#L26 call #t~ret0 := fact(~n - 1);< 143298#$Ultimate##0 ~n := #in~n; 143282#L25 assume ~n <= 0;#res := 1; 143297#factFINAL assume true; 143289#factEXIT >#70#return; 143259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143268#factFINAL assume true; 143301#factEXIT >#80#return; 143020#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 142932#$Ultimate##0 ~n := #in~n; 143294#L25 assume !(~n <= 0); 143271#L26 call #t~ret0 := fact(~n - 1);< 143286#$Ultimate##0 ~n := #in~n; 143280#L25 assume !(~n <= 0); 142937#L26 call #t~ret0 := fact(~n - 1);< 143277#$Ultimate##0 ~n := #in~n; 143279#L25 assume ~n <= 0;#res := 1; 143276#factFINAL assume true; 142935#factEXIT >#70#return; 142938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143287#factFINAL assume true; 143288#factEXIT >#70#return; 143295#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 143302#factFINAL assume true; 143300#factEXIT >#82#return; 142960#L30-8 [2024-10-12 00:14:54,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2072353291, now seen corresponding path program 12 times [2024-10-12 00:14:54,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:54,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442479145] [2024-10-12 00:14:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:54,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 00:14:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 00:14:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 00:14:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 00:14:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 00:14:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 00:14:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 00:14:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 00:14:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 00:14:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 00:14:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 00:14:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 00:14:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-12 00:14:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 00:14:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-12 00:14:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-12 00:14:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-12 00:14:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-12 00:14:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-12 00:14:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-12 00:14:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-12 00:14:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-12 00:14:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-12 00:14:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-10-12 00:14:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5207 backedges. 266 proven. 341 refuted. 0 times theorem prover too weak. 4600 trivial. 0 not checked. [2024-10-12 00:14:54,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442479145] [2024-10-12 00:14:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442479145] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328536160] [2024-10-12 00:14:54,533 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:14:54,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:54,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:54,536 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:54,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2024-10-12 00:14:54,869 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2024-10-12 00:14:54,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:54,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:14:54,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5207 backedges. 1526 proven. 8 refuted. 0 times theorem prover too weak. 3673 trivial. 0 not checked. [2024-10-12 00:14:54,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5207 backedges. 540 proven. 69 refuted. 0 times theorem prover too weak. 4598 trivial. 0 not checked. [2024-10-12 00:14:55,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328536160] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:55,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:55,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 18 [2024-10-12 00:14:55,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467933082] [2024-10-12 00:14:55,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:55,358 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash -867777212, now seen corresponding path program 10 times [2024-10-12 00:14:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121412771] [2024-10-12 00:14:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:14:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 00:14:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 00:14:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 00:14:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 00:14:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 00:14:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 00:14:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 00:14:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-12 00:14:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 00:14:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-12 00:14:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-12 00:14:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-12 00:14:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-12 00:14:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-12 00:14:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 00:14:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 66 proven. 103 refuted. 0 times theorem prover too weak. 4482 trivial. 0 not checked. [2024-10-12 00:14:55,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121412771] [2024-10-12 00:14:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121412771] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132468389] [2024-10-12 00:14:55,581 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:55,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:55,583 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:55,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Waiting until timeout for monitored process [2024-10-12 00:14:55,782 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:55,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:55,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:14:55,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 1796 proven. 2 refuted. 0 times theorem prover too weak. 2853 trivial. 0 not checked. [2024-10-12 00:14:55,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 68 proven. 101 refuted. 0 times theorem prover too weak. 4482 trivial. 0 not checked. [2024-10-12 00:14:56,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132468389] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:56,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:56,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-12 00:14:56,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977808887] [2024-10-12 00:14:56,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:56,082 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:56,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 00:14:56,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 00:14:56,083 INFO L87 Difference]: Start difference. First operand 1124 states and 1612 transitions. cyclomatic complexity: 505 Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-12 00:14:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:56,205 INFO L93 Difference]: Finished difference Result 1108 states and 1575 transitions. [2024-10-12 00:14:56,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1108 states and 1575 transitions. [2024-10-12 00:14:56,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 130 [2024-10-12 00:14:56,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1108 states to 998 states and 1425 transitions. [2024-10-12 00:14:56,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2024-10-12 00:14:56,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2024-10-12 00:14:56,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 998 states and 1425 transitions. [2024-10-12 00:14:56,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:56,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 998 states and 1425 transitions. [2024-10-12 00:14:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states and 1425 transitions.