./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-numeric/Binomial.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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.3-dev-e7bb482 [2023-11-06 22:37:03,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:37:03,654 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-06 22:37:03,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:37:03,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:37:03,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:37:03,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:37:03,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:37:03,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:37:03,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:37:03,710 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:37:03,711 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-06 22:37:03,711 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-06 22:37:03,713 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-06 22:37:03,714 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-06 22:37:03,714 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-06 22:37:03,715 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-06 22:37:03,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:37:03,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-06 22:37:03,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:37:03,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:37:03,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-06 22:37:03,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-06 22:37:03,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-06 22:37:03,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:37:03,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:37:03,721 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-06 22:37:03,721 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:37:03,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:37:03,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:37:03,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:37:03,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:37:03,725 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-06 22:37:03,725 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2023-11-06 22:37:04,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:37:04,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:37:04,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:37:04,077 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:37:04,077 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:37:04,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-numeric/Binomial.c [2023-11-06 22:37:07,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:37:07,408 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:37:07,409 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/sv-benchmarks/c/termination-numeric/Binomial.c [2023-11-06 22:37:07,422 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/data/b41596625/ab01c723646741a7adcf846d212650e8/FLAGdbd8ff5ad [2023-11-06 22:37:07,442 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/data/b41596625/ab01c723646741a7adcf846d212650e8 [2023-11-06 22:37:07,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:37:07,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:37:07,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:37:07,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:37:07,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:37:07,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcc5c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07, skipping insertion in model container [2023-11-06 22:37:07,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,485 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:37:07,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:37:07,664 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:37:07,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:37:07,693 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:37:07,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07 WrapperNode [2023-11-06 22:37:07,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:37:07,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:37:07,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:37:07,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:37:07,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,727 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2023-11-06 22:37:07,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:37:07,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:37:07,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:37:07,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:37:07,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:37:07,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:37:07,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:37:07,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:37:07,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (1/1) ... [2023-11-06 22:37:07,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:07,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:07,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:07,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-06 22:37:07,826 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2023-11-06 22:37:07,827 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2023-11-06 22:37:07,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:37:07,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:37:07,890 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:37:07,892 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:37:08,072 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:37:08,079 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:37:08,079 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:37:08,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:08 BoogieIcfgContainer [2023-11-06 22:37:08,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:37:08,083 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-06 22:37:08,083 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-06 22:37:08,089 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-06 22:37:08,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:37:08,090 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.11 10:37:07" (1/3) ... [2023-11-06 22:37:08,091 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58dcb6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:37:08, skipping insertion in model container [2023-11-06 22:37:08,091 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:37:08,092 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:07" (2/3) ... [2023-11-06 22:37:08,092 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58dcb6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:37:08, skipping insertion in model container [2023-11-06 22:37:08,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:37:08,092 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:08" (3/3) ... [2023-11-06 22:37:08,093 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2023-11-06 22:37:08,184 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-06 22:37:08,184 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-06 22:37:08,184 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-06 22:37:08,184 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-06 22:37:08,186 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-06 22:37:08,187 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-06 22:37:08,187 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-06 22:37:08,188 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-06 22:37:08,192 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) [2023-11-06 22:37:08,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-11-06 22:37:08,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:08,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:08,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-06 22:37:08,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:37:08,228 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-06 22:37:08,229 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) [2023-11-06 22:37:08,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-11-06 22:37:08,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:08,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:08,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-06 22:37:08,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:37:08,240 INFO L748 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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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 [2023-11-06 22:37:08,240 INFO L750 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~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 11#L41-3true [2023-11-06 22:37:08,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:08,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2023-11-06 22:37:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:08,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345971443] [2023-11-06 22:37:08,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:08,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:08,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:08,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:08,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1792233, now seen corresponding path program 1 times [2023-11-06 22:37:08,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:08,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696649086] [2023-11-06 22:37:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:08,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:08,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:08,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash -15995056, now seen corresponding path program 1 times [2023-11-06 22:37:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:08,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384395198] [2023-11-06 22:37:08,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:08,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:08,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384395198] [2023-11-06 22:37:08,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384395198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:08,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:08,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:37:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552660933] [2023-11-06 22:37:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:08,540 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:08,541 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:08,541 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:08,541 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:08,542 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:37:08,542 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:08,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:08,542 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:08,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-11-06 22:37:08,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:08,543 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:08,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:08,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:08,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:08,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:08,650 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:37:08,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:08,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:08,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:08,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:08,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:08,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-06 22:37:08,692 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:08,693 INFO L440 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: [] [2023-11-06 22:37:08,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:08,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:08,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:08,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:08,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:08,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:08,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-06 22:37:08,730 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:08,731 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:08,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-11-06 22:37:08,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:08,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:08,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:08,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:08,748 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:08,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-06 22:37:08,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-06 22:37:08,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:08,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:08,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:08,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-06 22:37:08,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:37:08,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:08,880 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:37:08,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:08,885 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:08,885 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:08,885 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:08,886 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:08,886 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:37:08,886 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:08,886 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:08,886 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:08,886 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-11-06 22:37:08,886 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:08,886 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:08,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:08,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:08,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:08,957 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:08,983 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:37:08,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:08,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:08,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:08,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-06 22:37:08,996 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 [2023-11-06 22:37:09,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:09,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:09,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:09,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:09,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:09,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:09,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:09,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:09,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:09,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:09,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:09,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:09,039 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 [2023-11-06 22:37:09,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-06 22:37:09,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:09,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:09,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:09,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:09,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:09,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:09,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:09,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:09,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:09,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:09,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:09,073 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:09,081 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 [2023-11-06 22:37:09,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-06 22:37:09,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:09,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:09,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:09,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:09,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:09,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:09,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:09,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:37:09,111 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:37:09,111 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-06 22:37:09,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:09,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:09,145 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:09,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:37:09,149 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:37:09,149 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:37:09,150 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-11-06 22:37:09,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-06 22:37:09,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:09,163 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:37:09,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:09,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:37:09,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:09,216 WARN L260 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:37:09,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:09,368 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 [2023-11-06 22:37:09,370 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) [2023-11-06 22:37:09,501 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 75 states and 109 transitions. Complement of second has 13 states. [2023-11-06 22:37:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:09,507 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) [2023-11-06 22:37:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2023-11-06 22:37:09,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 55 transitions. Stem has 4 letters. Loop has 4 letters. [2023-11-06 22:37:09,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:09,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 55 transitions. Stem has 8 letters. Loop has 4 letters. [2023-11-06 22:37:09,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:09,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 55 transitions. Stem has 4 letters. Loop has 8 letters. [2023-11-06 22:37:09,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:09,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 109 transitions. [2023-11-06 22:37:09,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-11-06 22:37:09,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 35 states and 50 transitions. [2023-11-06 22:37:09,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-11-06 22:37:09,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-06 22:37:09,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 50 transitions. [2023-11-06 22:37:09,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:09,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 50 transitions. [2023-11-06 22:37:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 50 transitions. [2023-11-06 22:37:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-11-06 22:37:09,561 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) [2023-11-06 22:37:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2023-11-06 22:37:09,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2023-11-06 22:37:09,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:09,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:37:09,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:37:09,568 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) [2023-11-06 22:37:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:09,626 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-11-06 22:37:09,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2023-11-06 22:37:09,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-06 22:37:09,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2023-11-06 22:37:09,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-11-06 22:37:09,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-06 22:37:09,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2023-11-06 22:37:09,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:09,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-11-06 22:37:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2023-11-06 22:37:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-06 22:37:09,635 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) [2023-11-06 22:37:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-11-06 22:37:09,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-06 22:37:09,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:37:09,638 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-06 22:37:09,638 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-06 22:37:09,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2023-11-06 22:37:09,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-06 22:37:09,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:09,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:09,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-06 22:37:09,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:09,641 INFO L748 eck$LassoCheckResult]: Stem: 256#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 244#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 245#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; 251#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; 247#L41-3 [2023-11-06 22:37:09,641 INFO L750 eck$LassoCheckResult]: Loop: 247#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 248#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 253#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; 231#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 232#$Ultimate##0 ~n := #in~n; 254#L25 assume ~n <= 0;#res := 1; 243#factFINAL assume true; 233#factEXIT >#78#return; 237#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 232#$Ultimate##0 ~n := #in~n; 254#L25 assume ~n <= 0;#res := 1; 243#factFINAL assume true; 233#factEXIT >#80#return; 239#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 232#$Ultimate##0 ~n := #in~n; 254#L25 assume ~n <= 0;#res := 1; 243#factFINAL assume true; 233#factEXIT >#82#return; 242#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; 246#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 252#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 255#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 257#L42-4 havoc main_~k~0#1; 250#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247#L41-3 [2023-11-06 22:37:09,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2023-11-06 22:37:09,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:09,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937593700] [2023-11-06 22:37:09,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:09,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:09,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:09,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:09,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:09,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2022384732, now seen corresponding path program 1 times [2023-11-06 22:37:09,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:09,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863828772] [2023-11-06 22:37:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:09,672 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:09,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435374905] [2023-11-06 22:37:09,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:09,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:09,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:09,674 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:09,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:37:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:09,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:37:09,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:37:09,792 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:37:09,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:09,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863828772] [2023-11-06 22:37:09,793 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:09,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435374905] [2023-11-06 22:37:09,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435374905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:09,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:09,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:37:09,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547680020] [2023-11-06 22:37:09,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:09,794 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:09,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:09,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:37:09,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:37:09,795 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) [2023-11-06 22:37:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:09,862 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2023-11-06 22:37:09,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 43 transitions. [2023-11-06 22:37:09,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-06 22:37:09,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 43 transitions. [2023-11-06 22:37:09,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-11-06 22:37:09,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-06 22:37:09,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2023-11-06 22:37:09,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:09,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-11-06 22:37:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2023-11-06 22:37:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-06 22:37:09,871 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) [2023-11-06 22:37:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2023-11-06 22:37:09,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-11-06 22:37:09,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:37:09,873 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-11-06 22:37:09,873 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-06 22:37:09,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2023-11-06 22:37:09,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-06 22:37:09,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:09,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:09,875 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-06 22:37:09,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:09,876 INFO L748 eck$LassoCheckResult]: Stem: 393#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 379#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 380#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; 387#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; 383#L41-3 [2023-11-06 22:37:09,876 INFO L750 eck$LassoCheckResult]: Loop: 383#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 384#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 389#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; 372#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 367#$Ultimate##0 ~n := #in~n; 390#L25 assume ~n <= 0;#res := 1; 391#factFINAL assume true; 368#factEXIT >#72#return; 374#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 367#$Ultimate##0 ~n := #in~n; 390#L25 assume ~n <= 0;#res := 1; 391#factFINAL assume true; 368#factEXIT >#74#return; 371#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 367#$Ultimate##0 ~n := #in~n; 390#L25 assume ~n <= 0;#res := 1; 391#factFINAL assume true; 368#factEXIT >#76#return; 375#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; 385#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 388#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 392#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 394#L42-4 havoc main_~k~0#1; 386#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 383#L41-3 [2023-11-06 22:37:09,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:09,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2023-11-06 22:37:09,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:09,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587307420] [2023-11-06 22:37:09,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:09,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:09,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:09,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:09,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:09,886 INFO L85 PathProgramCache]: Analyzing trace with hash -481826528, now seen corresponding path program 1 times [2023-11-06 22:37:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:09,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872435940] [2023-11-06 22:37:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:09,898 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:09,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269072781] [2023-11-06 22:37:09,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:09,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:09,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:09,902 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:09,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:37:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:09,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:10,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:10,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1147386361, now seen corresponding path program 1 times [2023-11-06 22:37:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:10,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716272976] [2023-11-06 22:37:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:10,031 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:10,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [329856680] [2023-11-06 22:37:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:10,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:10,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,035 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:37:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:10,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:10,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:10,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-11-06 22:37:10,561 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:10,561 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:10,561 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:10,561 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:10,562 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:37:10,562 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,562 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:10,562 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:10,562 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-11-06 22:37:10,562 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:10,562 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:10,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:10,668 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:10,668 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:37:10,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,673 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:10,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:10,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-06 22:37:10,717 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:10,717 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:10,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:10,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,726 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-06 22:37:10,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:10,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:10,746 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:10,747 INFO L440 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: [] [2023-11-06 22:37:10,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:10,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,755 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-06 22:37:10,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:10,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:10,780 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:10,780 INFO L440 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: [] [2023-11-06 22:37:10,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:10,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,801 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,814 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:10,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:10,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-06 22:37:10,827 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:10,827 INFO L440 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: [] [2023-11-06 22:37:10,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:10,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,832 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-06 22:37:10,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:10,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:10,849 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:10,849 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:10,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:10,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,854 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-06 22:37:10,856 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:10,857 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:10,870 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:10,870 INFO L440 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: [] [2023-11-06 22:37:10,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:10,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,874 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-06 22:37:10,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:10,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:10,890 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:10,890 INFO L440 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: [] [2023-11-06 22:37:10,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-06 22:37:10,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,897 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-06 22:37:10,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:10,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:10,912 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:10,912 INFO L440 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: [] [2023-11-06 22:37:10,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:10,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,919 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-06 22:37:10,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:10,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:10,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:10,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:10,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,942 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-06 22:37:10,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:37:10,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:11,013 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:37:11,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:11,018 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:11,018 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:11,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:11,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:11,018 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:37:11,019 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,019 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:11,019 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:11,019 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-11-06 22:37:11,019 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:11,019 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:11,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:11,129 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:11,129 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:37:11,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,132 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,141 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 [2023-11-06 22:37:11,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:11,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:11,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:11,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:11,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:11,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:11,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:11,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-06 22:37:11,172 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:11,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:11,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,182 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,190 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 [2023-11-06 22:37:11,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:11,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:11,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:11,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:11,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:11,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:11,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:11,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-06 22:37:11,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:11,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:11,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,231 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:37:11,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:11,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:11,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:11,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:11,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:11,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:11,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:11,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-06 22:37:11,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:11,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:11,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,260 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,265 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 [2023-11-06 22:37:11,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:11,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:11,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:11,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:11,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:11,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-06 22:37:11,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:11,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:11,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:11,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:11,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,315 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-06 22:37:11,318 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 [2023-11-06 22:37:11,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:11,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:11,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:11,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:11,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:11,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:11,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:11,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:11,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:11,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,355 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-06 22:37:11,357 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 [2023-11-06 22:37:11,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:11,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:11,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:11,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:11,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:11,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:11,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:11,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:11,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:11,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,376 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-06 22:37:11,379 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 [2023-11-06 22:37:11,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:11,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:11,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:11,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:11,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:11,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:11,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:11,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:11,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-11-06 22:37:11,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,404 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,407 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 [2023-11-06 22:37:11,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-06 22:37:11,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:11,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:11,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:11,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:11,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:11,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:11,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:11,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:11,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:11,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,424 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,433 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 [2023-11-06 22:37:11,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-06 22:37:11,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:11,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:11,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:11,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:11,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:11,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:11,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:11,451 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:37:11,454 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-11-06 22:37:11,455 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-06 22:37:11,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:11,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,464 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,466 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:37:11,466 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:37:11,466 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:37:11,466 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 1 Supporting invariants [] [2023-11-06 22:37:11,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-06 22:37:11,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:11,471 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:37:11,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:11,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:37:11,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:11,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:37:11,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:37:11,739 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 [2023-11-06 22:37:11,739 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) [2023-11-06 22:37:12,086 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. [2023-11-06 22:37:12,087 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 [2023-11-06 22:37:12,088 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) [2023-11-06 22:37:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2023-11-06 22:37:12,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 24 letters. [2023-11-06 22:37:12,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:12,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 28 letters. Loop has 24 letters. [2023-11-06 22:37:12,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:12,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 48 letters. [2023-11-06 22:37:12,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:12,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 178 transitions. [2023-11-06 22:37:12,097 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2023-11-06 22:37:12,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 117 states and 176 transitions. [2023-11-06 22:37:12,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-11-06 22:37:12,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2023-11-06 22:37:12,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 176 transitions. [2023-11-06 22:37:12,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:12,104 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 176 transitions. [2023-11-06 22:37:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 176 transitions. [2023-11-06 22:37:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2023-11-06 22:37:12,120 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) [2023-11-06 22:37:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2023-11-06 22:37:12,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 167 transitions. [2023-11-06 22:37:12,123 INFO L428 stractBuchiCegarLoop]: Abstraction has 112 states and 167 transitions. [2023-11-06 22:37:12,123 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-06 22:37:12,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 167 transitions. [2023-11-06 22:37:12,126 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2023-11-06 22:37:12,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:12,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:12,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-06 22:37:12,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:12,133 INFO L748 eck$LassoCheckResult]: Stem: 716#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 680#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 681#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; 699#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; 717#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 690#L42-3 [2023-11-06 22:37:12,133 INFO L750 eck$LassoCheckResult]: Loop: 690#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 702#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; 704#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 731#$Ultimate##0 ~n := #in~n; 739#L25 assume !(~n <= 0); 737#L26 call #t~ret0 := fact(~n - 1);< 687#$Ultimate##0 ~n := #in~n; 742#L25 assume ~n <= 0;#res := 1; 741#factFINAL assume true; 735#factEXIT >#70#return; 734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 733#factFINAL assume true; 726#factEXIT >#78#return; 730#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 731#$Ultimate##0 ~n := #in~n; 739#L25 assume !(~n <= 0); 737#L26 call #t~ret0 := fact(~n - 1);< 687#$Ultimate##0 ~n := #in~n; 742#L25 assume ~n <= 0;#res := 1; 741#factFINAL assume true; 735#factEXIT >#70#return; 734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 733#factFINAL assume true; 726#factEXIT >#80#return; 728#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 731#$Ultimate##0 ~n := #in~n; 739#L25 assume !(~n <= 0); 737#L26 call #t~ret0 := fact(~n - 1);< 687#$Ultimate##0 ~n := #in~n; 742#L25 assume ~n <= 0;#res := 1; 741#factFINAL assume true; 735#factEXIT >#70#return; 734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 733#factFINAL assume true; 726#factEXIT >#82#return; 724#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; 722#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 721#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 720#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 718#L42-4 havoc main_~k~0#1; 696#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 689#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 690#L42-3 [2023-11-06 22:37:12,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:12,135 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2023-11-06 22:37:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:12,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960927458] [2023-11-06 22:37:12,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:12,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:12,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:12,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:12,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1950250366, now seen corresponding path program 1 times [2023-11-06 22:37:12,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:12,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770558982] [2023-11-06 22:37:12,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:12,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:12,165 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [355402832] [2023-11-06 22:37:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:12,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:12,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:12,173 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:12,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-11-06 22:37:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:12,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:37:12,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:12,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-11-06 22:37:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 39 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:37:12,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:37:12,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:12,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770558982] [2023-11-06 22:37:12,635 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:12,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355402832] [2023-11-06 22:37:12,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355402832] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:12,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:12,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2023-11-06 22:37:12,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834659434] [2023-11-06 22:37:12,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:12,639 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:12,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:12,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:37:12,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:37:12,640 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. cyclomatic complexity: 60 Second operand has 13 states, 10 states have (on average 3.6) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-06 22:37:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:12,921 INFO L93 Difference]: Finished difference Result 194 states and 301 transitions. [2023-11-06 22:37:12,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 301 transitions. [2023-11-06 22:37:12,927 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 55 [2023-11-06 22:37:12,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 301 transitions. [2023-11-06 22:37:12,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2023-11-06 22:37:12,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2023-11-06 22:37:12,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 301 transitions. [2023-11-06 22:37:12,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:12,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 301 transitions. [2023-11-06 22:37:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 301 transitions. [2023-11-06 22:37:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 148. [2023-11-06 22:37:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.153061224489796) internal successors, (113), 95 states have internal predecessors, (113), 34 states have call successors, (34), 14 states have call predecessors, (34), 16 states have return successors, (84), 38 states have call predecessors, (84), 34 states have call successors, (84) [2023-11-06 22:37:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 231 transitions. [2023-11-06 22:37:12,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 148 states and 231 transitions. [2023-11-06 22:37:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:37:12,959 INFO L428 stractBuchiCegarLoop]: Abstraction has 148 states and 231 transitions. [2023-11-06 22:37:12,960 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-06 22:37:12,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 231 transitions. [2023-11-06 22:37:12,962 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-11-06 22:37:12,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:12,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:12,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-06 22:37:12,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:12,964 INFO L748 eck$LassoCheckResult]: Stem: 1299#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1259#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 1260#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; 1278#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; 1300#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1268#L42-3 [2023-11-06 22:37:12,964 INFO L750 eck$LassoCheckResult]: Loop: 1268#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1281#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; 1251#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1232#$Ultimate##0 ~n := #in~n; 1364#L25 assume !(~n <= 0); 1237#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume !(~n <= 0); 1238#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume ~n <= 0;#res := 1; 1334#factFINAL assume true; 1332#factEXIT >#70#return; 1241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1253#factFINAL assume true; 1235#factEXIT >#70#return; 1240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1342#factFINAL assume true; 1338#factEXIT >#72#return; 1291#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1232#$Ultimate##0 ~n := #in~n; 1364#L25 assume !(~n <= 0); 1237#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume !(~n <= 0); 1238#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume ~n <= 0;#res := 1; 1334#factFINAL assume true; 1332#factEXIT >#70#return; 1241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1253#factFINAL assume true; 1235#factEXIT >#70#return; 1240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1342#factFINAL assume true; 1338#factEXIT >#74#return; 1249#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1232#$Ultimate##0 ~n := #in~n; 1364#L25 assume !(~n <= 0); 1237#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume !(~n <= 0); 1238#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume ~n <= 0;#res := 1; 1334#factFINAL assume true; 1332#factEXIT >#70#return; 1241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1253#factFINAL assume true; 1235#factEXIT >#70#return; 1240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1342#factFINAL assume true; 1338#factEXIT >#76#return; 1271#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; 1272#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 1279#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1304#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1302#L42-4 havoc main_~k~0#1; 1275#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1267#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1268#L42-3 [2023-11-06 22:37:12,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2023-11-06 22:37:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:12,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809484932] [2023-11-06 22:37:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:12,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:12,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:12,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash -822334974, now seen corresponding path program 1 times [2023-11-06 22:37:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:12,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679534805] [2023-11-06 22:37:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:12,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:12,984 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:12,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446171748] [2023-11-06 22:37:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:12,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:12,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:12,986 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:13,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-11-06 22:37:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:13,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:37:13,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 16 proven. 103 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-06 22:37:13,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 16 proven. 109 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-06 22:37:13,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:13,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679534805] [2023-11-06 22:37:13,735 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:13,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446171748] [2023-11-06 22:37:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446171748] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:13,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:13,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2023-11-06 22:37:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518794154] [2023-11-06 22:37:13,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:13,736 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:13,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:13,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:37:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:37:13,738 INFO L87 Difference]: Start difference. First operand 148 states and 231 transitions. cyclomatic complexity: 88 Second operand has 17 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (13), 9 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-06 22:37:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:14,206 INFO L93 Difference]: Finished difference Result 252 states and 423 transitions. [2023-11-06 22:37:14,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 423 transitions. [2023-11-06 22:37:14,212 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 65 [2023-11-06 22:37:14,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 240 states and 407 transitions. [2023-11-06 22:37:14,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2023-11-06 22:37:14,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2023-11-06 22:37:14,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 407 transitions. [2023-11-06 22:37:14,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:14,220 INFO L218 hiAutomatonCegarLoop]: Abstraction has 240 states and 407 transitions. [2023-11-06 22:37:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 407 transitions. [2023-11-06 22:37:14,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 178. [2023-11-06 22:37:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 107 states have internal predecessors, (125), 46 states have call successors, (46), 14 states have call predecessors, (46), 22 states have return successors, (142), 56 states have call predecessors, (142), 46 states have call successors, (142) [2023-11-06 22:37:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 313 transitions. [2023-11-06 22:37:14,245 INFO L240 hiAutomatonCegarLoop]: Abstraction has 178 states and 313 transitions. [2023-11-06 22:37:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:37:14,246 INFO L428 stractBuchiCegarLoop]: Abstraction has 178 states and 313 transitions. [2023-11-06 22:37:14,246 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-06 22:37:14,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 313 transitions. [2023-11-06 22:37:14,249 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2023-11-06 22:37:14,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:14,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:14,250 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-06 22:37:14,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:14,251 INFO L748 eck$LassoCheckResult]: Stem: 2098#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2048#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 2049#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; 2065#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; 2099#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2057#L42-3 [2023-11-06 22:37:14,251 INFO L750 eck$LassoCheckResult]: Loop: 2057#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2085#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; 2019#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2020#$Ultimate##0 ~n := #in~n; 2196#L25 assume !(~n <= 0); 2053#L26 call #t~ret0 := fact(~n - 1);< 2054#$Ultimate##0 ~n := #in~n; 2137#L25 assume ~n <= 0;#res := 1; 2132#factFINAL assume true; 2127#factEXIT >#70#return; 2128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2046#factFINAL assume true; 2023#factEXIT >#78#return; 2032#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2042#$Ultimate##0 ~n := #in~n; 2092#L25 assume ~n <= 0;#res := 1; 2131#factFINAL assume true; 2123#factEXIT >#80#return; 2029#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2100#$Ultimate##0 ~n := #in~n; 2087#L25 assume !(~n <= 0); 2053#L26 call #t~ret0 := fact(~n - 1);< 2054#$Ultimate##0 ~n := #in~n; 2137#L25 assume !(~n <= 0); 2075#L26 call #t~ret0 := fact(~n - 1);< 2054#$Ultimate##0 ~n := #in~n; 2137#L25 assume !(~n <= 0); 2075#L26 call #t~ret0 := fact(~n - 1);< 2054#$Ultimate##0 ~n := #in~n; 2137#L25 assume ~n <= 0;#res := 1; 2132#factFINAL assume true; 2127#factEXIT >#70#return; 2129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2142#factFINAL assume true; 2140#factEXIT >#70#return; 2074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077#factFINAL assume true; 2145#factEXIT >#70#return; 2146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2149#factFINAL assume true; 2147#factEXIT >#82#return; 2033#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; 2050#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 2066#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2105#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 2103#L42-4 havoc main_~k~0#1; 2063#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 2056#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2057#L42-3 [2023-11-06 22:37:14,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2023-11-06 22:37:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374734118] [2023-11-06 22:37:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:14,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:14,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:14,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1102369410, now seen corresponding path program 2 times [2023-11-06 22:37:14,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:14,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222155742] [2023-11-06 22:37:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:14,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:14,272 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470212117] [2023-11-06 22:37:14,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:14,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:14,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:14,284 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:14,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-11-06 22:37:14,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:14,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:14,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:14,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:14,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash -694339919, now seen corresponding path program 1 times [2023-11-06 22:37:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:14,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153947823] [2023-11-06 22:37:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:14,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:14,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:14,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153947823] [2023-11-06 22:37:14,404 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-06 22:37:14,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852709008] [2023-11-06 22:37:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:14,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:14,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:14,416 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:14,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-11-06 22:37:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:14,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:37:14,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-06 22:37:14,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:37:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852709008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:14,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:37:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637633591] [2023-11-06 22:37:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:15,031 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:15,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:15,032 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:15,032 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:15,032 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:37:15,032 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,032 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:15,032 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:15,032 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2023-11-06 22:37:15,032 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:15,033 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:15,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,157 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:15,157 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:37:15,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,164 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:15,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:15,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-06 22:37:15,199 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:15,199 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:15,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,206 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:15,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:15,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-06 22:37:15,235 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:15,235 INFO L440 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: [] [2023-11-06 22:37:15,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,243 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:15,250 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:15,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-11-06 22:37:15,273 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:15,273 INFO L440 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: [] [2023-11-06 22:37:15,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,283 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:15,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:15,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-06 22:37:15,319 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:15,319 INFO L440 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: [] [2023-11-06 22:37:15,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,329 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:15,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:15,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-06 22:37:15,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-11-06 22:37:15,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,373 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-06 22:37:15,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:37:15,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:15,405 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:37:15,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-11-06 22:37:15,408 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:15,408 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:15,408 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:15,408 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:15,408 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:37:15,408 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,408 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:15,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:15,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2023-11-06 22:37:15,409 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:15,409 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:15,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:15,548 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:15,549 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:37:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,550 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,554 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 [2023-11-06 22:37:15,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:15,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:15,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:15,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:15,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:15,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:15,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:15,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-06 22:37:15,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:15,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,606 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,613 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 [2023-11-06 22:37:15,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:15,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:15,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:15,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:15,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:15,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:15,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:15,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-06 22:37:15,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:15,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,657 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,665 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 [2023-11-06 22:37:15,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:15,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:15,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:15,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:15,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:15,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:15,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:15,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-06 22:37:15,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:15,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,693 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,698 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 [2023-11-06 22:37:15,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:15,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:15,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:15,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:15,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:15,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:15,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:15,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-06 22:37:15,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:15,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,735 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,738 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 [2023-11-06 22:37:15,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:15,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:15,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:15,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:15,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:15,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:15,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:15,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-06 22:37:15,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:15,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,782 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-11-06 22:37:15,785 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 [2023-11-06 22:37:15,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:15,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:15,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:15,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:15,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:15,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:15,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:15,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:15,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,820 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-11-06 22:37:15,824 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 [2023-11-06 22:37:15,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:15,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:15,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:15,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:15,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:15,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:15,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:15,837 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:37:15,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:37:15,841 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-06 22:37:15,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:15,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:15,842 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:15,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-11-06 22:37:15,845 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:37:15,845 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:37:15,845 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:37:15,845 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2023-11-06 22:37:15,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:15,848 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:37:15,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:15,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:37:15,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:15,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 22:37:15,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-06 22:37:16,132 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 [2023-11-06 22:37:16,132 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 178 states and 313 transitions. cyclomatic complexity: 140 Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 22:37:16,600 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 178 states and 313 transitions. cyclomatic complexity: 140. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Result 995 states and 1573 transitions. Complement of second has 49 states. [2023-11-06 22:37:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 22:37:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2023-11-06 22:37:16,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 5 letters. Loop has 48 letters. [2023-11-06 22:37:16,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:16,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 53 letters. Loop has 48 letters. [2023-11-06 22:37:16,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:16,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 5 letters. Loop has 96 letters. [2023-11-06 22:37:16,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:16,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 995 states and 1573 transitions. [2023-11-06 22:37:16,635 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 81 [2023-11-06 22:37:16,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 995 states to 699 states and 1106 transitions. [2023-11-06 22:37:16,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2023-11-06 22:37:16,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2023-11-06 22:37:16,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 699 states and 1106 transitions. [2023-11-06 22:37:16,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:16,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 699 states and 1106 transitions. [2023-11-06 22:37:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states and 1106 transitions. [2023-11-06 22:37:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 612. [2023-11-06 22:37:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 370 states have (on average 1.127027027027027) internal successors, (417), 374 states have internal predecessors, (417), 145 states have call successors, (145), 58 states have call predecessors, (145), 97 states have return successors, (420), 179 states have call predecessors, (420), 145 states have call successors, (420) [2023-11-06 22:37:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 982 transitions. [2023-11-06 22:37:16,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 612 states and 982 transitions. [2023-11-06 22:37:16,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:16,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:37:16,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:37:16,741 INFO L87 Difference]: Start difference. First operand 612 states and 982 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:37:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:16,834 INFO L93 Difference]: Finished difference Result 310 states and 549 transitions. [2023-11-06 22:37:16,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 549 transitions. [2023-11-06 22:37:16,840 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 53 [2023-11-06 22:37:16,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 308 states and 547 transitions. [2023-11-06 22:37:16,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2023-11-06 22:37:16,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2023-11-06 22:37:16,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 547 transitions. [2023-11-06 22:37:16,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:16,848 INFO L218 hiAutomatonCegarLoop]: Abstraction has 308 states and 547 transitions. [2023-11-06 22:37:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 547 transitions. [2023-11-06 22:37:16,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 280. [2023-11-06 22:37:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 170 states have (on average 1.1235294117647059) internal successors, (191), 171 states have internal predecessors, (191), 68 states have call successors, (68), 24 states have call predecessors, (68), 42 states have return successors, (208), 84 states have call predecessors, (208), 68 states have call successors, (208) [2023-11-06 22:37:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 467 transitions. [2023-11-06 22:37:16,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 280 states and 467 transitions. [2023-11-06 22:37:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:37:16,873 INFO L428 stractBuchiCegarLoop]: Abstraction has 280 states and 467 transitions. [2023-11-06 22:37:16,873 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-06 22:37:16,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 280 states and 467 transitions. [2023-11-06 22:37:16,876 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2023-11-06 22:37:16,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:16,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:16,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:16,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-06 22:37:16,877 INFO L748 eck$LassoCheckResult]: Stem: 4595#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4548#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 4549#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; 4567#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; 4596#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4640#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4638#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; 4538#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4539#$Ultimate##0 ~n := #in~n; 4703#L25 assume !(~n <= 0); 4521#L26 call #t~ret0 := fact(~n - 1);< 4555#$Ultimate##0 [2023-11-06 22:37:16,877 INFO L750 eck$LassoCheckResult]: Loop: 4555#$Ultimate##0 ~n := #in~n; 4706#L25 assume !(~n <= 0); 4522#L26 call #t~ret0 := fact(~n - 1);< 4555#$Ultimate##0 [2023-11-06 22:37:16,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash 271742545, now seen corresponding path program 1 times [2023-11-06 22:37:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974908888] [2023-11-06 22:37:16,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:16,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:17,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974908888] [2023-11-06 22:37:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974908888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:17,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:17,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:37:17,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118556577] [2023-11-06 22:37:17,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:17,028 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:37:17,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:17,028 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2023-11-06 22:37:17,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:17,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464109129] [2023-11-06 22:37:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:17,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:17,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:17,070 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:17,070 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:17,076 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:17,077 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:17,077 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:37:17,077 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:17,077 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:17,077 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:17,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2023-11-06 22:37:17,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:17,078 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:17,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:17,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:17,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:17,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:17,116 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:17,116 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:37:17,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:17,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:17,121 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:17,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:17,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:17,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-11-06 22:37:17,152 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:17,152 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:17,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:17,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:17,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:17,157 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:17,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:17,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:17,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-11-06 22:37:17,201 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:17,201 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:17,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:17,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:17,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:17,206 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:17,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:17,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:17,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-11-06 22:37:17,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:17,237 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:17,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:37:17,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:17,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-11-06 22:37:17,308 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:37:17,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2023-11-06 22:37:17,311 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:17,311 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:17,311 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:17,311 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:17,311 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:37:17,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:17,312 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:17,312 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:17,312 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2023-11-06 22:37:17,312 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:17,312 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:17,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:17,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:17,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:17,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:17,354 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:17,354 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:37:17,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:17,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:17,356 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:17,365 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 [2023-11-06 22:37:17,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:17,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:17,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:17,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:17,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:17,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:17,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:17,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-11-06 22:37:17,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:17,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:17,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:17,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:17,397 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:17,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:37:17,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-11-06 22:37:17,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:17,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:17,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:17,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:17,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:17,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:17,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:17,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:17,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:17,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:17,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:17,432 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:17,441 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 [2023-11-06 22:37:17,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:17,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:17,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:17,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:17,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:17,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-11-06 22:37:17,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:17,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:17,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:37:17,480 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:37:17,480 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-06 22:37:17,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:17,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:17,481 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:17,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:37:17,485 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:37:17,485 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:37:17,485 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-11-06 22:37:17,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-11-06 22:37:17,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:17,489 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:37:17,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:17,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:37:17,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:17,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:37:17,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:17,587 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 [2023-11-06 22:37:17,587 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 280 states and 467 transitions. cyclomatic complexity: 194 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) [2023-11-06 22:37:17,646 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 280 states and 467 transitions. cyclomatic complexity: 194. 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 433 states and 726 transitions. Complement of second has 13 states. [2023-11-06 22:37:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:17,649 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) [2023-11-06 22:37:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2023-11-06 22:37:17,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 11 letters. Loop has 3 letters. [2023-11-06 22:37:17,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:17,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 14 letters. Loop has 3 letters. [2023-11-06 22:37:17,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:17,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-06 22:37:17,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:17,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 726 transitions. [2023-11-06 22:37:17,662 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 53 [2023-11-06 22:37:17,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 409 states and 702 transitions. [2023-11-06 22:37:17,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2023-11-06 22:37:17,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2023-11-06 22:37:17,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 702 transitions. [2023-11-06 22:37:17,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:17,671 INFO L218 hiAutomatonCegarLoop]: Abstraction has 409 states and 702 transitions. [2023-11-06 22:37:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 702 transitions. [2023-11-06 22:37:17,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 401. [2023-11-06 22:37:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 247 states have (on average 1.165991902834008) internal successors, (288), 260 states have internal predecessors, (288), 96 states have call successors, (96), 44 states have call predecessors, (96), 58 states have return successors, (298), 96 states have call predecessors, (298), 96 states have call successors, (298) [2023-11-06 22:37:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 682 transitions. [2023-11-06 22:37:17,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 401 states and 682 transitions. [2023-11-06 22:37:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:17,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:37:17,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:37:17,700 INFO L87 Difference]: Start difference. First operand 401 states and 682 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) [2023-11-06 22:37:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:17,775 INFO L93 Difference]: Finished difference Result 433 states and 758 transitions. [2023-11-06 22:37:17,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 758 transitions. [2023-11-06 22:37:17,789 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 77 [2023-11-06 22:37:17,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 433 states and 758 transitions. [2023-11-06 22:37:17,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2023-11-06 22:37:17,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2023-11-06 22:37:17,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 758 transitions. [2023-11-06 22:37:17,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:17,798 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 758 transitions. [2023-11-06 22:37:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 758 transitions. [2023-11-06 22:37:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 423. [2023-11-06 22:37:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 257 states have (on average 1.1673151750972763) internal successors, (300), 270 states have internal predecessors, (300), 114 states have call successors, (114), 44 states have call predecessors, (114), 52 states have return successors, (328), 108 states have call predecessors, (328), 114 states have call successors, (328) [2023-11-06 22:37:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 742 transitions. [2023-11-06 22:37:17,820 INFO L240 hiAutomatonCegarLoop]: Abstraction has 423 states and 742 transitions. [2023-11-06 22:37:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:37:17,821 INFO L428 stractBuchiCegarLoop]: Abstraction has 423 states and 742 transitions. [2023-11-06 22:37:17,822 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-06 22:37:17,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 423 states and 742 transitions. [2023-11-06 22:37:17,826 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 77 [2023-11-06 22:37:17,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:17,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:17,830 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] [2023-11-06 22:37:17,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-06 22:37:17,831 INFO L748 eck$LassoCheckResult]: Stem: 6220#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 6167#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 6168#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; 6188#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; 6176#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 6177#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6193#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; 6194#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 6451#$Ultimate##0 ~n := #in~n; 6455#L25 assume ~n <= 0;#res := 1; 6454#factFINAL assume true; 6450#factEXIT >#72#return; 6447#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 6449#$Ultimate##0 ~n := #in~n; 6453#L25 assume !(~n <= 0); 6162#L26 call #t~ret0 := fact(~n - 1);< 6550#$Ultimate##0 ~n := #in~n; 6203#L25 assume ~n <= 0;#res := 1; 6204#factFINAL assume true; 6549#factEXIT >#70#return; 6548#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6547#factFINAL assume true; 6545#factEXIT >#74#return; 6542#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 6544#$Ultimate##0 ~n := #in~n; 6562#L25 assume !(~n <= 0); 6164#L26 call #t~ret0 := fact(~n - 1);< 6173#$Ultimate##0 [2023-11-06 22:37:17,832 INFO L750 eck$LassoCheckResult]: Loop: 6173#$Ultimate##0 ~n := #in~n; 6557#L25 assume !(~n <= 0); 6163#L26 call #t~ret0 := fact(~n - 1);< 6173#$Ultimate##0 [2023-11-06 22:37:17,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:17,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1844396785, now seen corresponding path program 1 times [2023-11-06 22:37:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300881417] [2023-11-06 22:37:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:17,851 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:17,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147615587] [2023-11-06 22:37:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:17,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:17,853 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:17,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2023-11-06 22:37:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:17,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:37:17,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:37:17,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:37:18,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300881417] [2023-11-06 22:37:18,017 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147615587] [2023-11-06 22:37:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147615587] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:18,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:18,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-11-06 22:37:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204497134] [2023-11-06 22:37:18,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:18,018 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:37:18,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 2 times [2023-11-06 22:37:18,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:18,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507633911] [2023-11-06 22:37:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:18,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:18,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:18,052 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:18,052 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:18,052 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:18,052 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:18,052 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:37:18,052 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,052 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:18,052 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:18,052 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration8_Loop [2023-11-06 22:37:18,053 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:18,053 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:18,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:18,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:18,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:18,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:18,083 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:18,083 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:37:18,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:18,084 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:18,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-11-06 22:37:18,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:18,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:18,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:18,099 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:18,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:18,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:18,104 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:18,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-11-06 22:37:18,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:18,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:18,119 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:18,119 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:18,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:18,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:18,123 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:18,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-11-06 22:37:18,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:18,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:18,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2023-11-06 22:37:18,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:18,144 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:18,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-11-06 22:37:18,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:37:18,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:18,213 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:37:18,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:18,217 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:18,217 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:18,217 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:18,217 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:18,217 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:37:18,217 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,217 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:18,217 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:18,217 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration8_Loop [2023-11-06 22:37:18,217 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:18,217 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:18,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:18,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:18,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:18,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:18,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:18,265 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:18,265 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:37:18,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:18,267 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:18,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-11-06 22:37:18,269 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 [2023-11-06 22:37:18,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:18,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:18,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:18,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:18,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:18,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:18,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:18,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:18,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2023-11-06 22:37:18,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:18,285 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:18,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-11-06 22:37:18,288 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 [2023-11-06 22:37:18,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:18,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:18,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:18,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:18,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:18,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:18,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:18,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:18,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:18,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:18,305 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:18,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-11-06 22:37:18,310 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 [2023-11-06 22:37:18,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:18,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:18,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:18,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:18,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:18,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:18,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:18,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:18,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2023-11-06 22:37:18,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:18,330 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:18,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-11-06 22:37:18,332 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 [2023-11-06 22:37:18,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:18,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:18,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:18,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:18,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:18,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:18,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:18,346 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:37:18,348 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-11-06 22:37:18,348 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:37:18,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:18,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:18,349 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:18,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-11-06 22:37:18,352 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:37:18,352 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:37:18,352 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:37:18,352 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-11-06 22:37:18,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:18,364 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:37:18,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:18,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:37:18,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:18,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:37:18,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:18,636 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 [2023-11-06 22:37:18,637 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336 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) [2023-11-06 22:37:18,752 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336. 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 471 states and 800 transitions. Complement of second has 13 states. [2023-11-06 22:37:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:18,754 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) [2023-11-06 22:37:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2023-11-06 22:37:18,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 27 letters. Loop has 3 letters. [2023-11-06 22:37:18,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:18,754 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-06 22:37:18,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:18,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:37:18,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:18,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:37:18,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:18,987 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 [2023-11-06 22:37:18,987 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336 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) [2023-11-06 22:37:19,081 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336. 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 471 states and 800 transitions. Complement of second has 13 states. [2023-11-06 22:37:19,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:19,083 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) [2023-11-06 22:37:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2023-11-06 22:37:19,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 27 letters. Loop has 3 letters. [2023-11-06 22:37:19,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:19,083 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-06 22:37:19,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:19,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:37:19,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:19,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:37:19,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:19,318 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 [2023-11-06 22:37:19,319 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336 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) [2023-11-06 22:37:19,431 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336. 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 547 states and 886 transitions. Complement of second has 16 states. [2023-11-06 22:37:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:19,433 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) [2023-11-06 22:37:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2023-11-06 22:37:19,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 27 letters. Loop has 3 letters. [2023-11-06 22:37:19,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:19,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 30 letters. Loop has 3 letters. [2023-11-06 22:37:19,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:19,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 27 letters. Loop has 6 letters. [2023-11-06 22:37:19,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:19,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 547 states and 886 transitions. [2023-11-06 22:37:19,445 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 71 [2023-11-06 22:37:19,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 547 states to 459 states and 798 transitions. [2023-11-06 22:37:19,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2023-11-06 22:37:19,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2023-11-06 22:37:19,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 798 transitions. [2023-11-06 22:37:19,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:19,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 459 states and 798 transitions. [2023-11-06 22:37:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 798 transitions. [2023-11-06 22:37:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 389. [2023-11-06 22:37:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 241 states have (on average 1.161825726141079) internal successors, (280), 246 states have internal predecessors, (280), 100 states have call successors, (100), 38 states have call predecessors, (100), 48 states have return successors, (290), 104 states have call predecessors, (290), 100 states have call successors, (290) [2023-11-06 22:37:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 670 transitions. [2023-11-06 22:37:19,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 389 states and 670 transitions. [2023-11-06 22:37:19,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:19,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:37:19,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:37:19,483 INFO L87 Difference]: Start difference. First operand 389 states and 670 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:37:19,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:19,626 INFO L93 Difference]: Finished difference Result 419 states and 728 transitions. [2023-11-06 22:37:19,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 728 transitions. [2023-11-06 22:37:19,634 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2023-11-06 22:37:19,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 419 states and 728 transitions. [2023-11-06 22:37:19,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2023-11-06 22:37:19,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2023-11-06 22:37:19,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 728 transitions. [2023-11-06 22:37:19,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:19,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 419 states and 728 transitions. [2023-11-06 22:37:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 728 transitions. [2023-11-06 22:37:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 375. [2023-11-06 22:37:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 227 states have (on average 1.1629955947136563) internal successors, (264), 236 states have internal predecessors, (264), 104 states have call successors, (104), 34 states have call predecessors, (104), 44 states have return successors, (290), 104 states have call predecessors, (290), 104 states have call successors, (290) [2023-11-06 22:37:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 658 transitions. [2023-11-06 22:37:19,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 375 states and 658 transitions. [2023-11-06 22:37:19,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:37:19,670 INFO L428 stractBuchiCegarLoop]: Abstraction has 375 states and 658 transitions. [2023-11-06 22:37:19,670 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-06 22:37:19,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 658 transitions. [2023-11-06 22:37:19,675 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 73 [2023-11-06 22:37:19,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:19,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:19,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:19,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:19,679 INFO L748 eck$LassoCheckResult]: Stem: 9448#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 9395#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 9396#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; 9418#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; 9406#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9408#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9423#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; 9424#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9728#$Ultimate##0 ~n := #in~n; 9733#L25 assume ~n <= 0;#res := 1; 9731#factFINAL assume true; 9727#factEXIT >#72#return; 9725#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9388#$Ultimate##0 ~n := #in~n; 9730#L25 assume ~n <= 0;#res := 1; 9726#factFINAL assume true; 9724#factEXIT >#74#return; 9387#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9388#$Ultimate##0 ~n := #in~n; 9730#L25 assume ~n <= 0;#res := 1; 9726#factFINAL assume true; 9724#factEXIT >#76#return; 9413#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; 9414#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 9719#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9506#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 9505#L42-4 havoc main_~k~0#1; 9500#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 9497#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9495#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9488#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; 9464#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9486#$Ultimate##0 ~n := #in~n; 9682#L25 assume ~n <= 0;#res := 1; 9689#factFINAL assume true; 9688#factEXIT >#72#return; 9521#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9576#$Ultimate##0 ~n := #in~n; 9579#L25 assume ~n <= 0;#res := 1; 9575#factFINAL assume true; 9548#factEXIT >#74#return; 9522#L30-2 [2023-11-06 22:37:19,680 INFO L750 eck$LassoCheckResult]: Loop: 9522#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9576#$Ultimate##0 ~n := #in~n; 9579#L25 assume ~n <= 0;#res := 1; 9575#factFINAL assume true; 9548#factEXIT >#76#return; 9550#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; 9686#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 9603#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9596#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9580#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; 9519#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9576#$Ultimate##0 ~n := #in~n; 9579#L25 assume ~n <= 0;#res := 1; 9575#factFINAL assume true; 9548#factEXIT >#72#return; 9510#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9576#$Ultimate##0 ~n := #in~n; 9579#L25 assume ~n <= 0;#res := 1; 9575#factFINAL assume true; 9548#factEXIT >#74#return; 9522#L30-2 [2023-11-06 22:37:19,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1754504676, now seen corresponding path program 2 times [2023-11-06 22:37:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:19,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86876489] [2023-11-06 22:37:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:19,692 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:19,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337011111] [2023-11-06 22:37:19,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:19,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:19,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:19,694 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:19,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2023-11-06 22:37:19,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:19,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:19,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:37:19,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:37:19,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-06 22:37:19,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:19,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86876489] [2023-11-06 22:37:19,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337011111] [2023-11-06 22:37:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337011111] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:19,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:19,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-11-06 22:37:19,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193004628] [2023-11-06 22:37:19,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:19,908 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:37:19,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash 430618666, now seen corresponding path program 1 times [2023-11-06 22:37:19,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:19,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73861203] [2023-11-06 22:37:19,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:19,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:19,912 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:19,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357773033] [2023-11-06 22:37:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:19,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:19,919 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:19,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2023-11-06 22:37:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:19,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:19,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:20,283 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:20,284 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:20,284 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:20,284 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:20,284 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:37:20,284 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:20,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:20,284 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:20,284 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration9_Loop [2023-11-06 22:37:20,285 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:20,285 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:20,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:20,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:20,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:20,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:20,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:20,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:20,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:20,403 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:20,403 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:37:20,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:20,407 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:20,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:20,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:20,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-11-06 22:37:20,436 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:20,436 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:20,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2023-11-06 22:37:20,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:20,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:20,439 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:20,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-11-06 22:37:20,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:20,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:20,453 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:20,453 INFO L440 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: [] [2023-11-06 22:37:20,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2023-11-06 22:37:20,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:20,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:20,457 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:20,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-11-06 22:37:20,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:20,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:20,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:20,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:20,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:20,509 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:20,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-11-06 22:37:20,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:37:20,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:21,096 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:37:21,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2023-11-06 22:37:21,101 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:21,101 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:21,101 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:21,101 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:21,101 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:37:21,101 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:21,101 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:21,101 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:21,101 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration9_Loop [2023-11-06 22:37:21,101 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:21,102 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:21,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:21,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:21,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:21,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:21,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:21,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:21,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:21,242 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:21,242 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:37:21,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:21,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:21,243 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:21,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2023-11-06 22:37:21,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:37:21,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:21,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:21,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:21,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:21,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:21,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:21,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:21,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:21,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:21,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:21,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:21,263 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:21,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2023-11-06 22:37:21,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:37:21,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:21,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:21,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:21,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:21,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:21,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:21,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:21,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:21,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2023-11-06 22:37:21,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:21,281 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:21,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2023-11-06 22:37:21,283 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 [2023-11-06 22:37:21,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:21,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:21,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:21,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:21,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:21,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:21,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:21,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:21,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:21,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:21,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:21,300 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:21,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2023-11-06 22:37:21,302 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 [2023-11-06 22:37:21,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:21,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:21,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:21,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:21,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:21,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:21,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:21,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:37:21,325 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-11-06 22:37:21,326 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-11-06 22:37:21,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:21,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:21,327 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:21,329 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:37:21,329 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:37:21,329 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:37:21,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2023-11-06 22:37:21,330 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2023-11-06 22:37:21,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2023-11-06 22:37:21,333 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:37:21,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:21,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:37:21,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:21,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:21,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:37:21,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:37:21,741 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2023-11-06 22:37:21,742 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296 Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 22:37:21,970 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296. Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Result 871 states and 1264 transitions. Complement of second has 35 states. [2023-11-06 22:37:21,971 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 [2023-11-06 22:37:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 22:37:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2023-11-06 22:37:21,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 41 letters. Loop has 20 letters. [2023-11-06 22:37:21,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:21,973 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-06 22:37:21,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:22,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:37:22,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:22,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:37:22,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:37:22,401 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2023-11-06 22:37:22,401 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296 Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 22:37:22,682 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296. Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Result 877 states and 1260 transitions. Complement of second has 39 states. [2023-11-06 22:37:22,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 22:37:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2023-11-06 22:37:22,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 60 transitions. Stem has 41 letters. Loop has 20 letters. [2023-11-06 22:37:22,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:22,685 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-06 22:37:22,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:22,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:37:22,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:22,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:37:22,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:37:23,122 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2023-11-06 22:37:23,123 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296 Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 22:37:23,448 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296. Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Result 1367 states and 2046 transitions. Complement of second has 64 states. [2023-11-06 22:37:23,452 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 [2023-11-06 22:37:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 22:37:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2023-11-06 22:37:23,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 41 letters. Loop has 20 letters. [2023-11-06 22:37:23,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:23,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 61 letters. Loop has 20 letters. [2023-11-06 22:37:23,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:23,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 41 letters. Loop has 40 letters. [2023-11-06 22:37:23,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:23,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1367 states and 2046 transitions. [2023-11-06 22:37:23,477 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 57 [2023-11-06 22:37:23,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1367 states to 1223 states and 1872 transitions. [2023-11-06 22:37:23,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2023-11-06 22:37:23,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2023-11-06 22:37:23,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1223 states and 1872 transitions. [2023-11-06 22:37:23,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:23,496 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1223 states and 1872 transitions. [2023-11-06 22:37:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states and 1872 transitions. [2023-11-06 22:37:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 997. [2023-11-06 22:37:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 617 states have (on average 1.1474878444084278) internal successors, (708), 630 states have internal predecessors, (708), 234 states have call successors, (258), 118 states have call predecessors, (258), 146 states have return successors, (622), 248 states have call predecessors, (622), 234 states have call successors, (622) [2023-11-06 22:37:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1588 transitions. [2023-11-06 22:37:23,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 997 states and 1588 transitions. [2023-11-06 22:37:23,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:23,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:37:23,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:37:23,543 INFO L87 Difference]: Start difference. First operand 997 states and 1588 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:37:23,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:23,803 INFO L93 Difference]: Finished difference Result 1412 states and 2524 transitions. [2023-11-06 22:37:23,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1412 states and 2524 transitions. [2023-11-06 22:37:23,825 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 95 [2023-11-06 22:37:23,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1412 states to 1388 states and 2498 transitions. [2023-11-06 22:37:23,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2023-11-06 22:37:23,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2023-11-06 22:37:23,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1388 states and 2498 transitions. [2023-11-06 22:37:23,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:23,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1388 states and 2498 transitions. [2023-11-06 22:37:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states and 2498 transitions. [2023-11-06 22:37:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 940. [2023-11-06 22:37:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 586 states have (on average 1.1399317406143346) internal successors, (668), 593 states have internal predecessors, (668), 212 states have call successors, (230), 114 states have call predecessors, (230), 142 states have return successors, (552), 232 states have call predecessors, (552), 212 states have call successors, (552) [2023-11-06 22:37:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1450 transitions. [2023-11-06 22:37:23,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 940 states and 1450 transitions. [2023-11-06 22:37:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:37:23,926 INFO L428 stractBuchiCegarLoop]: Abstraction has 940 states and 1450 transitions. [2023-11-06 22:37:23,926 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-06 22:37:23,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 940 states and 1450 transitions. [2023-11-06 22:37:23,934 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2023-11-06 22:37:23,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:23,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:23,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:23,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:23,936 INFO L748 eck$LassoCheckResult]: Stem: 16357#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 16305#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 16306#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; 16327#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; 16316#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 16318#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16457#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; 16455#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16456#$Ultimate##0 ~n := #in~n; 16461#L25 assume ~n <= 0;#res := 1; 16458#factFINAL assume true; 16454#factEXIT >#72#return; 16447#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 16448#$Ultimate##0 ~n := #in~n; 16453#L25 assume ~n <= 0;#res := 1; 16452#factFINAL assume true; 16446#factEXIT >#74#return; 16287#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 16436#$Ultimate##0 ~n := #in~n; 16437#L25 assume !(~n <= 0); 16311#L26 call #t~ret0 := fact(~n - 1);< 16312#$Ultimate##0 ~n := #in~n; 16350#L25 assume ~n <= 0;#res := 1; 16775#factFINAL assume true; 16773#factEXIT >#70#return; 16336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16300#factFINAL assume true; 16286#factEXIT >#76#return; 16288#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; 16321#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 16329#L42-2 [2023-11-06 22:37:23,937 INFO L750 eck$LassoCheckResult]: Loop: 16329#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 16339#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16332#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; 16333#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16297#$Ultimate##0 ~n := #in~n; 16627#L25 assume !(~n <= 0); 16403#L26 call #t~ret0 := fact(~n - 1);< 16415#$Ultimate##0 ~n := #in~n; 16422#L25 assume !(~n <= 0); 16431#L26 call #t~ret0 := fact(~n - 1);< 16440#$Ultimate##0 ~n := #in~n; 16441#L25 assume ~n <= 0;#res := 1; 16480#factFINAL assume true; 16478#factEXIT >#70#return; 16479#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16438#factFINAL assume true; 16439#factEXIT >#70#return; 16486#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16623#factFINAL assume true; 16609#factEXIT >#78#return; 16612#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 16297#$Ultimate##0 ~n := #in~n; 16627#L25 assume !(~n <= 0); 16403#L26 call #t~ret0 := fact(~n - 1);< 16415#$Ultimate##0 ~n := #in~n; 16421#L25 assume ~n <= 0;#res := 1; 16416#factFINAL assume true; 16399#factEXIT >#70#return; 16411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16632#factFINAL assume true; 16630#factEXIT >#80#return; 16611#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 16283#$Ultimate##0 ~n := #in~n; 16626#L25 assume !(~n <= 0); 16403#L26 call #t~ret0 := fact(~n - 1);< 16415#$Ultimate##0 ~n := #in~n; 16422#L25 assume !(~n <= 0); 16431#L26 call #t~ret0 := fact(~n - 1);< 16440#$Ultimate##0 ~n := #in~n; 16441#L25 assume ~n <= 0;#res := 1; 16480#factFINAL assume true; 16478#factEXIT >#70#return; 16479#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16438#factFINAL assume true; 16439#factEXIT >#70#return; 16486#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16623#factFINAL assume true; 16609#factEXIT >#82#return; 16618#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; 16328#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 16329#L42-2 [2023-11-06 22:37:23,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:23,937 INFO L85 PathProgramCache]: Analyzing trace with hash 43708250, now seen corresponding path program 1 times [2023-11-06 22:37:23,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:23,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881986797] [2023-11-06 22:37:23,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:23,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:23,959 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484468883] [2023-11-06 22:37:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:23,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:23,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:23,961 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:23,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2023-11-06 22:37:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:24,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:37:24,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:37:24,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:37:24,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:24,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881986797] [2023-11-06 22:37:24,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484468883] [2023-11-06 22:37:24,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484468883] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:24,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:24,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-11-06 22:37:24,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144942767] [2023-11-06 22:37:24,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:24,223 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:37:24,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 62378044, now seen corresponding path program 1 times [2023-11-06 22:37:24,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:24,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084174873] [2023-11-06 22:37:24,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:24,239 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:24,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758552298] [2023-11-06 22:37:24,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:24,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:24,241 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:24,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2023-11-06 22:37:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:24,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:37:24,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-06 22:37:24,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 18 proven. 78 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 22:37:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084174873] [2023-11-06 22:37:24,940 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758552298] [2023-11-06 22:37:24,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758552298] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:24,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:24,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2023-11-06 22:37:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212156457] [2023-11-06 22:37:24,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:24,941 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:24,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:24,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:37:24,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:37:24,942 INFO L87 Difference]: Start difference. First operand 940 states and 1450 transitions. cyclomatic complexity: 531 Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:37:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:25,206 INFO L93 Difference]: Finished difference Result 1040 states and 1676 transitions. [2023-11-06 22:37:25,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1040 states and 1676 transitions. [2023-11-06 22:37:25,222 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 74 [2023-11-06 22:37:25,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1040 states to 972 states and 1596 transitions. [2023-11-06 22:37:25,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2023-11-06 22:37:25,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2023-11-06 22:37:25,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 972 states and 1596 transitions. [2023-11-06 22:37:25,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:25,240 INFO L218 hiAutomatonCegarLoop]: Abstraction has 972 states and 1596 transitions. [2023-11-06 22:37:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states and 1596 transitions. [2023-11-06 22:37:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 962. [2023-11-06 22:37:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 582 states have (on average 1.134020618556701) internal successors, (660), 581 states have internal predecessors, (660), 254 states have call successors, (274), 106 states have call predecessors, (274), 126 states have return successors, (652), 274 states have call predecessors, (652), 254 states have call successors, (652) [2023-11-06 22:37:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1586 transitions. [2023-11-06 22:37:25,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 962 states and 1586 transitions. [2023-11-06 22:37:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:37:25,292 INFO L428 stractBuchiCegarLoop]: Abstraction has 962 states and 1586 transitions. [2023-11-06 22:37:25,292 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-06 22:37:25,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 962 states and 1586 transitions. [2023-11-06 22:37:25,300 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 74 [2023-11-06 22:37:25,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:25,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:25,304 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:25,304 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:25,305 INFO L748 eck$LassoCheckResult]: Stem: 18847#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 18787#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 18788#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; 18811#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; 18799#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 18801#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18816#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; 18770#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18784#$Ultimate##0 ~n := #in~n; 18829#L25 assume ~n <= 0;#res := 1; 18779#factFINAL assume true; 18769#factEXIT >#72#return; 18771#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18833#$Ultimate##0 ~n := #in~n; 19208#L25 assume ~n <= 0;#res := 1; 19206#factFINAL assume true; 19201#factEXIT >#74#return; 19193#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19196#$Ultimate##0 ~n := #in~n; 19383#L25 assume ~n <= 0;#res := 1; 19382#factFINAL assume true; 19380#factEXIT >#76#return; 19378#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; 19377#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 19376#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 19375#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19374#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; 19084#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18849#$Ultimate##0 ~n := #in~n; 19184#L25 assume !(~n <= 0); 18890#L26 call #t~ret0 := fact(~n - 1);< 18902#$Ultimate##0 ~n := #in~n; 18912#L25 assume ~n <= 0;#res := 1; 18905#factFINAL assume true; 18886#factEXIT >#70#return; 18898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19182#factFINAL assume true; 19136#factEXIT >#78#return; 19073#L30-6 [2023-11-06 22:37:25,305 INFO L750 eck$LassoCheckResult]: Loop: 19073#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18842#$Ultimate##0 ~n := #in~n; 19372#L25 assume ~n <= 0;#res := 1; 19370#factFINAL assume true; 19072#factEXIT >#80#return; 19071#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 18849#$Ultimate##0 ~n := #in~n; 19184#L25 assume !(~n <= 0); 18890#L26 call #t~ret0 := fact(~n - 1);< 18902#$Ultimate##0 ~n := #in~n; 18912#L25 assume ~n <= 0;#res := 1; 18905#factFINAL assume true; 18886#factEXIT >#70#return; 18898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19182#factFINAL assume true; 19136#factEXIT >#82#return; 18789#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; 18790#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 18845#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 18846#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18939#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; 18940#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18766#$Ultimate##0 ~n := #in~n; 19305#L25 assume !(~n <= 0); 18890#L26 call #t~ret0 := fact(~n - 1);< 18902#$Ultimate##0 ~n := #in~n; 18912#L25 assume ~n <= 0;#res := 1; 18905#factFINAL assume true; 18886#factEXIT >#70#return; 18898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19182#factFINAL assume true; 19136#factEXIT >#78#return; 19073#L30-6 [2023-11-06 22:37:25,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:25,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1457582577, now seen corresponding path program 1 times [2023-11-06 22:37:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:25,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636350722] [2023-11-06 22:37:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:25,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:25,315 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846944295] [2023-11-06 22:37:25,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:25,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:25,325 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:25,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2023-11-06 22:37:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:25,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:25,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:25,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:25,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2010487292, now seen corresponding path program 2 times [2023-11-06 22:37:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:25,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589646017] [2023-11-06 22:37:25,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:25,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:25,418 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:25,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831053957] [2023-11-06 22:37:25,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:25,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:25,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:25,422 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:25,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2023-11-06 22:37:25,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:25,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:25,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:25,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:25,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1828130806, now seen corresponding path program 1 times [2023-11-06 22:37:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888270761] [2023-11-06 22:37:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:25,505 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:25,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234283696] [2023-11-06 22:37:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:25,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:25,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:25,511 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:25,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2023-11-06 22:37:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:25,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:37:25,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-11-06 22:37:25,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 59 proven. 4 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-11-06 22:37:25,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888270761] [2023-11-06 22:37:25,936 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234283696] [2023-11-06 22:37:25,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234283696] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:25,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:25,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2023-11-06 22:37:25,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731116180] [2023-11-06 22:37:25,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:26,263 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:26,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:26,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:26,264 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:26,264 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:37:26,264 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,264 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:26,264 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:26,265 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-11-06 22:37:26,265 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:26,265 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:26,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,407 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:26,407 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:37:26,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,410 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2023-11-06 22:37:26,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:26,411 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:26,423 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:26,423 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:26,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:26,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,427 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2023-11-06 22:37:26,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:26,431 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:26,443 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:26,443 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:26,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2023-11-06 22:37:26,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,448 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2023-11-06 22:37:26,451 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:26,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:26,463 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:26,463 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:26,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2023-11-06 22:37:26,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,467 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2023-11-06 22:37:26,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:26,469 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:26,481 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:26,481 INFO L440 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: [] [2023-11-06 22:37:26,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2023-11-06 22:37:26,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,490 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:26,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:26,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2023-11-06 22:37:26,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:26,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,524 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:37:26,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:26,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2023-11-06 22:37:26,542 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:37:26,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2023-11-06 22:37:26,545 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:26,545 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:26,545 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:26,545 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:26,545 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:37:26,545 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,545 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:26,545 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:26,545 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-11-06 22:37:26,545 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:26,545 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:26,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:26,682 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:26,683 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:37:26,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,684 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2023-11-06 22:37:26,686 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 [2023-11-06 22:37:26,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:26,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:26,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:26,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:26,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:26,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:26,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:26,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:26,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2023-11-06 22:37:26,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,706 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2023-11-06 22:37:26,710 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 [2023-11-06 22:37:26,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:26,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:26,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:26,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:26,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:26,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:26,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:26,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:26,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:26,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,727 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-11-06 22:37:26,730 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 [2023-11-06 22:37:26,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:26,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:26,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:26,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:26,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:26,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:26,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:26,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:26,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:26,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,747 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-11-06 22:37:26,749 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 [2023-11-06 22:37:26,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:26,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:26,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:26,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:26,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:26,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:26,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:26,763 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:37:26,766 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:37:26,766 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:37:26,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:26,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:26,769 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:26,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-11-06 22:37:26,770 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:37:26,770 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:37:26,770 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:37:26,770 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 1 Supporting invariants [] [2023-11-06 22:37:26,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:26,774 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:37:26,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:26,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:37:26,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:27,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:37:27,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:27,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:37:27,290 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2023-11-06 22:37:27,290 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 962 states and 1586 transitions. cyclomatic complexity: 644 Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-06 22:37:27,642 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 962 states and 1586 transitions. cyclomatic complexity: 644. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Result 2109 states and 2998 transitions. Complement of second has 43 states. [2023-11-06 22:37:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-06 22:37:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2023-11-06 22:37:27,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 76 transitions. Stem has 38 letters. Loop has 32 letters. [2023-11-06 22:37:27,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:27,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 76 transitions. Stem has 70 letters. Loop has 32 letters. [2023-11-06 22:37:27,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:27,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 76 transitions. Stem has 38 letters. Loop has 64 letters. [2023-11-06 22:37:27,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:27,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2109 states and 2998 transitions. [2023-11-06 22:37:27,674 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 73 [2023-11-06 22:37:27,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2109 states to 1802 states and 2585 transitions. [2023-11-06 22:37:27,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2023-11-06 22:37:27,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 399 [2023-11-06 22:37:27,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1802 states and 2585 transitions. [2023-11-06 22:37:27,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:27,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1802 states and 2585 transitions. [2023-11-06 22:37:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states and 2585 transitions. [2023-11-06 22:37:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1415. [2023-11-06 22:37:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 904 states have (on average 1.1194690265486726) internal successors, (1012), 925 states have internal predecessors, (1012), 267 states have call successors, (302), 170 states have call predecessors, (302), 244 states have return successors, (724), 319 states have call predecessors, (724), 267 states have call successors, (724) [2023-11-06 22:37:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2038 transitions. [2023-11-06 22:37:27,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1415 states and 2038 transitions. [2023-11-06 22:37:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:27,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:37:27,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:37:27,774 INFO L87 Difference]: Start difference. First operand 1415 states and 2038 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-06 22:37:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:28,081 INFO L93 Difference]: Finished difference Result 1556 states and 2306 transitions. [2023-11-06 22:37:28,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1556 states and 2306 transitions. [2023-11-06 22:37:28,099 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2023-11-06 22:37:28,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1556 states to 952 states and 1386 transitions. [2023-11-06 22:37:28,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 392 [2023-11-06 22:37:28,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 445 [2023-11-06 22:37:28,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 952 states and 1386 transitions. [2023-11-06 22:37:28,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:28,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 952 states and 1386 transitions. [2023-11-06 22:37:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states and 1386 transitions. [2023-11-06 22:37:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 806. [2023-11-06 22:37:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 520 states have (on average 1.126923076923077) internal successors, (586), 539 states have internal predecessors, (586), 164 states have call successors, (170), 88 states have call predecessors, (170), 122 states have return successors, (380), 178 states have call predecessors, (380), 164 states have call successors, (380) [2023-11-06 22:37:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1136 transitions. [2023-11-06 22:37:28,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 806 states and 1136 transitions. [2023-11-06 22:37:28,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:37:28,151 INFO L428 stractBuchiCegarLoop]: Abstraction has 806 states and 1136 transitions. [2023-11-06 22:37:28,151 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-06 22:37:28,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 806 states and 1136 transitions. [2023-11-06 22:37:28,157 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 79 [2023-11-06 22:37:28,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:28,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:28,159 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 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] [2023-11-06 22:37:28,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:28,159 INFO L748 eck$LassoCheckResult]: Stem: 25599#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 25543#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 25544#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; 25569#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; 25556#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 25558#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 25948#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; 25949#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 25971#$Ultimate##0 ~n := #in~n; 25974#L25 assume ~n <= 0;#res := 1; 25973#factFINAL assume true; 25970#factEXIT >#72#return; 25966#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 25967#$Ultimate##0 ~n := #in~n; 25972#L25 assume ~n <= 0;#res := 1; 25969#factFINAL assume true; 25965#factEXIT >#74#return; 25961#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 25962#$Ultimate##0 ~n := #in~n; 25968#L25 assume ~n <= 0;#res := 1; 25964#factFINAL assume true; 25960#factEXIT >#76#return; 25959#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; 25958#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 25957#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 25952#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 25953#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; 25520#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 25521#$Ultimate##0 ~n := #in~n; 26072#L25 assume ~n <= 0;#res := 1; 26070#factFINAL assume true; 26061#factEXIT >#78#return; 25977#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26059#$Ultimate##0 ~n := #in~n; 26075#L25 assume ~n <= 0;#res := 1; 26074#factFINAL assume true; 25976#factEXIT >#80#return; 25600#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 25601#$Ultimate##0 ~n := #in~n; 26036#L25 assume !(~n <= 0); 25998#L26 call #t~ret0 := fact(~n - 1);< 26002#$Ultimate##0 ~n := #in~n; 26008#L25 assume ~n <= 0;#res := 1; 26006#factFINAL assume true; 25997#factEXIT >#70#return; 26000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26034#factFINAL assume true; 26030#factEXIT >#82#return; 25545#L30-8 [2023-11-06 22:37:28,160 INFO L750 eck$LassoCheckResult]: Loop: 25545#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; 25546#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 26005#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 25996#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 25993#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; 25980#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 25983#$Ultimate##0 ~n := #in~n; 26026#L25 assume !(~n <= 0); 25999#L26 call #t~ret0 := fact(~n - 1);< 26002#$Ultimate##0 ~n := #in~n; 26010#L25 assume !(~n <= 0); 26012#L26 call #t~ret0 := fact(~n - 1);< 26016#$Ultimate##0 ~n := #in~n; 26019#L25 assume ~n <= 0;#res := 1; 26023#factFINAL assume true; 26021#factEXIT >#70#return; 26018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26015#factFINAL assume true; 26011#factEXIT >#70#return; 26009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26007#factFINAL assume true; 25989#factEXIT >#78#return; 25981#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 25983#$Ultimate##0 ~n := #in~n; 26026#L25 assume !(~n <= 0); 25999#L26 call #t~ret0 := fact(~n - 1);< 26002#$Ultimate##0 ~n := #in~n; 26008#L25 assume ~n <= 0;#res := 1; 26006#factFINAL assume true; 25997#factEXIT >#70#return; 25994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 25991#factFINAL assume true; 25978#factEXIT >#80#return; 25979#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 25992#$Ultimate##0 ~n := #in~n; 26024#L25 assume !(~n <= 0); 25999#L26 call #t~ret0 := fact(~n - 1);< 26002#$Ultimate##0 ~n := #in~n; 26010#L25 assume !(~n <= 0); 26012#L26 call #t~ret0 := fact(~n - 1);< 26016#$Ultimate##0 ~n := #in~n; 26010#L25 assume !(~n <= 0); 26012#L26 call #t~ret0 := fact(~n - 1);< 26016#$Ultimate##0 ~n := #in~n; 26019#L25 assume ~n <= 0;#res := 1; 26023#factFINAL assume true; 26021#factEXIT >#70#return; 26018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26015#factFINAL assume true; 26011#factEXIT >#70#return; 26013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26025#factFINAL assume true; 26022#factEXIT >#70#return; 26020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26017#factFINAL assume true; 26004#factEXIT >#82#return; 25545#L30-8 [2023-11-06 22:37:28,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash 248376115, now seen corresponding path program 1 times [2023-11-06 22:37:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780673449] [2023-11-06 22:37:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:28,167 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:28,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950266000] [2023-11-06 22:37:28,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:28,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:28,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:28,169 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:28,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2023-11-06 22:37:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:28,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:37:28,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:37:28,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:37:28,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780673449] [2023-11-06 22:37:28,311 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950266000] [2023-11-06 22:37:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950266000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:28,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:28,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:37:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62925672] [2023-11-06 22:37:28,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:28,312 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:37:28,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2083419204, now seen corresponding path program 3 times [2023-11-06 22:37:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:28,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912767077] [2023-11-06 22:37:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:28,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:28,317 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420142808] [2023-11-06 22:37:28,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:37:28,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:28,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:28,319 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:28,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2023-11-06 22:37:28,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-06 22:37:28,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:28,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:37:28,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 32 proven. 88 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-06 22:37:28,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 32 proven. 98 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-06 22:37:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912767077] [2023-11-06 22:37:29,194 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420142808] [2023-11-06 22:37:29,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420142808] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:29,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:29,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 20 [2023-11-06 22:37:29,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904220249] [2023-11-06 22:37:29,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:29,195 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:29,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:37:29,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:37:29,196 INFO L87 Difference]: Start difference. First operand 806 states and 1136 transitions. cyclomatic complexity: 346 Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2023-11-06 22:37:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:29,347 INFO L93 Difference]: Finished difference Result 750 states and 1046 transitions. [2023-11-06 22:37:29,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 750 states and 1046 transitions. [2023-11-06 22:37:29,356 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 79 [2023-11-06 22:37:29,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 750 states to 632 states and 910 transitions. [2023-11-06 22:37:29,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2023-11-06 22:37:29,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2023-11-06 22:37:29,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 632 states and 910 transitions. [2023-11-06 22:37:29,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:29,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 632 states and 910 transitions. [2023-11-06 22:37:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states and 910 transitions. [2023-11-06 22:37:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 618. [2023-11-06 22:37:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 394 states have (on average 1.131979695431472) internal successors, (446), 407 states have internal predecessors, (446), 132 states have call successors, (132), 62 states have call predecessors, (132), 92 states have return successors, (318), 148 states have call predecessors, (318), 132 states have call successors, (318) [2023-11-06 22:37:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 896 transitions. [2023-11-06 22:37:29,395 INFO L240 hiAutomatonCegarLoop]: Abstraction has 618 states and 896 transitions. [2023-11-06 22:37:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:37:29,396 INFO L428 stractBuchiCegarLoop]: Abstraction has 618 states and 896 transitions. [2023-11-06 22:37:29,396 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-06 22:37:29,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 618 states and 896 transitions. [2023-11-06 22:37:29,401 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 79 [2023-11-06 22:37:29,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:29,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:29,402 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 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] [2023-11-06 22:37:29,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:29,403 INFO L748 eck$LassoCheckResult]: Stem: 27650#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 27602#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 27603#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; 27625#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; 27613#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27615#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27630#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; 27594#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27595#$Ultimate##0 ~n := #in~n; 28119#L25 assume ~n <= 0;#res := 1; 28116#factFINAL assume true; 28115#factEXIT >#72#return; 28061#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28062#$Ultimate##0 ~n := #in~n; 28067#L25 assume ~n <= 0;#res := 1; 28066#factFINAL assume true; 28060#factEXIT >#74#return; 28057#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28058#$Ultimate##0 ~n := #in~n; 28069#L25 assume ~n <= 0;#res := 1; 28068#factFINAL assume true; 28056#factEXIT >#76#return; 28055#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; 28053#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 28051#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28049#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28048#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; 27609#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28047#$Ultimate##0 ~n := #in~n; 28147#L25 assume !(~n <= 0); 27608#L26 call #t~ret0 := fact(~n - 1);< 27610#$Ultimate##0 ~n := #in~n; 28063#L25 assume ~n <= 0;#res := 1; 28059#factFINAL assume true; 28054#factEXIT >#70#return; 28052#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28050#factFINAL assume true; 28046#factEXIT >#78#return; 27992#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27993#$Ultimate##0 ~n := #in~n; 28117#L25 assume ~n <= 0;#res := 1; 28041#factFINAL assume true; 28114#factEXIT >#80#return; 27852#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27950#$Ultimate##0 ~n := #in~n; 27987#L25 assume !(~n <= 0); 27980#L26 call #t~ret0 := fact(~n - 1);< 27985#$Ultimate##0 ~n := #in~n; 28045#L25 assume ~n <= 0;#res := 1; 28064#factFINAL assume true; 27979#factEXIT >#70#return; 27978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27949#factFINAL assume true; 27851#factEXIT >#82#return; 27604#L30-8 [2023-11-06 22:37:29,403 INFO L750 eck$LassoCheckResult]: Loop: 27604#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; 27605#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 28020#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28018#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28017#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; 27919#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28014#$Ultimate##0 ~n := #in~n; 28029#L25 assume !(~n <= 0); 27982#L26 call #t~ret0 := fact(~n - 1);< 27985#$Ultimate##0 ~n := #in~n; 28042#L25 assume !(~n <= 0); 28034#L26 call #t~ret0 := fact(~n - 1);< 28039#$Ultimate##0 ~n := #in~n; 28044#L25 assume ~n <= 0;#res := 1; 28074#factFINAL assume true; 28073#factEXIT >#70#return; 28072#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28038#factFINAL assume true; 28033#factEXIT >#70#return; 28031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28028#factFINAL assume true; 28016#factEXIT >#78#return; 27920#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28014#$Ultimate##0 ~n := #in~n; 28029#L25 assume ~n <= 0;#res := 1; 28026#factFINAL assume true; 27922#factEXIT >#80#return; 27651#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27652#$Ultimate##0 ~n := #in~n; 28070#L25 assume !(~n <= 0); 27982#L26 call #t~ret0 := fact(~n - 1);< 27985#$Ultimate##0 ~n := #in~n; 28042#L25 assume !(~n <= 0); 28034#L26 call #t~ret0 := fact(~n - 1);< 28039#$Ultimate##0 ~n := #in~n; 28044#L25 assume ~n <= 0;#res := 1; 28074#factFINAL assume true; 28073#factEXIT >#70#return; 28072#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28038#factFINAL assume true; 28033#factEXIT >#70#return; 28031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28028#factFINAL assume true; 28016#factEXIT >#82#return; 27604#L30-8 [2023-11-06 22:37:29,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash 816659251, now seen corresponding path program 2 times [2023-11-06 22:37:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:29,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089396509] [2023-11-06 22:37:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:29,417 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:29,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774013426] [2023-11-06 22:37:29,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:29,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:29,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:29,423 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:29,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2023-11-06 22:37:29,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:29,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:29,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:29,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:29,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:29,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2060250884, now seen corresponding path program 4 times [2023-11-06 22:37:29,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:29,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085788077] [2023-11-06 22:37:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:29,536 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [260225279] [2023-11-06 22:37:29,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:37:29,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:29,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:29,541 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:29,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2023-11-06 22:37:29,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:37:29,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:29,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:29,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:29,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:29,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 2 times [2023-11-06 22:37:29,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242210251] [2023-11-06 22:37:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:29,643 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:29,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919050159] [2023-11-06 22:37:29,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:29,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:29,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:29,647 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:29,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2023-11-06 22:37:29,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:29,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:29,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:29,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:30,311 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:30,312 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:30,312 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:30,312 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:30,312 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:37:30,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,312 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:30,312 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:30,313 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-11-06 22:37:30,313 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:30,313 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:30,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,447 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:30,447 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:37:30,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,451 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2023-11-06 22:37:30,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,464 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,464 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=2} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:30,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:30,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,468 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2023-11-06 22:37:30,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,484 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,484 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:30,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:30,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,488 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2023-11-06 22:37:30,491 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,491 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,551 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,551 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=2} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:30,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:30,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,557 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2023-11-06 22:37:30,583 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,583 INFO L440 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: [] [2023-11-06 22:37:30,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:30,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,588 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2023-11-06 22:37:30,623 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,623 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:30,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:30,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,628 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,632 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2023-11-06 22:37:30,653 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,654 INFO L440 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: [] [2023-11-06 22:37:30,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:30,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,659 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2023-11-06 22:37:30,717 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,717 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=2} Honda state: {ULTIMATE.start_main_~x~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:30,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:30,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,725 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2023-11-06 22:37:30,751 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,751 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=2} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:30,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:30,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,757 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,761 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2023-11-06 22:37:30,773 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,773 INFO L440 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: [] [2023-11-06 22:37:30,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:30,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,781 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2023-11-06 22:37:30,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,796 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,796 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=2} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:37:30,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:30,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,800 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2023-11-06 22:37:30,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,803 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,815 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:30,815 INFO L440 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: [] [2023-11-06 22:37:30,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2023-11-06 22:37:30,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,819 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2023-11-06 22:37:30,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:30,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2023-11-06 22:37:30,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:30,836 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:30,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2023-11-06 22:37:30,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:37:30,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:30,853 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:37:30,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2023-11-06 22:37:30,856 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:30,856 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:30,856 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:30,856 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:30,856 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:37:30,856 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:30,856 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:30,856 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:30,856 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-11-06 22:37:30,856 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:30,856 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:30,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:30,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:31,016 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:31,016 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:37:31,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,018 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2023-11-06 22:37:31,022 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 [2023-11-06 22:37:31,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2023-11-06 22:37:31,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,042 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2023-11-06 22:37:31,047 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 [2023-11-06 22:37:31,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2023-11-06 22:37:31,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,063 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2023-11-06 22:37:31,066 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 [2023-11-06 22:37:31,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2023-11-06 22:37:31,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,082 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2023-11-06 22:37:31,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:37:31,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2023-11-06 22:37:31,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,105 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2023-11-06 22:37:31,108 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 [2023-11-06 22:37:31,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2023-11-06 22:37:31,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,124 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2023-11-06 22:37:31,126 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 [2023-11-06 22:37:31,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2023-11-06 22:37:31,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,143 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2023-11-06 22:37:31,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:37:31,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2023-11-06 22:37:31,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,161 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2023-11-06 22:37:31,164 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 [2023-11-06 22:37:31,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:31,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,213 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2023-11-06 22:37:31,217 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 [2023-11-06 22:37:31,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2023-11-06 22:37:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,233 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2023-11-06 22:37:31,236 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 [2023-11-06 22:37:31,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2023-11-06 22:37:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,252 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2023-11-06 22:37:31,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:37:31,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:31,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2023-11-06 22:37:31,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,271 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2023-11-06 22:37:31,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:37:31,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:31,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:31,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:31,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:31,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:31,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:31,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:31,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:37:31,290 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:37:31,290 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:37:31,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:31,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:31,292 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:31,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2023-11-06 22:37:31,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:37:31,294 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:37:31,294 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:37:31,294 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 3 Supporting invariants [] [2023-11-06 22:37:31,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2023-11-06 22:37:31,297 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:37:31,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:31,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:37:31,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:31,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:31,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:37:31,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-06 22:37:31,966 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2023-11-06 22:37:31,966 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 618 states and 896 transitions. cyclomatic complexity: 292 Second operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-06 22:37:32,294 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 618 states and 896 transitions. cyclomatic complexity: 292. Second operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Result 867 states and 1197 transitions. Complement of second has 49 states. [2023-11-06 22:37:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-06 22:37:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2023-11-06 22:37:32,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 74 transitions. Stem has 54 letters. Loop has 44 letters. [2023-11-06 22:37:32,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:32,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 74 transitions. Stem has 98 letters. Loop has 44 letters. [2023-11-06 22:37:32,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:32,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 74 transitions. Stem has 54 letters. Loop has 88 letters. [2023-11-06 22:37:32,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:32,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 867 states and 1197 transitions. [2023-11-06 22:37:32,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 78 [2023-11-06 22:37:32,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 867 states to 842 states and 1168 transitions. [2023-11-06 22:37:32,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 336 [2023-11-06 22:37:32,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2023-11-06 22:37:32,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 842 states and 1168 transitions. [2023-11-06 22:37:32,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:32,319 INFO L218 hiAutomatonCegarLoop]: Abstraction has 842 states and 1168 transitions. [2023-11-06 22:37:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states and 1168 transitions. [2023-11-06 22:37:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 772. [2023-11-06 22:37:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 496 states have (on average 1.1370967741935485) internal successors, (564), 511 states have internal predecessors, (564), 156 states have call successors, (158), 82 states have call predecessors, (158), 120 states have return successors, (362), 178 states have call predecessors, (362), 156 states have call successors, (362) [2023-11-06 22:37:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1084 transitions. [2023-11-06 22:37:32,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 772 states and 1084 transitions. [2023-11-06 22:37:32,350 INFO L428 stractBuchiCegarLoop]: Abstraction has 772 states and 1084 transitions. [2023-11-06 22:37:32,350 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-06 22:37:32,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 772 states and 1084 transitions. [2023-11-06 22:37:32,356 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 78 [2023-11-06 22:37:32,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:32,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:32,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 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] [2023-11-06 22:37:32,357 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:32,358 INFO L748 eck$LassoCheckResult]: Stem: 29526#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 29467#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 29468#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; 29490#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; 29478#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 29480#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30108#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; 30104#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30105#$Ultimate##0 ~n := #in~n; 30109#L25 assume ~n <= 0;#res := 1; 30107#factFINAL assume true; 30103#factEXIT >#72#return; 30099#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30100#$Ultimate##0 ~n := #in~n; 30106#L25 assume ~n <= 0;#res := 1; 30102#factFINAL assume true; 30098#factEXIT >#74#return; 30095#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30096#$Ultimate##0 ~n := #in~n; 30101#L25 assume ~n <= 0;#res := 1; 30097#factFINAL assume true; 30094#factEXIT >#76#return; 30092#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; 30090#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 30087#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30083#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30081#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; 30078#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30079#$Ultimate##0 ~n := #in~n; 30089#L25 assume !(~n <= 0); 30085#L26 call #t~ret0 := fact(~n - 1);< 30086#$Ultimate##0 ~n := #in~n; 30091#L25 assume ~n <= 0;#res := 1; 30088#factFINAL assume true; 30084#factEXIT >#70#return; 30082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30080#factFINAL assume true; 30077#factEXIT >#78#return; 30070#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30075#$Ultimate##0 ~n := #in~n; 30069#L25 assume ~n <= 0;#res := 1; 30071#factFINAL assume true; 30076#factEXIT >#80#return; 30054#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30055#$Ultimate##0 ~n := #in~n; 30065#L25 assume !(~n <= 0); 29476#L26 call #t~ret0 := fact(~n - 1);< 30064#$Ultimate##0 ~n := #in~n; 29505#L25 assume ~n <= 0;#res := 1; 29506#factFINAL assume true; 30062#factEXIT >#70#return; 30061#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30056#factFINAL assume true; 30053#factEXIT >#82#return; 30049#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; 29470#binomialCoefficient_returnLabel#2 [2023-11-06 22:37:32,358 INFO L750 eck$LassoCheckResult]: Loop: 29470#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 30150#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30145#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30144#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; 29443#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 29444#$Ultimate##0 ~n := #in~n; 30172#L25 assume !(~n <= 0); 29508#L26 call #t~ret0 := fact(~n - 1);< 29474#$Ultimate##0 ~n := #in~n; 29507#L25 assume !(~n <= 0); 29510#L26 call #t~ret0 := fact(~n - 1);< 30186#$Ultimate##0 ~n := #in~n; 29507#L25 assume !(~n <= 0); 29510#L26 call #t~ret0 := fact(~n - 1);< 30186#$Ultimate##0 ~n := #in~n; 30187#L25 assume ~n <= 0;#res := 1; 30202#factFINAL assume true; 30200#factEXIT >#70#return; 30199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30198#factFINAL assume true; 30197#factEXIT >#70#return; 30182#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30185#factFINAL assume true; 30181#factEXIT >#70#return; 30179#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30176#factFINAL assume true; 30155#factEXIT >#78#return; 30124#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 29444#$Ultimate##0 ~n := #in~n; 30172#L25 assume ~n <= 0;#res := 1; 30170#factFINAL assume true; 30123#factEXIT >#80#return; 30125#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30177#$Ultimate##0 ~n := #in~n; 30184#L25 assume !(~n <= 0); 29508#L26 call #t~ret0 := fact(~n - 1);< 29474#$Ultimate##0 ~n := #in~n; 29507#L25 assume !(~n <= 0); 29510#L26 call #t~ret0 := fact(~n - 1);< 30186#$Ultimate##0 ~n := #in~n; 29507#L25 assume !(~n <= 0); 29510#L26 call #t~ret0 := fact(~n - 1);< 30186#$Ultimate##0 ~n := #in~n; 30187#L25 assume ~n <= 0;#res := 1; 30202#factFINAL assume true; 30200#factEXIT >#70#return; 30199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30198#factFINAL assume true; 30197#factEXIT >#70#return; 30182#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30185#factFINAL assume true; 30181#factEXIT >#70#return; 30179#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30176#factFINAL assume true; 30155#factEXIT >#82#return; 29469#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; 29470#binomialCoefficient_returnLabel#2 [2023-11-06 22:37:32,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash -453366944, now seen corresponding path program 1 times [2023-11-06 22:37:32,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:32,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273495817] [2023-11-06 22:37:32,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:32,366 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098902544] [2023-11-06 22:37:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:32,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:32,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:32,367 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:32,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2023-11-06 22:37:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:32,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:32,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:32,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash 837206758, now seen corresponding path program 5 times [2023-11-06 22:37:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:32,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098980749] [2023-11-06 22:37:32,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:32,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:32,492 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:32,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1029365512] [2023-11-06 22:37:32,493 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:37:32,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:32,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:32,495 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:32,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2023-11-06 22:37:32,584 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-11-06 22:37:32,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:32,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:32,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:32,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1336720059, now seen corresponding path program 3 times [2023-11-06 22:37:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:32,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319699370] [2023-11-06 22:37:32,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:32,633 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:32,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051807493] [2023-11-06 22:37:32,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:37:32,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:32,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:32,655 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:32,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2023-11-06 22:37:32,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-06 22:37:32,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:32,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:37:32,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 372 proven. 13 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2023-11-06 22:37:32,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 102 proven. 80 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2023-11-06 22:37:33,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:33,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319699370] [2023-11-06 22:37:33,318 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:33,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051807493] [2023-11-06 22:37:33,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051807493] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:33,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:33,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2023-11-06 22:37:33,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905499322] [2023-11-06 22:37:33,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:33,897 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:33,897 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:33,897 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:33,897 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:33,897 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:37:33,897 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:33,897 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:33,897 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:33,897 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2023-11-06 22:37:33,897 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:33,898 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:33,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:33,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,002 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:34,002 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:37:34,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,004 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2023-11-06 22:37:34,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:34,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:34,018 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:34,018 INFO L440 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: [] [2023-11-06 22:37:34,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2023-11-06 22:37:34,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,022 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2023-11-06 22:37:34,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:34,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:34,037 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:34,037 INFO L440 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: [] [2023-11-06 22:37:34,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:34,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,041 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2023-11-06 22:37:34,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:34,043 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:34,055 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:34,055 INFO L440 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: [] [2023-11-06 22:37:34,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2023-11-06 22:37:34,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,059 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2023-11-06 22:37:34,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:34,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:34,073 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:37:34,073 INFO L440 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: [] [2023-11-06 22:37:34,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2023-11-06 22:37:34,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,077 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2023-11-06 22:37:34,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:34,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:34,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:34,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,100 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2023-11-06 22:37:34,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:37:34,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:34,116 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:37:34,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2023-11-06 22:37:34,119 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:34,119 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:34,119 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:34,119 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:34,119 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:37:34,119 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,119 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:34,120 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:34,120 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2023-11-06 22:37:34,120 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:34,120 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:34,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:34,226 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:34,226 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:37:34,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,227 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2023-11-06 22:37:34,230 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 [2023-11-06 22:37:34,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:34,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:34,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:34,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:34,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:34,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:34,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:34,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:34,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:34,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,246 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2023-11-06 22:37:34,248 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 [2023-11-06 22:37:34,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:34,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:34,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:34,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:34,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:34,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:34,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:34,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:34,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2023-11-06 22:37:34,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,264 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2023-11-06 22:37:34,267 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 [2023-11-06 22:37:34,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:34,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:34,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:34,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:34,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:34,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:34,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:34,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:34,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:34,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,283 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2023-11-06 22:37:34,285 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 [2023-11-06 22:37:34,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:34,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:34,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:34,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:34,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:34,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:34,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:34,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:34,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2023-11-06 22:37:34,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,301 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2023-11-06 22:37:34,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 [2023-11-06 22:37:34,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:34,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:34,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:34,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:34,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:34,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:34,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:34,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:37:34,320 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:37:34,320 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:37:34,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:34,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:34,323 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:34,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2023-11-06 22:37:34,325 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:37:34,325 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:37:34,325 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:37:34,325 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 5 Supporting invariants [] [2023-11-06 22:37:34,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:34,329 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:37:34,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:34,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:37:34,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:34,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:34,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-06 22:37:34,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-06 22:37:35,130 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2023-11-06 22:37:35,130 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 772 states and 1084 transitions. cyclomatic complexity: 332 Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-06 22:37:35,493 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 772 states and 1084 transitions. cyclomatic complexity: 332. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 1449 states and 1963 transitions. Complement of second has 57 states. [2023-11-06 22:37:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-06 22:37:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 85 transitions. [2023-11-06 22:37:35,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 85 transitions. Stem has 55 letters. Loop has 56 letters. [2023-11-06 22:37:35,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:35,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 85 transitions. Stem has 111 letters. Loop has 56 letters. [2023-11-06 22:37:35,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:35,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 85 transitions. Stem has 55 letters. Loop has 112 letters. [2023-11-06 22:37:35,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:35,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1449 states and 1963 transitions. [2023-11-06 22:37:35,513 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 78 [2023-11-06 22:37:35,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1449 states to 1230 states and 1678 transitions. [2023-11-06 22:37:35,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 377 [2023-11-06 22:37:35,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 379 [2023-11-06 22:37:35,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1230 states and 1678 transitions. [2023-11-06 22:37:35,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:35,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1230 states and 1678 transitions. [2023-11-06 22:37:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states and 1678 transitions. [2023-11-06 22:37:35,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 944. [2023-11-06 22:37:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 608 states have (on average 1.138157894736842) internal successors, (692), 625 states have internal predecessors, (692), 182 states have call successors, (188), 100 states have call predecessors, (188), 154 states have return successors, (458), 218 states have call predecessors, (458), 182 states have call successors, (458) [2023-11-06 22:37:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1338 transitions. [2023-11-06 22:37:35,580 INFO L240 hiAutomatonCegarLoop]: Abstraction has 944 states and 1338 transitions. [2023-11-06 22:37:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:35,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:37:35,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:37:35,581 INFO L87 Difference]: Start difference. First operand 944 states and 1338 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 9 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2023-11-06 22:37:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:35,951 INFO L93 Difference]: Finished difference Result 1384 states and 2048 transitions. [2023-11-06 22:37:35,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1384 states and 2048 transitions. [2023-11-06 22:37:35,967 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 117 [2023-11-06 22:37:35,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1384 states to 1339 states and 1993 transitions. [2023-11-06 22:37:35,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 474 [2023-11-06 22:37:35,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 474 [2023-11-06 22:37:35,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1339 states and 1993 transitions. [2023-11-06 22:37:35,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:35,988 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1339 states and 1993 transitions. [2023-11-06 22:37:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states and 1993 transitions. [2023-11-06 22:37:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1003. [2023-11-06 22:37:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 645 states have (on average 1.1426356589147286) internal successors, (737), 660 states have internal predecessors, (737), 210 states have call successors, (216), 100 states have call predecessors, (216), 148 states have return successors, (508), 242 states have call predecessors, (508), 210 states have call successors, (508) [2023-11-06 22:37:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1461 transitions. [2023-11-06 22:37:36,081 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1003 states and 1461 transitions. [2023-11-06 22:37:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:37:36,082 INFO L428 stractBuchiCegarLoop]: Abstraction has 1003 states and 1461 transitions. [2023-11-06 22:37:36,082 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-06 22:37:36,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1003 states and 1461 transitions. [2023-11-06 22:37:36,088 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 95 [2023-11-06 22:37:36,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:36,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:36,090 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] [2023-11-06 22:37:36,090 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 6, 6, 6, 6, 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] [2023-11-06 22:37:36,090 INFO L748 eck$LassoCheckResult]: Stem: 35183#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 35125#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 35126#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; 35150#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; 35137#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 35138#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35850#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; 35123#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35124#$Ultimate##0 ~n := #in~n; 35822#L25 assume ~n <= 0;#res := 1; 35821#factFINAL assume true; 35820#factEXIT >#72#return; 35172#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 35173#$Ultimate##0 ~n := #in~n; 35873#L25 assume ~n <= 0;#res := 1; 35872#factFINAL assume true; 35871#factEXIT >#74#return; 35113#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 35114#$Ultimate##0 ~n := #in~n; 35884#L25 assume ~n <= 0;#res := 1; 35883#factFINAL assume true; 35882#factEXIT >#76#return; 35144#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; 35145#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 35161#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 35973#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35967#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; 35963#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35964#$Ultimate##0 ~n := #in~n; 35978#L25 assume !(~n <= 0); 35971#L26 call #t~ret0 := fact(~n - 1);< 35972#$Ultimate##0 ~n := #in~n; 35979#L25 assume ~n <= 0;#res := 1; 35975#factFINAL assume true; 35970#factEXIT >#70#return; 35969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35966#factFINAL assume true; 35962#factEXIT >#78#return; 35927#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 35928#$Ultimate##0 ~n := #in~n; 35944#L25 assume ~n <= 0;#res := 1; 35940#factFINAL assume true; 35941#factEXIT >#80#return; 35923#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 35924#$Ultimate##0 ~n := #in~n; 36034#L25 assume !(~n <= 0); 35134#L26 call #t~ret0 := fact(~n - 1);< 35950#$Ultimate##0 ~n := #in~n; 36035#L25 assume ~n <= 0;#res := 1; 36033#factFINAL assume true; 35948#factEXIT >#70#return; 35949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36096#factFINAL assume true; 35922#factEXIT >#82#return; 35916#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; 35912#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 35910#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 35290#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 35273#L42-4 havoc main_~k~0#1; 35148#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 35149#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 35272#L42-3 [2023-11-06 22:37:36,092 INFO L750 eck$LassoCheckResult]: Loop: 35272#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35271#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; 35264#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35266#$Ultimate##0 ~n := #in~n; 35269#L25 assume !(~n <= 0); 35270#L26 call #t~ret0 := fact(~n - 1);< 35315#$Ultimate##0 ~n := #in~n; 35433#L25 assume ~n <= 0;#res := 1; 35435#factFINAL assume true; 35314#factEXIT >#70#return; 35312#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35305#factFINAL assume true; 35268#factEXIT >#72#return; 35263#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 35266#$Ultimate##0 ~n := #in~n; 35269#L25 assume ~n <= 0;#res := 1; 35267#factFINAL assume true; 35262#factEXIT >#74#return; 35260#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 35261#$Ultimate##0 ~n := #in~n; 35461#L25 assume ~n <= 0;#res := 1; 35307#factFINAL assume true; 35259#factEXIT >#76#return; 35257#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; 35255#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 35250#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 35236#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35234#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; 35203#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35226#$Ultimate##0 ~n := #in~n; 35254#L25 assume !(~n <= 0); 35242#L26 call #t~ret0 := fact(~n - 1);< 35249#$Ultimate##0 ~n := #in~n; 35258#L25 assume !(~n <= 0); 35279#L26 call #t~ret0 := fact(~n - 1);< 35285#$Ultimate##0 ~n := #in~n; 35288#L25 assume ~n <= 0;#res := 1; 35289#factFINAL assume true; 35287#factEXIT >#70#return; 35286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35284#factFINAL assume true; 35278#factEXIT >#70#return; 35274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35275#factFINAL assume true; 35198#factEXIT >#78#return; 35211#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 35226#$Ultimate##0 ~n := #in~n; 35254#L25 assume ~n <= 0;#res := 1; 35230#factFINAL assume true; 35227#factEXIT >#80#return; 35210#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 35223#$Ultimate##0 ~n := #in~n; 35253#L25 assume !(~n <= 0); 35242#L26 call #t~ret0 := fact(~n - 1);< 35249#$Ultimate##0 ~n := #in~n; 35258#L25 assume !(~n <= 0); 35279#L26 call #t~ret0 := fact(~n - 1);< 35285#$Ultimate##0 ~n := #in~n; 35258#L25 assume !(~n <= 0); 35279#L26 call #t~ret0 := fact(~n - 1);< 35285#$Ultimate##0 ~n := #in~n; 35288#L25 assume ~n <= 0;#res := 1; 35289#factFINAL assume true; 35287#factEXIT >#70#return; 35286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35284#factFINAL assume true; 35278#factEXIT >#70#return; 35280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35291#factFINAL assume true; 35282#factEXIT >#70#return; 35277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35224#factFINAL assume true; 35225#factEXIT >#82#return; 35216#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; 35295#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 35193#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 35194#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 35188#L42-4 havoc main_~k~0#1; 35146#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 35147#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 35272#L42-3 [2023-11-06 22:37:36,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 1 times [2023-11-06 22:37:36,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:36,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616776570] [2023-11-06 22:37:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:36,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:36,103 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:36,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911817600] [2023-11-06 22:37:36,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:36,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:36,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:36,105 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:36,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2023-11-06 22:37:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:36,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:36,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:36,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:36,231 INFO L85 PathProgramCache]: Analyzing trace with hash 725712679, now seen corresponding path program 1 times [2023-11-06 22:37:36,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:36,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992906099] [2023-11-06 22:37:36,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:36,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:36,238 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:36,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607395409] [2023-11-06 22:37:36,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:36,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:36,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:36,241 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:36,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2023-11-06 22:37:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:36,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:37:36,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 149 proven. 7 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2023-11-06 22:37:36,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 11 proven. 89 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2023-11-06 22:37:36,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:36,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992906099] [2023-11-06 22:37:36,599 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:36,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607395409] [2023-11-06 22:37:36,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607395409] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:36,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:36,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-11-06 22:37:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919017977] [2023-11-06 22:37:36,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:36,600 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:36,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:37:36,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:37:36,601 INFO L87 Difference]: Start difference. First operand 1003 states and 1461 transitions. cyclomatic complexity: 482 Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-06 22:37:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:36,820 INFO L93 Difference]: Finished difference Result 1142 states and 1657 transitions. [2023-11-06 22:37:36,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1142 states and 1657 transitions. [2023-11-06 22:37:36,831 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 122 [2023-11-06 22:37:36,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1142 states to 1138 states and 1645 transitions. [2023-11-06 22:37:36,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 401 [2023-11-06 22:37:36,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 401 [2023-11-06 22:37:36,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1645 transitions. [2023-11-06 22:37:36,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:36,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1645 transitions. [2023-11-06 22:37:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1645 transitions. [2023-11-06 22:37:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1019. [2023-11-06 22:37:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 653 states have (on average 1.1378254211332313) internal successors, (743), 664 states have internal predecessors, (743), 218 states have call successors, (224), 104 states have call predecessors, (224), 148 states have return successors, (508), 250 states have call predecessors, (508), 218 states have call successors, (508) [2023-11-06 22:37:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1475 transitions. [2023-11-06 22:37:36,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1019 states and 1475 transitions. [2023-11-06 22:37:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:37:36,894 INFO L428 stractBuchiCegarLoop]: Abstraction has 1019 states and 1475 transitions. [2023-11-06 22:37:36,894 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-11-06 22:37:36,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1019 states and 1475 transitions. [2023-11-06 22:37:36,900 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2023-11-06 22:37:36,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:36,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:36,903 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] [2023-11-06 22:37:36,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 6, 6, 6, 6, 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] [2023-11-06 22:37:36,904 INFO L748 eck$LassoCheckResult]: Stem: 37830#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 37776#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 37777#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; 37800#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; 37788#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37789#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38568#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; 38564#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38565#$Ultimate##0 ~n := #in~n; 38569#L25 assume ~n <= 0;#res := 1; 38567#factFINAL assume true; 38563#factEXIT >#72#return; 38559#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38560#$Ultimate##0 ~n := #in~n; 38566#L25 assume ~n <= 0;#res := 1; 38562#factFINAL assume true; 38558#factEXIT >#74#return; 38555#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 38556#$Ultimate##0 ~n := #in~n; 38561#L25 assume ~n <= 0;#res := 1; 38557#factFINAL assume true; 38554#factEXIT >#76#return; 38553#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; 38552#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 38547#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 38548#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38593#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; 38591#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38592#$Ultimate##0 ~n := #in~n; 38620#L25 assume !(~n <= 0); 38618#L26 call #t~ret0 := fact(~n - 1);< 38619#$Ultimate##0 ~n := #in~n; 38622#L25 assume ~n <= 0;#res := 1; 38621#factFINAL assume true; 38617#factEXIT >#70#return; 38616#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38615#factFINAL assume true; 38614#factEXIT >#78#return; 38595#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38612#$Ultimate##0 ~n := #in~n; 38597#L25 assume ~n <= 0;#res := 1; 38594#factFINAL assume true; 38596#factEXIT >#80#return; 38571#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 38572#$Ultimate##0 ~n := #in~n; 38581#L25 assume !(~n <= 0); 38578#L26 call #t~ret0 := fact(~n - 1);< 38580#$Ultimate##0 ~n := #in~n; 38610#L25 assume ~n <= 0;#res := 1; 38587#factFINAL assume true; 38588#factEXIT >#70#return; 38574#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38573#factFINAL assume true; 38570#factEXIT >#82#return; 38550#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; 38551#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 37974#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37842#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 37843#L42-4 havoc main_~k~0#1; 37798#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 37799#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37921#L42-3 [2023-11-06 22:37:36,904 INFO L750 eck$LassoCheckResult]: Loop: 37921#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37919#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; 37907#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37910#$Ultimate##0 ~n := #in~n; 37917#L25 assume !(~n <= 0); 37918#L26 call #t~ret0 := fact(~n - 1);< 37924#$Ultimate##0 ~n := #in~n; 37952#L25 assume ~n <= 0;#res := 1; 37957#factFINAL assume true; 37923#factEXIT >#70#return; 37922#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37920#factFINAL assume true; 37912#factEXIT >#72#return; 37908#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37910#$Ultimate##0 ~n := #in~n; 37917#L25 assume ~n <= 0;#res := 1; 37911#factFINAL assume true; 37906#factEXIT >#74#return; 37903#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37904#$Ultimate##0 ~n := #in~n; 37925#L25 assume !(~n <= 0); 37883#L26 call #t~ret0 := fact(~n - 1);< 37893#$Ultimate##0 ~n := #in~n; 37898#L25 assume ~n <= 0;#res := 1; 37895#factFINAL assume true; 37882#factEXIT >#70#return; 37889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37905#factFINAL assume true; 37902#factEXIT >#76#return; 37901#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; 37899#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 37897#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37894#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37881#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; 37852#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37873#$Ultimate##0 ~n := #in~n; 37968#L25 assume !(~n <= 0); 37887#L26 call #t~ret0 := fact(~n - 1);< 37893#$Ultimate##0 ~n := #in~n; 37898#L25 assume ~n <= 0;#res := 1; 37895#factFINAL assume true; 37882#factEXIT >#70#return; 37880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37879#factFINAL assume true; 37847#factEXIT >#78#return; 37867#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37971#$Ultimate##0 ~n := #in~n; 37972#L25 assume ~n <= 0;#res := 1; 37970#factFINAL assume true; 37965#factEXIT >#80#return; 37849#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37870#$Ultimate##0 ~n := #in~n; 37896#L25 assume !(~n <= 0); 37887#L26 call #t~ret0 := fact(~n - 1);< 37893#$Ultimate##0 ~n := #in~n; 37900#L25 assume !(~n <= 0); 37914#L26 call #t~ret0 := fact(~n - 1);< 37936#$Ultimate##0 ~n := #in~n; 37900#L25 assume !(~n <= 0); 37914#L26 call #t~ret0 := fact(~n - 1);< 37936#$Ultimate##0 ~n := #in~n; 37938#L25 assume ~n <= 0;#res := 1; 37940#factFINAL assume true; 37939#factEXIT >#70#return; 37937#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37935#factFINAL assume true; 37933#factEXIT >#70#return; 37915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37969#factFINAL assume true; 37913#factEXIT >#70#return; 37874#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37871#factFINAL assume true; 37872#factEXIT >#82#return; 37866#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; 37954#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 37840#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37841#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 37835#L42-4 havoc main_~k~0#1; 37796#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 37797#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37921#L42-3 [2023-11-06 22:37:36,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:36,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 2 times [2023-11-06 22:37:36,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:36,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219579369] [2023-11-06 22:37:36,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:36,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:36,914 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732803966] [2023-11-06 22:37:36,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:36,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:36,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:36,919 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:36,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2023-11-06 22:37:37,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:37,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:37,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:37,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:37,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash -815325017, now seen corresponding path program 2 times [2023-11-06 22:37:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:37,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884049981] [2023-11-06 22:37:37,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:37,052 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:37,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196963784] [2023-11-06 22:37:37,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:37,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:37,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:37,059 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:37,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2023-11-06 22:37:37,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:37,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:37,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:37:37,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 166 proven. 18 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-11-06 22:37:37,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2023-11-06 22:37:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884049981] [2023-11-06 22:37:37,491 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196963784] [2023-11-06 22:37:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196963784] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:37,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-06 22:37:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544308937] [2023-11-06 22:37:37,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:37,492 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:37,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:37:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:37:37,493 INFO L87 Difference]: Start difference. First operand 1019 states and 1475 transitions. cyclomatic complexity: 480 Second operand has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 9 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2023-11-06 22:37:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:37,934 INFO L93 Difference]: Finished difference Result 1209 states and 1740 transitions. [2023-11-06 22:37:37,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1209 states and 1740 transitions. [2023-11-06 22:37:37,945 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 151 [2023-11-06 22:37:37,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1209 states to 1209 states and 1740 transitions. [2023-11-06 22:37:37,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 437 [2023-11-06 22:37:37,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 437 [2023-11-06 22:37:37,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1209 states and 1740 transitions. [2023-11-06 22:37:37,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:37,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1209 states and 1740 transitions. [2023-11-06 22:37:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states and 1740 transitions. [2023-11-06 22:37:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1027. [2023-11-06 22:37:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 671 states have (on average 1.1251862891207154) internal successors, (755), 680 states have internal predecessors, (755), 206 states have call successors, (212), 102 states have call predecessors, (212), 150 states have return successors, (490), 244 states have call predecessors, (490), 206 states have call successors, (490) [2023-11-06 22:37:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1457 transitions. [2023-11-06 22:37:37,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1027 states and 1457 transitions. [2023-11-06 22:37:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:37:37,999 INFO L428 stractBuchiCegarLoop]: Abstraction has 1027 states and 1457 transitions. [2023-11-06 22:37:37,999 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-11-06 22:37:37,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1027 states and 1457 transitions. [2023-11-06 22:37:38,005 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2023-11-06 22:37:38,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:38,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:38,009 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] [2023-11-06 22:37:38,009 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] [2023-11-06 22:37:38,009 INFO L748 eck$LassoCheckResult]: Stem: 40569#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 40513#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 40514#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; 40534#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; 40523#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 40524#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41194#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; 40507#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 40508#$Ultimate##0 ~n := #in~n; 41251#L25 assume ~n <= 0;#res := 1; 41250#factFINAL assume true; 41249#factEXIT >#72#return; 40558#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40559#$Ultimate##0 ~n := #in~n; 41274#L25 assume ~n <= 0;#res := 1; 41273#factFINAL assume true; 41272#factEXIT >#74#return; 40503#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 40504#$Ultimate##0 ~n := #in~n; 41285#L25 assume ~n <= 0;#res := 1; 41284#factFINAL assume true; 41282#factEXIT >#76#return; 41281#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; 40543#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 40544#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 41335#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 41333#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; 41323#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 41324#$Ultimate##0 ~n := #in~n; 41340#L25 assume !(~n <= 0); 41331#L26 call #t~ret0 := fact(~n - 1);< 41332#$Ultimate##0 ~n := #in~n; 41336#L25 assume ~n <= 0;#res := 1; 41334#factFINAL assume true; 41330#factEXIT >#70#return; 41329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41328#factFINAL assume true; 41322#factEXIT >#78#return; 41305#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 41306#$Ultimate##0 ~n := #in~n; 41327#L25 assume ~n <= 0;#res := 1; 41318#factFINAL assume true; 41321#factEXIT >#80#return; 41290#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 41291#$Ultimate##0 ~n := #in~n; 41299#L25 assume !(~n <= 0); 41295#L26 call #t~ret0 := fact(~n - 1);< 41298#$Ultimate##0 ~n := #in~n; 41311#L25 assume ~n <= 0;#res := 1; 41312#factFINAL assume true; 41294#factEXIT >#70#return; 41293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 41292#factFINAL assume true; 41289#factEXIT >#82#return; 41286#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; 40833#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 40834#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40580#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 40581#L42-4 havoc main_~k~0#1; 40532#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 40533#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 40658#L42-3 [2023-11-06 22:37:38,010 INFO L750 eck$LassoCheckResult]: Loop: 40658#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40652#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; 40641#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 40642#$Ultimate##0 ~n := #in~n; 40650#L25 assume !(~n <= 0); 40651#L26 call #t~ret0 := fact(~n - 1);< 40657#$Ultimate##0 ~n := #in~n; 40796#L25 assume ~n <= 0;#res := 1; 40799#factFINAL assume true; 40656#factEXIT >#70#return; 40654#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40653#factFINAL assume true; 40644#factEXIT >#72#return; 40640#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40642#$Ultimate##0 ~n := #in~n; 40650#L25 assume ~n <= 0;#res := 1; 40643#factFINAL assume true; 40639#factEXIT >#74#return; 40636#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 40637#$Ultimate##0 ~n := #in~n; 40655#L25 assume !(~n <= 0); 40620#L26 call #t~ret0 := fact(~n - 1);< 40626#$Ultimate##0 ~n := #in~n; 40631#L25 assume ~n <= 0;#res := 1; 40628#factFINAL assume true; 40616#factEXIT >#70#return; 40623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40638#factFINAL assume true; 40635#factEXIT >#76#return; 40634#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; 40632#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 40630#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40627#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40615#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; 40587#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 40603#$Ultimate##0 ~n := #in~n; 40607#L25 assume !(~n <= 0); 40608#L26 call #t~ret0 := fact(~n - 1);< 40626#$Ultimate##0 ~n := #in~n; 40633#L25 assume !(~n <= 0); 40646#L26 call #t~ret0 := fact(~n - 1);< 40689#$Ultimate##0 ~n := #in~n; 40633#L25 assume !(~n <= 0); 40646#L26 call #t~ret0 := fact(~n - 1);< 40689#$Ultimate##0 ~n := #in~n; 40697#L25 assume ~n <= 0;#res := 1; 40760#factFINAL assume true; 40758#factEXIT >#70#return; 40702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40699#factFINAL assume true; 40645#factEXIT >#70#return; 40649#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40688#factFINAL assume true; 40686#factEXIT >#70#return; 40685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40604#factFINAL assume true; 40605#factEXIT >#72#return; 40596#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40603#$Ultimate##0 ~n := #in~n; 40607#L25 assume !(~n <= 0); 40608#L26 call #t~ret0 := fact(~n - 1);< 40626#$Ultimate##0 ~n := #in~n; 40633#L25 assume !(~n <= 0); 40646#L26 call #t~ret0 := fact(~n - 1);< 40689#$Ultimate##0 ~n := #in~n; 40697#L25 assume ~n <= 0;#res := 1; 40760#factFINAL assume true; 40758#factEXIT >#70#return; 40702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40699#factFINAL assume true; 40645#factEXIT >#70#return; 40647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40683#factFINAL assume true; 40609#factEXIT >#74#return; 40598#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 40797#$Ultimate##0 ~n := #in~n; 40798#L25 assume ~n <= 0;#res := 1; 40782#factFINAL assume true; 40714#factEXIT >#76#return; 40712#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; 40710#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 40708#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40706#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40704#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; 40595#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 40603#$Ultimate##0 ~n := #in~n; 40607#L25 assume !(~n <= 0); 40608#L26 call #t~ret0 := fact(~n - 1);< 40626#$Ultimate##0 ~n := #in~n; 40633#L25 assume !(~n <= 0); 40646#L26 call #t~ret0 := fact(~n - 1);< 40689#$Ultimate##0 ~n := #in~n; 40697#L25 assume ~n <= 0;#res := 1; 40760#factFINAL assume true; 40758#factEXIT >#70#return; 40702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40699#factFINAL assume true; 40645#factEXIT >#70#return; 40647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40683#factFINAL assume true; 40609#factEXIT >#78#return; 40592#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40603#$Ultimate##0 ~n := #in~n; 40607#L25 assume !(~n <= 0); 40608#L26 call #t~ret0 := fact(~n - 1);< 40626#$Ultimate##0 ~n := #in~n; 40631#L25 assume ~n <= 0;#res := 1; 40628#factFINAL assume true; 40616#factEXIT >#70#return; 40614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40613#factFINAL assume true; 40582#factEXIT >#80#return; 40583#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 40600#$Ultimate##0 ~n := #in~n; 40629#L25 assume !(~n <= 0); 40608#L26 call #t~ret0 := fact(~n - 1);< 40626#$Ultimate##0 ~n := #in~n; 40633#L25 assume !(~n <= 0); 40646#L26 call #t~ret0 := fact(~n - 1);< 40689#$Ultimate##0 ~n := #in~n; 40697#L25 assume ~n <= 0;#res := 1; 40760#factFINAL assume true; 40758#factEXIT >#70#return; 40702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40699#factFINAL assume true; 40645#factEXIT >#70#return; 40647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40683#factFINAL assume true; 40609#factEXIT >#82#return; 40579#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; 40578#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 40577#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40575#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 40572#L42-4 havoc main_~k~0#1; 40530#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 40531#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 40658#L42-3 [2023-11-06 22:37:38,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 3 times [2023-11-06 22:37:38,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:38,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046725186] [2023-11-06 22:37:38,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:38,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:38,018 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971394047] [2023-11-06 22:37:38,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:37:38,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:38,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:38,022 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:38,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2023-11-06 22:37:38,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-06 22:37:38,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:38,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:38,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:38,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1604166800, now seen corresponding path program 3 times [2023-11-06 22:37:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:38,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274070746] [2023-11-06 22:37:38,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:38,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:38,163 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568555183] [2023-11-06 22:37:38,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:37:38,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:38,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:38,172 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:38,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2023-11-06 22:37:38,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-06 22:37:38,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:38,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:37:38,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 170 proven. 3 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2023-11-06 22:37:38,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2023-11-06 22:37:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:38,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274070746] [2023-11-06 22:37:38,614 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:38,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568555183] [2023-11-06 22:37:38,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568555183] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:38,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:38,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2023-11-06 22:37:38,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853347861] [2023-11-06 22:37:38,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:38,615 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:38,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:38,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:37:38,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:37:38,616 INFO L87 Difference]: Start difference. First operand 1027 states and 1457 transitions. cyclomatic complexity: 454 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-06 22:37:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:38,819 INFO L93 Difference]: Finished difference Result 1183 states and 1665 transitions. [2023-11-06 22:37:38,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1183 states and 1665 transitions. [2023-11-06 22:37:38,829 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 116 [2023-11-06 22:37:38,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1183 states to 1153 states and 1629 transitions. [2023-11-06 22:37:38,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 407 [2023-11-06 22:37:38,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2023-11-06 22:37:38,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1153 states and 1629 transitions. [2023-11-06 22:37:38,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:38,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1153 states and 1629 transitions. [2023-11-06 22:37:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states and 1629 transitions. [2023-11-06 22:37:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1033. [2023-11-06 22:37:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 665 states have (on average 1.1263157894736842) internal successors, (749), 678 states have internal predecessors, (749), 222 states have call successors, (228), 100 states have call predecessors, (228), 146 states have return successors, (518), 254 states have call predecessors, (518), 222 states have call successors, (518) [2023-11-06 22:37:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1495 transitions. [2023-11-06 22:37:38,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1033 states and 1495 transitions. [2023-11-06 22:37:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:37:38,886 INFO L428 stractBuchiCegarLoop]: Abstraction has 1033 states and 1495 transitions. [2023-11-06 22:37:38,886 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-11-06 22:37:38,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1033 states and 1495 transitions. [2023-11-06 22:37:38,892 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 110 [2023-11-06 22:37:38,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:38,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:38,893 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] [2023-11-06 22:37:38,894 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] [2023-11-06 22:37:38,894 INFO L748 eck$LassoCheckResult]: Stem: 43628#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 43571#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 43572#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; 43595#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; 43583#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43584#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44453#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; 44451#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44452#$Ultimate##0 ~n := #in~n; 44455#L25 assume ~n <= 0;#res := 1; 44454#factFINAL assume true; 44450#factEXIT >#72#return; 44445#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44446#$Ultimate##0 ~n := #in~n; 44449#L25 assume ~n <= 0;#res := 1; 44448#factFINAL assume true; 44444#factEXIT >#74#return; 44427#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44428#$Ultimate##0 ~n := #in~n; 44434#L25 assume ~n <= 0;#res := 1; 44430#factFINAL assume true; 44426#factEXIT >#76#return; 44425#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; 44424#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 44423#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 44421#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 44414#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; 44407#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 44408#$Ultimate##0 ~n := #in~n; 44422#L25 assume !(~n <= 0); 44418#L26 call #t~ret0 := fact(~n - 1);< 44420#$Ultimate##0 ~n := #in~n; 44447#L25 assume ~n <= 0;#res := 1; 44443#factFINAL assume true; 44441#factEXIT >#70#return; 44439#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44437#factFINAL assume true; 44433#factEXIT >#78#return; 44383#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 44384#$Ultimate##0 ~n := #in~n; 44431#L25 assume ~n <= 0;#res := 1; 44400#factFINAL assume true; 44409#factEXIT >#80#return; 44235#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 44236#$Ultimate##0 ~n := #in~n; 44396#L25 assume !(~n <= 0); 44389#L26 call #t~ret0 := fact(~n - 1);< 44392#$Ultimate##0 ~n := #in~n; 44398#L25 assume ~n <= 0;#res := 1; 44395#factFINAL assume true; 44388#factEXIT >#70#return; 44386#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 44385#factFINAL assume true; 44234#factEXIT >#82#return; 44232#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; 44233#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 44551#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43640#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 43641#L42-4 havoc main_~k~0#1; 43593#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43594#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43710#L42-3 [2023-11-06 22:37:38,894 INFO L750 eck$LassoCheckResult]: Loop: 43710#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43709#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; 43702#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43704#$Ultimate##0 ~n := #in~n; 43707#L25 assume !(~n <= 0); 43708#L26 call #t~ret0 := fact(~n - 1);< 43788#$Ultimate##0 ~n := #in~n; 43801#L25 assume ~n <= 0;#res := 1; 43802#factFINAL assume true; 43787#factEXIT >#70#return; 43786#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43785#factFINAL assume true; 43706#factEXIT >#72#return; 43703#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43704#$Ultimate##0 ~n := #in~n; 43707#L25 assume ~n <= 0;#res := 1; 43705#factFINAL assume true; 43701#factEXIT >#74#return; 43699#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43700#$Ultimate##0 ~n := #in~n; 43794#L25 assume !(~n <= 0); 43683#L26 call #t~ret0 := fact(~n - 1);< 43689#$Ultimate##0 ~n := #in~n; 43694#L25 assume ~n <= 0;#res := 1; 43691#factFINAL assume true; 43679#factEXIT >#70#return; 43688#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43790#factFINAL assume true; 43698#factEXIT >#76#return; 43697#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; 43695#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 43693#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43690#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43678#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; 43657#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43668#$Ultimate##0 ~n := #in~n; 43670#L25 assume !(~n <= 0); 43671#L26 call #t~ret0 := fact(~n - 1);< 43689#$Ultimate##0 ~n := #in~n; 43696#L25 assume !(~n <= 0); 43749#L26 call #t~ret0 := fact(~n - 1);< 43755#$Ultimate##0 ~n := #in~n; 43696#L25 assume !(~n <= 0); 43749#L26 call #t~ret0 := fact(~n - 1);< 43755#$Ultimate##0 ~n := #in~n; 43760#L25 assume ~n <= 0;#res := 1; 43777#factFINAL assume true; 43774#factEXIT >#70#return; 43771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43754#factFINAL assume true; 43748#factEXIT >#70#return; 43750#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43773#factFINAL assume true; 43769#factEXIT >#70#return; 43746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43743#factFINAL assume true; 43717#factEXIT >#72#return; 43653#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43668#$Ultimate##0 ~n := #in~n; 43670#L25 assume !(~n <= 0); 43671#L26 call #t~ret0 := fact(~n - 1);< 43689#$Ultimate##0 ~n := #in~n; 43696#L25 assume !(~n <= 0); 43749#L26 call #t~ret0 := fact(~n - 1);< 43755#$Ultimate##0 ~n := #in~n; 43696#L25 assume !(~n <= 0); 43749#L26 call #t~ret0 := fact(~n - 1);< 43755#$Ultimate##0 ~n := #in~n; 43760#L25 assume ~n <= 0;#res := 1; 43777#factFINAL assume true; 43774#factEXIT >#70#return; 43771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43754#factFINAL assume true; 43748#factEXIT >#70#return; 43750#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43773#factFINAL assume true; 43769#factEXIT >#70#return; 43746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43743#factFINAL assume true; 43717#factEXIT >#74#return; 43663#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43783#$Ultimate##0 ~n := #in~n; 43784#L25 assume ~n <= 0;#res := 1; 43772#factFINAL assume true; 43756#factEXIT >#76#return; 43753#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; 43752#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 43747#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43744#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43741#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; 43645#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43668#$Ultimate##0 ~n := #in~n; 43670#L25 assume !(~n <= 0); 43671#L26 call #t~ret0 := fact(~n - 1);< 43689#$Ultimate##0 ~n := #in~n; 43696#L25 assume !(~n <= 0); 43749#L26 call #t~ret0 := fact(~n - 1);< 43755#$Ultimate##0 ~n := #in~n; 43760#L25 assume ~n <= 0;#res := 1; 43777#factFINAL assume true; 43774#factEXIT >#70#return; 43771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43754#factFINAL assume true; 43748#factEXIT >#70#return; 43745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43742#factFINAL assume true; 43672#factEXIT >#78#return; 43659#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43668#$Ultimate##0 ~n := #in~n; 43670#L25 assume ~n <= 0;#res := 1; 43669#factFINAL assume true; 43666#factEXIT >#80#return; 43649#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43665#$Ultimate##0 ~n := #in~n; 43692#L25 assume !(~n <= 0); 43671#L26 call #t~ret0 := fact(~n - 1);< 43689#$Ultimate##0 ~n := #in~n; 43694#L25 assume ~n <= 0;#res := 1; 43691#factFINAL assume true; 43679#factEXIT >#70#return; 43677#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43676#factFINAL assume true; 43643#factEXIT >#82#return; 43642#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; 43639#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 43638#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43636#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 43633#L42-4 havoc main_~k~0#1; 43591#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43592#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43710#L42-3 [2023-11-06 22:37:38,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:38,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 4 times [2023-11-06 22:37:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:38,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544060216] [2023-11-06 22:37:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:38,902 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:38,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387669439] [2023-11-06 22:37:38,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:37:38,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:38,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:38,908 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:38,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2023-11-06 22:37:39,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:37:39,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:39,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:39,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:39,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:39,048 INFO L85 PathProgramCache]: Analyzing trace with hash -366596464, now seen corresponding path program 4 times [2023-11-06 22:37:39,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:39,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911077413] [2023-11-06 22:37:39,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:39,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:39,057 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:39,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1973107330] [2023-11-06 22:37:39,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:37:39,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:39,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:39,064 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:39,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2023-11-06 22:37:39,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:37:39,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:39,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:37:39,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 505 proven. 60 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2023-11-06 22:37:39,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 49 proven. 230 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2023-11-06 22:37:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911077413] [2023-11-06 22:37:39,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973107330] [2023-11-06 22:37:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973107330] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:39,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:39,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2023-11-06 22:37:39,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692098749] [2023-11-06 22:37:39,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:39,694 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:39,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:37:39,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:37:39,695 INFO L87 Difference]: Start difference. First operand 1033 states and 1495 transitions. cyclomatic complexity: 484 Second operand has 16 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 16 states have internal predecessors, (50), 11 states have call successors, (22), 2 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 11 states have call successors, (22) [2023-11-06 22:37:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:40,146 INFO L93 Difference]: Finished difference Result 1206 states and 1683 transitions. [2023-11-06 22:37:40,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1206 states and 1683 transitions. [2023-11-06 22:37:40,157 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2023-11-06 22:37:40,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1206 states to 1154 states and 1597 transitions. [2023-11-06 22:37:40,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 406 [2023-11-06 22:37:40,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 406 [2023-11-06 22:37:40,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1597 transitions. [2023-11-06 22:37:40,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:40,172 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1154 states and 1597 transitions. [2023-11-06 22:37:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1597 transitions. [2023-11-06 22:37:40,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1033. [2023-11-06 22:37:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 667 states have (on average 1.1169415292353824) internal successors, (745), 680 states have internal predecessors, (745), 220 states have call successors, (226), 102 states have call predecessors, (226), 146 states have return successors, (486), 250 states have call predecessors, (486), 220 states have call successors, (486) [2023-11-06 22:37:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1457 transitions. [2023-11-06 22:37:40,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1033 states and 1457 transitions. [2023-11-06 22:37:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:37:40,213 INFO L428 stractBuchiCegarLoop]: Abstraction has 1033 states and 1457 transitions. [2023-11-06 22:37:40,213 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-11-06 22:37:40,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1033 states and 1457 transitions. [2023-11-06 22:37:40,218 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 108 [2023-11-06 22:37:40,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:40,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:40,220 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] [2023-11-06 22:37:40,220 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] [2023-11-06 22:37:40,220 INFO L748 eck$LassoCheckResult]: Stem: 46656#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 46600#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 46601#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; 46622#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; 46610#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 46611#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 47046#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; 46592#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46593#$Ultimate##0 ~n := #in~n; 47034#L25 assume ~n <= 0;#res := 1; 47033#factFINAL assume true; 47029#factEXIT >#72#return; 46649#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46650#$Ultimate##0 ~n := #in~n; 47384#L25 assume ~n <= 0;#res := 1; 47381#factFINAL assume true; 47377#factEXIT >#74#return; 47373#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 47374#$Ultimate##0 ~n := #in~n; 47380#L25 assume ~n <= 0;#res := 1; 47376#factFINAL assume true; 47372#factEXIT >#76#return; 47371#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; 47369#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 47366#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 47363#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 47357#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; 47354#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 47355#$Ultimate##0 ~n := #in~n; 47392#L25 assume !(~n <= 0); 47386#L26 call #t~ret0 := fact(~n - 1);< 47388#$Ultimate##0 ~n := #in~n; 47393#L25 assume ~n <= 0;#res := 1; 47390#factFINAL assume true; 47389#factEXIT >#70#return; 47383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47379#factFINAL assume true; 47375#factEXIT >#78#return; 46645#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46651#$Ultimate##0 ~n := #in~n; 46644#L25 assume ~n <= 0;#res := 1; 46646#factFINAL assume true; 47603#factEXIT >#80#return; 47342#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 47344#$Ultimate##0 ~n := #in~n; 47365#L25 assume !(~n <= 0); 47360#L26 call #t~ret0 := fact(~n - 1);< 47362#$Ultimate##0 ~n := #in~n; 47367#L25 assume ~n <= 0;#res := 1; 47364#factFINAL assume true; 47358#factEXIT >#70#return; 47356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47352#factFINAL assume true; 47341#factEXIT >#82#return; 47343#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; 47101#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 47102#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 46781#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 46779#L42-4 havoc main_~k~0#1; 46620#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 46621#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 46770#L42-3 [2023-11-06 22:37:40,221 INFO L750 eck$LassoCheckResult]: Loop: 46770#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 46767#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; 46758#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46762#$Ultimate##0 ~n := #in~n; 46765#L25 assume !(~n <= 0); 46766#L26 call #t~ret0 := fact(~n - 1);< 46777#$Ultimate##0 ~n := #in~n; 46783#L25 assume !(~n <= 0); 46775#L26 call #t~ret0 := fact(~n - 1);< 46785#$Ultimate##0 ~n := #in~n; 46786#L25 assume ~n <= 0;#res := 1; 46794#factFINAL assume true; 46793#factEXIT >#70#return; 46776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46784#factFINAL assume true; 46774#factEXIT >#70#return; 46773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46771#factFINAL assume true; 46768#factEXIT >#72#return; 46759#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46762#$Ultimate##0 ~n := #in~n; 46765#L25 assume ~n <= 0;#res := 1; 46763#factFINAL assume true; 46757#factEXIT >#74#return; 46753#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 46756#$Ultimate##0 ~n := #in~n; 46790#L25 assume !(~n <= 0); 46709#L26 call #t~ret0 := fact(~n - 1);< 46730#$Ultimate##0 ~n := #in~n; 46731#L25 assume ~n <= 0;#res := 1; 46732#factFINAL assume true; 46708#factEXIT >#70#return; 46716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46787#factFINAL assume true; 46752#factEXIT >#76#return; 46755#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; 47330#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 47329#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 47328#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 47327#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; 46692#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46702#$Ultimate##0 ~n := #in~n; 46797#L25 assume !(~n <= 0); 46710#L26 call #t~ret0 := fact(~n - 1);< 46730#$Ultimate##0 ~n := #in~n; 46728#L25 assume !(~n <= 0); 46724#L26 call #t~ret0 := fact(~n - 1);< 46727#$Ultimate##0 ~n := #in~n; 46728#L25 assume !(~n <= 0); 46724#L26 call #t~ret0 := fact(~n - 1);< 46727#$Ultimate##0 ~n := #in~n; 46729#L25 assume ~n <= 0;#res := 1; 46744#factFINAL assume true; 46739#factEXIT >#70#return; 46740#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46723#factFINAL assume true; 46725#factEXIT >#70#return; 46733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46734#factFINAL assume true; 46736#factEXIT >#70#return; 46737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47324#factFINAL assume true; 47320#factEXIT >#72#return; 46688#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46702#$Ultimate##0 ~n := #in~n; 46797#L25 assume !(~n <= 0); 46710#L26 call #t~ret0 := fact(~n - 1);< 46730#$Ultimate##0 ~n := #in~n; 46728#L25 assume !(~n <= 0); 46724#L26 call #t~ret0 := fact(~n - 1);< 46727#$Ultimate##0 ~n := #in~n; 46728#L25 assume !(~n <= 0); 46724#L26 call #t~ret0 := fact(~n - 1);< 46727#$Ultimate##0 ~n := #in~n; 46729#L25 assume ~n <= 0;#res := 1; 46744#factFINAL assume true; 46739#factEXIT >#70#return; 46740#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46723#factFINAL assume true; 46725#factEXIT >#70#return; 46733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46734#factFINAL assume true; 46736#factEXIT >#70#return; 46737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 47324#factFINAL assume true; 47320#factEXIT >#74#return; 46580#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 46876#$Ultimate##0 ~n := #in~n; 46877#L25 assume ~n <= 0;#res := 1; 46643#factFINAL assume true; 47315#factEXIT >#76#return; 47316#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; 47326#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 47325#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 47323#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 47322#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; 46672#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46702#$Ultimate##0 ~n := #in~n; 46797#L25 assume !(~n <= 0); 46710#L26 call #t~ret0 := fact(~n - 1);< 46730#$Ultimate##0 ~n := #in~n; 46728#L25 assume !(~n <= 0); 46724#L26 call #t~ret0 := fact(~n - 1);< 46727#$Ultimate##0 ~n := #in~n; 46729#L25 assume ~n <= 0;#res := 1; 46744#factFINAL assume true; 46739#factEXIT >#70#return; 46740#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46723#factFINAL assume true; 46725#factEXIT >#70#return; 46921#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46700#factFINAL assume true; 46701#factEXIT >#78#return; 46685#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46702#$Ultimate##0 ~n := #in~n; 46797#L25 assume ~n <= 0;#res := 1; 46722#factFINAL assume true; 47319#factEXIT >#80#return; 46691#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 46699#$Ultimate##0 ~n := #in~n; 46735#L25 assume !(~n <= 0); 46710#L26 call #t~ret0 := fact(~n - 1);< 46730#$Ultimate##0 ~n := #in~n; 46731#L25 assume ~n <= 0;#res := 1; 46732#factFINAL assume true; 46708#factEXIT >#70#return; 46705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46706#factFINAL assume true; 46671#factEXIT >#82#return; 46698#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; 46667#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 46668#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 46663#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 46660#L42-4 havoc main_~k~0#1; 46618#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 46619#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 46770#L42-3 [2023-11-06 22:37:40,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 5 times [2023-11-06 22:37:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798890090] [2023-11-06 22:37:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:40,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:40,228 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:40,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626396198] [2023-11-06 22:37:40,229 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:37:40,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:40,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:40,232 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:40,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2023-11-06 22:37:40,334 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-11-06 22:37:40,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:40,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:40,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:40,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:40,374 INFO L85 PathProgramCache]: Analyzing trace with hash -790982704, now seen corresponding path program 5 times [2023-11-06 22:37:40,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:40,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491901707] [2023-11-06 22:37:40,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:40,387 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630312365] [2023-11-06 22:37:40,387 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:37:40,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:40,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:40,396 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:40,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2023-11-06 22:37:40,495 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-11-06 22:37:40,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:40,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:37:40,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 438 proven. 29 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2023-11-06 22:37:40,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 24 proven. 311 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2023-11-06 22:37:41,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:41,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491901707] [2023-11-06 22:37:41,045 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:41,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630312365] [2023-11-06 22:37:41,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630312365] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:41,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:41,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2023-11-06 22:37:41,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220664162] [2023-11-06 22:37:41,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:41,046 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:41,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:41,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:37:41,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:37:41,047 INFO L87 Difference]: Start difference. First operand 1033 states and 1457 transitions. cyclomatic complexity: 445 Second operand has 15 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 10 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (24), 8 states have call predecessors, (24), 10 states have call successors, (24) [2023-11-06 22:37:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:41,357 INFO L93 Difference]: Finished difference Result 1324 states and 1845 transitions. [2023-11-06 22:37:41,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1324 states and 1845 transitions. [2023-11-06 22:37:41,366 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 134 [2023-11-06 22:37:41,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1324 states to 1296 states and 1807 transitions. [2023-11-06 22:37:41,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 447 [2023-11-06 22:37:41,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2023-11-06 22:37:41,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1296 states and 1807 transitions. [2023-11-06 22:37:41,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:41,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1296 states and 1807 transitions. [2023-11-06 22:37:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states and 1807 transitions. [2023-11-06 22:37:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1181. [2023-11-06 22:37:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 751 states have (on average 1.103861517976032) internal successors, (829), 770 states have internal predecessors, (829), 258 states have call successors, (264), 128 states have call predecessors, (264), 172 states have return successors, (592), 282 states have call predecessors, (592), 258 states have call successors, (592) [2023-11-06 22:37:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1685 transitions. [2023-11-06 22:37:41,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1181 states and 1685 transitions. [2023-11-06 22:37:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:37:41,433 INFO L428 stractBuchiCegarLoop]: Abstraction has 1181 states and 1685 transitions. [2023-11-06 22:37:41,433 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-11-06 22:37:41,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1181 states and 1685 transitions. [2023-11-06 22:37:41,439 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2023-11-06 22:37:41,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:41,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:41,442 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] [2023-11-06 22:37:41,442 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] [2023-11-06 22:37:41,443 INFO L748 eck$LassoCheckResult]: Stem: 49851#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 49793#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 49794#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; 49812#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; 49852#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 49982#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50538#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; 49791#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49792#$Ultimate##0 ~n := #in~n; 50623#L25 assume ~n <= 0;#res := 1; 50621#factFINAL assume true; 50619#factEXIT >#72#return; 49837#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 49838#$Ultimate##0 ~n := #in~n; 50673#L25 assume ~n <= 0;#res := 1; 50671#factFINAL assume true; 50667#factEXIT >#74#return; 49781#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 49782#$Ultimate##0 ~n := #in~n; 50679#L25 assume ~n <= 0;#res := 1; 50678#factFINAL assume true; 50677#factEXIT >#76#return; 50676#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; 49823#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 49824#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 50711#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50709#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; 50706#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50707#$Ultimate##0 ~n := #in~n; 50717#L25 assume !(~n <= 0); 50713#L26 call #t~ret0 := fact(~n - 1);< 50715#$Ultimate##0 ~n := #in~n; 50724#L25 assume ~n <= 0;#res := 1; 50735#factFINAL assume true; 50734#factEXIT >#70#return; 50733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50732#factFINAL assume true; 50730#factEXIT >#78#return; 50727#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50728#$Ultimate##0 ~n := #in~n; 50731#L25 assume ~n <= 0;#res := 1; 50703#factFINAL assume true; 50726#factEXIT >#80#return; 50689#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50690#$Ultimate##0 ~n := #in~n; 50700#L25 assume !(~n <= 0); 50694#L26 call #t~ret0 := fact(~n - 1);< 50697#$Ultimate##0 ~n := #in~n; 50701#L25 assume ~n <= 0;#res := 1; 50698#factFINAL assume true; 50693#factEXIT >#70#return; 50692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50691#factFINAL assume true; 50688#factEXIT >#82#return; 50687#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; 49870#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 49871#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 49974#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 49857#L42-4 havoc main_~k~0#1; 49858#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 49962#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 49803#L42-3 [2023-11-06 22:37:41,444 INFO L750 eck$LassoCheckResult]: Loop: 49803#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 49979#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; 49969#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49973#$Ultimate##0 ~n := #in~n; 49977#L25 assume !(~n <= 0); 49978#L26 call #t~ret0 := fact(~n - 1);< 49987#$Ultimate##0 ~n := #in~n; 49992#L25 assume ~n <= 0;#res := 1; 49991#factFINAL assume true; 49990#factEXIT >#70#return; 49989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49988#factFINAL assume true; 49976#factEXIT >#72#return; 49968#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 49973#$Ultimate##0 ~n := #in~n; 49977#L25 assume ~n <= 0;#res := 1; 49975#factFINAL assume true; 49967#factEXIT >#74#return; 49964#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 49965#$Ultimate##0 ~n := #in~n; 50015#L25 assume !(~n <= 0); 49914#L26 call #t~ret0 := fact(~n - 1);< 49943#$Ultimate##0 ~n := #in~n; 49940#L25 assume !(~n <= 0); 49933#L26 call #t~ret0 := fact(~n - 1);< 49938#$Ultimate##0 ~n := #in~n; 49942#L25 assume ~n <= 0;#res := 1; 50005#factFINAL assume true; 49999#factEXIT >#70#return; 50000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49932#factFINAL assume true; 49937#factEXIT >#70#return; 50002#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49994#factFINAL assume true; 49995#factEXIT >#76#return; 49961#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; 49959#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 49956#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 49954#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 49952#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; 49878#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49910#$Ultimate##0 ~n := #in~n; 49944#L25 assume !(~n <= 0); 49918#L26 call #t~ret0 := fact(~n - 1);< 49926#$Ultimate##0 ~n := #in~n; 49946#L25 assume ~n <= 0;#res := 1; 49947#factFINAL assume true; 49913#factEXIT >#70#return; 49924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50097#factFINAL assume true; 49872#factEXIT >#72#return; 49898#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 49909#$Ultimate##0 ~n := #in~n; 49930#L25 assume !(~n <= 0); 49920#L26 call #t~ret0 := fact(~n - 1);< 49943#$Ultimate##0 ~n := #in~n; 49940#L25 assume !(~n <= 0); 49933#L26 call #t~ret0 := fact(~n - 1);< 49938#$Ultimate##0 ~n := #in~n; 49942#L25 assume ~n <= 0;#res := 1; 50005#factFINAL assume true; 49999#factEXIT >#70#return; 50000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49932#factFINAL assume true; 49937#factEXIT >#70#return; 50070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49905#factFINAL assume true; 49908#factEXIT >#74#return; 49779#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 49780#$Ultimate##0 ~n := #in~n; 50128#L25 assume ~n <= 0;#res := 1; 50124#factFINAL assume true; 50114#factEXIT >#76#return; 50115#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; 50141#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 50140#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 49832#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 49833#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; 49894#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49909#$Ultimate##0 ~n := #in~n; 49930#L25 assume !(~n <= 0); 49920#L26 call #t~ret0 := fact(~n - 1);< 49943#$Ultimate##0 ~n := #in~n; 49940#L25 assume !(~n <= 0); 49933#L26 call #t~ret0 := fact(~n - 1);< 49938#$Ultimate##0 ~n := #in~n; 49942#L25 assume ~n <= 0;#res := 1; 50005#factFINAL assume true; 49999#factEXIT >#70#return; 50000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49932#factFINAL assume true; 49937#factEXIT >#70#return; 50070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 49905#factFINAL assume true; 49908#factEXIT >#78#return; 49893#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 49909#$Ultimate##0 ~n := #in~n; 49930#L25 assume !(~n <= 0); 49920#L26 call #t~ret0 := fact(~n - 1);< 49943#$Ultimate##0 ~n := #in~n; 49946#L25 assume ~n <= 0;#res := 1; 49947#factFINAL assume true; 49913#factEXIT >#70#return; 49924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50097#factFINAL assume true; 49872#factEXIT >#80#return; 49891#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 49904#$Ultimate##0 ~n := #in~n; 49957#L25 assume !(~n <= 0); 49920#L26 call #t~ret0 := fact(~n - 1);< 49943#$Ultimate##0 ~n := #in~n; 49946#L25 assume ~n <= 0;#res := 1; 49947#factFINAL assume true; 49913#factEXIT >#70#return; 49924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 50097#factFINAL assume true; 49872#factEXIT >#82#return; 49868#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; 49869#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 50132#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 49859#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 49856#L42-4 havoc main_~k~0#1; 49810#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 49802#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 49803#L42-3 [2023-11-06 22:37:41,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 6 times [2023-11-06 22:37:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:41,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133441715] [2023-11-06 22:37:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:41,458 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:41,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864939283] [2023-11-06 22:37:41,459 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:37:41,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:41,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:41,462 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:41,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2023-11-06 22:37:41,552 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-11-06 22:37:41,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:41,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:41,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:41,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:41,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1840783024, now seen corresponding path program 6 times [2023-11-06 22:37:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:41,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685056075] [2023-11-06 22:37:41,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:41,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:41,604 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671722425] [2023-11-06 22:37:41,604 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:37:41,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:41,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:41,608 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:41,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2023-11-06 22:37:41,724 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2023-11-06 22:37:41,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:41,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:37:41,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 34 proven. 121 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2023-11-06 22:37:41,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 34 proven. 122 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2023-11-06 22:37:42,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:42,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685056075] [2023-11-06 22:37:42,231 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:42,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671722425] [2023-11-06 22:37:42,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671722425] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:42,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:42,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 14 [2023-11-06 22:37:42,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157268877] [2023-11-06 22:37:42,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:42,233 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:42,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:42,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:37:42,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:37:42,234 INFO L87 Difference]: Start difference. First operand 1181 states and 1685 transitions. cyclomatic complexity: 525 Second operand has 15 states, 12 states have (on average 3.0) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-06 22:37:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:42,721 INFO L93 Difference]: Finished difference Result 1313 states and 1863 transitions. [2023-11-06 22:37:42,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1313 states and 1863 transitions. [2023-11-06 22:37:42,731 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 133 [2023-11-06 22:37:42,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1313 states to 1253 states and 1773 transitions. [2023-11-06 22:37:42,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 439 [2023-11-06 22:37:42,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 439 [2023-11-06 22:37:42,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1253 states and 1773 transitions. [2023-11-06 22:37:42,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:42,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1253 states and 1773 transitions. [2023-11-06 22:37:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states and 1773 transitions. [2023-11-06 22:37:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1169. [2023-11-06 22:37:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 741 states have (on average 1.1025641025641026) internal successors, (817), 760 states have internal predecessors, (817), 256 states have call successors, (262), 128 states have call predecessors, (262), 172 states have return successors, (578), 280 states have call predecessors, (578), 256 states have call successors, (578) [2023-11-06 22:37:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1657 transitions. [2023-11-06 22:37:42,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1169 states and 1657 transitions. [2023-11-06 22:37:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:37:42,808 INFO L428 stractBuchiCegarLoop]: Abstraction has 1169 states and 1657 transitions. [2023-11-06 22:37:42,808 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-11-06 22:37:42,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1169 states and 1657 transitions. [2023-11-06 22:37:42,814 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 106 [2023-11-06 22:37:42,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:42,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:42,816 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] [2023-11-06 22:37:42,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 9, 9, 9, 9, 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] [2023-11-06 22:37:42,816 INFO L748 eck$LassoCheckResult]: Stem: 53111#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 53061#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 53062#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; 53082#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; 53112#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 53236#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 53776#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; 53053#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53054#$Ultimate##0 ~n := #in~n; 53839#L25 assume ~n <= 0;#res := 1; 53835#factFINAL assume true; 53817#factEXIT >#72#return; 53102#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53103#$Ultimate##0 ~n := #in~n; 53911#L25 assume ~n <= 0;#res := 1; 53910#factFINAL assume true; 53909#factEXIT >#74#return; 53049#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53050#$Ultimate##0 ~n := #in~n; 53935#L25 assume ~n <= 0;#res := 1; 53934#factFINAL assume true; 53933#factEXIT >#76#return; 53932#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; 53090#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 53091#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54017#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54015#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; 53977#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53978#$Ultimate##0 ~n := #in~n; 53990#L25 assume !(~n <= 0); 53988#L26 call #t~ret0 := fact(~n - 1);< 53989#$Ultimate##0 ~n := #in~n; 53992#L25 assume ~n <= 0;#res := 1; 53991#factFINAL assume true; 53987#factEXIT >#70#return; 53986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53985#factFINAL assume true; 53983#factEXIT >#78#return; 53981#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53982#$Ultimate##0 ~n := #in~n; 53984#L25 assume ~n <= 0;#res := 1; 53973#factFINAL assume true; 53980#factEXIT >#80#return; 53115#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53116#$Ultimate##0 ~n := #in~n; 53974#L25 assume !(~n <= 0); 53953#L26 call #t~ret0 := fact(~n - 1);< 53956#$Ultimate##0 ~n := #in~n; 54004#L25 assume ~n <= 0;#res := 1; 53959#factFINAL assume true; 53952#factEXIT >#70#return; 53951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53949#factFINAL assume true; 53922#factEXIT >#82#return; 53923#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; 53926#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 53999#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 53124#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 53125#L42-4 havoc main_~k~0#1; 53080#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 53081#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 53072#L42-3 [2023-11-06 22:37:42,817 INFO L750 eck$LassoCheckResult]: Loop: 53072#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 53307#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; 53298#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53302#$Ultimate##0 ~n := #in~n; 53305#L25 assume !(~n <= 0); 53306#L26 call #t~ret0 := fact(~n - 1);< 53314#$Ultimate##0 ~n := #in~n; 53320#L25 assume ~n <= 0;#res := 1; 53316#factFINAL assume true; 53313#factEXIT >#70#return; 53310#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53309#factFINAL assume true; 53304#factEXIT >#72#return; 53299#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53302#$Ultimate##0 ~n := #in~n; 53305#L25 assume ~n <= 0;#res := 1; 53303#factFINAL assume true; 53296#factEXIT >#74#return; 53293#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53294#$Ultimate##0 ~n := #in~n; 53311#L25 assume !(~n <= 0); 53248#L26 call #t~ret0 := fact(~n - 1);< 53276#$Ultimate##0 ~n := #in~n; 53277#L25 assume ~n <= 0;#res := 1; 53278#factFINAL assume true; 53270#factEXIT >#70#return; 53272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53295#factFINAL assume true; 53292#factEXIT >#76#return; 53291#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; 53290#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 53289#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 53288#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 53287#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; 53162#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53285#$Ultimate##0 ~n := #in~n; 53280#L25 assume !(~n <= 0); 53260#L26 call #t~ret0 := fact(~n - 1);< 53261#$Ultimate##0 ~n := #in~n; 53277#L25 assume ~n <= 0;#res := 1; 53278#factFINAL assume true; 53270#factEXIT >#70#return; 53273#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53402#factFINAL assume true; 53139#factEXIT >#72#return; 53148#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53241#$Ultimate##0 ~n := #in~n; 53327#L25 assume !(~n <= 0); 53249#L26 call #t~ret0 := fact(~n - 1);< 53276#$Ultimate##0 ~n := #in~n; 53266#L25 assume !(~n <= 0); 53253#L26 call #t~ret0 := fact(~n - 1);< 53265#$Ultimate##0 ~n := #in~n; 53268#L25 assume ~n <= 0;#res := 1; 53334#factFINAL assume true; 53331#factEXIT >#70#return; 53279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53262#factFINAL assume true; 53263#factEXIT >#70#return; 53242#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53243#factFINAL assume true; 53398#factEXIT >#74#return; 53400#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53048#$Ultimate##0 ~n := #in~n; 53433#L25 assume ~n <= 0;#res := 1; 53384#factFINAL assume true; 53430#factEXIT >#76#return; 53431#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; 53446#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 53110#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 53093#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 53086#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; 53087#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53241#$Ultimate##0 ~n := #in~n; 53327#L25 assume !(~n <= 0); 53249#L26 call #t~ret0 := fact(~n - 1);< 53276#$Ultimate##0 ~n := #in~n; 53266#L25 assume !(~n <= 0); 53253#L26 call #t~ret0 := fact(~n - 1);< 53265#$Ultimate##0 ~n := #in~n; 53268#L25 assume ~n <= 0;#res := 1; 53334#factFINAL assume true; 53331#factEXIT >#70#return; 53279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53262#factFINAL assume true; 53263#factEXIT >#70#return; 53242#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53243#factFINAL assume true; 53398#factEXIT >#78#return; 53155#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53241#$Ultimate##0 ~n := #in~n; 53327#L25 assume !(~n <= 0); 53249#L26 call #t~ret0 := fact(~n - 1);< 53276#$Ultimate##0 ~n := #in~n; 53277#L25 assume ~n <= 0;#res := 1; 53278#factFINAL assume true; 53270#factEXIT >#70#return; 53273#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53402#factFINAL assume true; 53139#factEXIT >#80#return; 53158#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53114#$Ultimate##0 ~n := #in~n; 53284#L25 assume !(~n <= 0); 53249#L26 call #t~ret0 := fact(~n - 1);< 53276#$Ultimate##0 ~n := #in~n; 53277#L25 assume ~n <= 0;#res := 1; 53278#factFINAL assume true; 53270#factEXIT >#70#return; 53273#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53402#factFINAL assume true; 53139#factEXIT >#82#return; 53165#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; 53429#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 53122#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 53123#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 53117#L42-4 havoc main_~k~0#1; 53079#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 53071#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 53072#L42-3 [2023-11-06 22:37:42,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:42,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 7 times [2023-11-06 22:37:42,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:42,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616953545] [2023-11-06 22:37:42,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:42,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:42,825 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:42,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533593069] [2023-11-06 22:37:42,825 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:37:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:42,829 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:42,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2023-11-06 22:37:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:42,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:42,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:42,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash 603768848, now seen corresponding path program 7 times [2023-11-06 22:37:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233302941] [2023-11-06 22:37:42,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:42,967 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:42,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696490847] [2023-11-06 22:37:42,967 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:37:42,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:42,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:42,976 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:42,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2023-11-06 22:37:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:43,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:37:43,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 434 proven. 26 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2023-11-06 22:37:43,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 74 proven. 115 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2023-11-06 22:37:43,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:43,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233302941] [2023-11-06 22:37:43,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:43,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696490847] [2023-11-06 22:37:43,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696490847] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:43,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:43,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2023-11-06 22:37:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489480594] [2023-11-06 22:37:43,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:43,464 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:43,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:43,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:37:43,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:37:43,465 INFO L87 Difference]: Start difference. First operand 1169 states and 1657 transitions. cyclomatic complexity: 509 Second operand has 15 states, 12 states have (on average 3.75) internal successors, (45), 15 states have internal predecessors, (45), 9 states have call successors, (20), 2 states have call predecessors, (20), 5 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-06 22:37:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:43,905 INFO L93 Difference]: Finished difference Result 1258 states and 1761 transitions. [2023-11-06 22:37:43,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1258 states and 1761 transitions. [2023-11-06 22:37:43,955 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 128 [2023-11-06 22:37:43,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1258 states to 1258 states and 1761 transitions. [2023-11-06 22:37:43,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 436 [2023-11-06 22:37:43,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 436 [2023-11-06 22:37:43,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1258 states and 1761 transitions. [2023-11-06 22:37:43,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:43,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1258 states and 1761 transitions. [2023-11-06 22:37:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states and 1761 transitions. [2023-11-06 22:37:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1181. [2023-11-06 22:37:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 751 states have (on average 1.1011984021304926) internal successors, (827), 770 states have internal predecessors, (827), 258 states have call successors, (264), 128 states have call predecessors, (264), 172 states have return successors, (576), 282 states have call predecessors, (576), 258 states have call successors, (576) [2023-11-06 22:37:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1667 transitions. [2023-11-06 22:37:44,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1181 states and 1667 transitions. [2023-11-06 22:37:44,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:37:44,022 INFO L428 stractBuchiCegarLoop]: Abstraction has 1181 states and 1667 transitions. [2023-11-06 22:37:44,022 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-11-06 22:37:44,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1181 states and 1667 transitions. [2023-11-06 22:37:44,029 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2023-11-06 22:37:44,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:44,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:44,031 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] [2023-11-06 22:37:44,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 9, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:44,032 INFO L748 eck$LassoCheckResult]: Stem: 56273#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 56214#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 56215#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; 56239#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; 56226#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 56228#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56962#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; 56212#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56213#$Ultimate##0 ~n := #in~n; 57007#L25 assume ~n <= 0;#res := 1; 57006#factFINAL assume true; 57002#factEXIT >#72#return; 56263#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56264#$Ultimate##0 ~n := #in~n; 57092#L25 assume ~n <= 0;#res := 1; 57091#factFINAL assume true; 57055#factEXIT >#74#return; 56204#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56205#$Ultimate##0 ~n := #in~n; 57102#L25 assume ~n <= 0;#res := 1; 57101#factFINAL assume true; 57100#factEXIT >#76#return; 57099#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; 56250#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 56251#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57123#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57122#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; 57119#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57121#$Ultimate##0 ~n := #in~n; 57148#L25 assume !(~n <= 0); 57144#L26 call #t~ret0 := fact(~n - 1);< 57145#$Ultimate##0 ~n := #in~n; 57155#L25 assume ~n <= 0;#res := 1; 57159#factFINAL assume true; 57158#factEXIT >#70#return; 57157#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57156#factFINAL assume true; 57118#factEXIT >#78#return; 57120#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57138#$Ultimate##0 ~n := #in~n; 57126#L25 assume ~n <= 0;#res := 1; 57124#factFINAL assume true; 57125#factEXIT >#80#return; 57106#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57108#$Ultimate##0 ~n := #in~n; 57137#L25 assume !(~n <= 0); 57130#L26 call #t~ret0 := fact(~n - 1);< 57133#$Ultimate##0 ~n := #in~n; 57136#L25 assume ~n <= 0;#res := 1; 57134#factFINAL assume true; 57129#factEXIT >#70#return; 57132#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57146#factFINAL assume true; 57105#factEXIT >#82#return; 57107#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; 57032#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 57033#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56282#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 56283#L42-4 havoc main_~k~0#1; 56237#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 56238#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 56400#L42-3 [2023-11-06 22:37:44,032 INFO L750 eck$LassoCheckResult]: Loop: 56400#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56397#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; 56387#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56391#$Ultimate##0 ~n := #in~n; 56394#L25 assume !(~n <= 0); 56395#L26 call #t~ret0 := fact(~n - 1);< 56404#$Ultimate##0 ~n := #in~n; 56410#L25 assume ~n <= 0;#res := 1; 56409#factFINAL assume true; 56403#factEXIT >#70#return; 56401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56398#factFINAL assume true; 56393#factEXIT >#72#return; 56388#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56391#$Ultimate##0 ~n := #in~n; 56394#L25 assume ~n <= 0;#res := 1; 56392#factFINAL assume true; 56385#factEXIT >#74#return; 56382#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56383#$Ultimate##0 ~n := #in~n; 56396#L25 assume !(~n <= 0); 56332#L26 call #t~ret0 := fact(~n - 1);< 56361#$Ultimate##0 ~n := #in~n; 56364#L25 assume ~n <= 0;#res := 1; 56365#factFINAL assume true; 56355#factEXIT >#70#return; 56358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56384#factFINAL assume true; 56381#factEXIT >#76#return; 56379#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; 56378#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 56374#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56372#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56371#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; 56299#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56367#$Ultimate##0 ~n := #in~n; 56362#L25 assume !(~n <= 0); 56344#L26 call #t~ret0 := fact(~n - 1);< 56345#$Ultimate##0 ~n := #in~n; 56364#L25 assume ~n <= 0;#res := 1; 56365#factFINAL assume true; 56355#factEXIT >#70#return; 56357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56508#factFINAL assume true; 56288#factEXIT >#72#return; 56310#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56327#$Ultimate##0 ~n := #in~n; 56433#L25 assume !(~n <= 0); 56334#L26 call #t~ret0 := fact(~n - 1);< 56361#$Ultimate##0 ~n := #in~n; 56364#L25 assume ~n <= 0;#res := 1; 56365#factFINAL assume true; 56355#factEXIT >#70#return; 56357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56508#factFINAL assume true; 56288#factEXIT >#74#return; 56319#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56461#$Ultimate##0 ~n := #in~n; 56470#L25 assume ~n <= 0;#res := 1; 56471#factFINAL assume true; 56517#factEXIT >#76#return; 56516#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; 56515#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 56514#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56513#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56512#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; 56301#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56327#$Ultimate##0 ~n := #in~n; 56433#L25 assume !(~n <= 0); 56334#L26 call #t~ret0 := fact(~n - 1);< 56361#$Ultimate##0 ~n := #in~n; 56351#L25 assume !(~n <= 0); 56339#L26 call #t~ret0 := fact(~n - 1);< 56350#$Ultimate##0 ~n := #in~n; 56353#L25 assume ~n <= 0;#res := 1; 56420#factFINAL assume true; 56414#factEXIT >#70#return; 56415#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56346#factFINAL assume true; 56347#factEXIT >#70#return; 56499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56510#factFINAL assume true; 56504#factEXIT >#78#return; 56289#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56327#$Ultimate##0 ~n := #in~n; 56433#L25 assume !(~n <= 0); 56334#L26 call #t~ret0 := fact(~n - 1);< 56361#$Ultimate##0 ~n := #in~n; 56364#L25 assume ~n <= 0;#res := 1; 56365#factFINAL assume true; 56355#factEXIT >#70#return; 56357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56508#factFINAL assume true; 56288#factEXIT >#80#return; 56305#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56322#$Ultimate##0 ~n := #in~n; 56377#L25 assume !(~n <= 0); 56334#L26 call #t~ret0 := fact(~n - 1);< 56361#$Ultimate##0 ~n := #in~n; 56364#L25 assume ~n <= 0;#res := 1; 56365#factFINAL assume true; 56355#factEXIT >#70#return; 56357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56508#factFINAL assume true; 56288#factEXIT >#82#return; 56317#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; 56284#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 56285#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56278#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 56275#L42-4 havoc main_~k~0#1; 56235#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 56236#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 56400#L42-3 [2023-11-06 22:37:44,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 8 times [2023-11-06 22:37:44,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:44,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77554490] [2023-11-06 22:37:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:44,041 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1074191140] [2023-11-06 22:37:44,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:44,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:44,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:44,045 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:44,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2023-11-06 22:37:44,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:44,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:44,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:44,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:44,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1812156592, now seen corresponding path program 8 times [2023-11-06 22:37:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:44,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418185807] [2023-11-06 22:37:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:44,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:44,191 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894006073] [2023-11-06 22:37:44,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:44,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:44,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:44,195 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:44,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2023-11-06 22:37:44,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:44,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:44,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:44,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:44,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash 696833001, now seen corresponding path program 9 times [2023-11-06 22:37:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:44,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008199817] [2023-11-06 22:37:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:44,412 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:44,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086445147] [2023-11-06 22:37:44,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:37:44,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:44,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:44,416 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:44,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2023-11-06 22:37:44,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2023-11-06 22:37:44,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:44,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:37:44,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 67 proven. 85 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2023-11-06 22:37:44,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 51 proven. 101 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2023-11-06 22:37:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008199817] [2023-11-06 22:37:45,077 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:45,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086445147] [2023-11-06 22:37:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086445147] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:45,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:45,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2023-11-06 22:37:45,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179501913] [2023-11-06 22:37:45,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:46,410 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:46,410 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:46,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:46,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:46,410 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:37:46,411 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:46,411 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:46,411 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:46,411 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration22_Loop [2023-11-06 22:37:46,411 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:46,411 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:46,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,515 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:46,515 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:37:46,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:46,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:46,520 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:46,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:37:46,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:46,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2023-11-06 22:37:46,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:46,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:46,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:46,554 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:46,557 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:37:46,557 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:37:46,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2023-11-06 22:37:46,592 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:37:46,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:46,596 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:37:46,596 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:37:46,596 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:37:46,596 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:37:46,596 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:37:46,596 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:46,596 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:37:46,596 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:37:46,596 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration22_Loop [2023-11-06 22:37:46,596 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:37:46,596 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:37:46,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:37:46,703 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:37:46,703 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:37:46,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:46,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:46,705 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:46,713 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 [2023-11-06 22:37:46,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:46,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:46,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:46,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:46,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:46,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:46,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:46,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2023-11-06 22:37:46,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:37:46,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:46,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:46,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:46,742 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:46,745 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 [2023-11-06 22:37:46,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:37:46,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:37:46,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:37:46,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:37:46,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:37:46,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:37:46,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:37:46,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2023-11-06 22:37:46,772 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:37:46,778 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:37:46,778 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:37:46,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:37:46,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:46,782 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:46,784 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:37:46,784 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:37:46,784 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:37:46,784 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 3 Supporting invariants [] [2023-11-06 22:37:46,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2023-11-06 22:37:46,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:46,788 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:37:46,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:46,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:37:46,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:47,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-06 22:37:47,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:47,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 5 proven. 107 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2023-11-06 22:37:47,742 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2023-11-06 22:37:47,742 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1181 states and 1667 transitions. cyclomatic complexity: 507 Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-06 22:37:48,074 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1181 states and 1667 transitions. cyclomatic complexity: 507. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Result 2578 states and 3571 transitions. Complement of second has 34 states. [2023-11-06 22:37:48,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2023-11-06 22:37:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-06 22:37:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2023-11-06 22:37:48,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 81 transitions. Stem has 61 letters. Loop has 112 letters. [2023-11-06 22:37:48,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:48,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 81 transitions. Stem has 173 letters. Loop has 112 letters. [2023-11-06 22:37:48,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:48,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 81 transitions. Stem has 61 letters. Loop has 224 letters. [2023-11-06 22:37:48,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:37:48,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2578 states and 3571 transitions. [2023-11-06 22:37:48,099 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 94 [2023-11-06 22:37:48,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2578 states to 1482 states and 2075 transitions. [2023-11-06 22:37:48,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 442 [2023-11-06 22:37:48,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 444 [2023-11-06 22:37:48,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1482 states and 2075 transitions. [2023-11-06 22:37:48,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:48,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1482 states and 2075 transitions. [2023-11-06 22:37:48,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states and 2075 transitions. [2023-11-06 22:37:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1451. [2023-11-06 22:37:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 925 states have (on average 1.1005405405405406) internal successors, (1018), 946 states have internal predecessors, (1018), 317 states have call successors, (323), 159 states have call predecessors, (323), 209 states have return successors, (700), 345 states have call predecessors, (700), 317 states have call successors, (700) [2023-11-06 22:37:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2041 transitions. [2023-11-06 22:37:48,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1451 states and 2041 transitions. [2023-11-06 22:37:48,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:48,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:37:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:37:48,165 INFO L87 Difference]: Start difference. First operand 1451 states and 2041 transitions. Second operand has 15 states, 12 states have (on average 4.916666666666667) internal successors, (59), 15 states have internal predecessors, (59), 9 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2023-11-06 22:37:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:48,739 INFO L93 Difference]: Finished difference Result 1905 states and 2845 transitions. [2023-11-06 22:37:48,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1905 states and 2845 transitions. [2023-11-06 22:37:48,752 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 186 [2023-11-06 22:37:48,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1905 states to 1753 states and 2597 transitions. [2023-11-06 22:37:48,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 569 [2023-11-06 22:37:48,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 569 [2023-11-06 22:37:48,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1753 states and 2597 transitions. [2023-11-06 22:37:48,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:48,777 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1753 states and 2597 transitions. [2023-11-06 22:37:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states and 2597 transitions. [2023-11-06 22:37:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1514. [2023-11-06 22:37:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 962 states have (on average 1.0997920997920998) internal successors, (1058), 984 states have internal predecessors, (1058), 343 states have call successors, (349), 159 states have call predecessors, (349), 209 states have return successors, (747), 370 states have call predecessors, (747), 343 states have call successors, (747) [2023-11-06 22:37:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2154 transitions. [2023-11-06 22:37:48,828 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1514 states and 2154 transitions. [2023-11-06 22:37:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:37:48,829 INFO L428 stractBuchiCegarLoop]: Abstraction has 1514 states and 2154 transitions. [2023-11-06 22:37:48,829 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2023-11-06 22:37:48,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1514 states and 2154 transitions. [2023-11-06 22:37:48,836 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 112 [2023-11-06 22:37:48,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:48,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:48,838 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:48,838 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:48,838 INFO L748 eck$LassoCheckResult]: Stem: 65041#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 64991#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 64992#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; 65012#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; 65042#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 65194#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 65193#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; 64985#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64986#$Ultimate##0 ~n := #in~n; 65349#L25 assume ~n <= 0;#res := 1; 65348#factFINAL assume true; 65345#factEXIT >#72#return; 65032#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 65033#$Ultimate##0 ~n := #in~n; 65369#L25 assume ~n <= 0;#res := 1; 65368#factFINAL assume true; 65367#factEXIT >#74#return; 64981#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 64982#$Ultimate##0 ~n := #in~n; 65375#L25 assume ~n <= 0;#res := 1; 65376#factFINAL assume true; 65372#factEXIT >#76#return; 65363#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; 65364#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 65401#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 65361#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 65362#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; 64959#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64960#$Ultimate##0 ~n := #in~n; 65429#L25 assume !(~n <= 0); 65412#L26 call #t~ret0 := fact(~n - 1);< 65414#$Ultimate##0 ~n := #in~n; 65441#L25 assume ~n <= 0;#res := 1; 65442#factFINAL assume true; 65411#factEXIT >#70#return; 65413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65466#factFINAL assume true; 65464#factEXIT >#78#return; 65027#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 65036#$Ultimate##0 ~n := #in~n; 65026#L25 assume ~n <= 0;#res := 1; 65028#factFINAL assume true; 65626#factEXIT >#80#return; 65043#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 65044#$Ultimate##0 ~n := #in~n; 65457#L25 assume !(~n <= 0); 65458#L26 call #t~ret0 := fact(~n - 1);< 64998#$Ultimate##0 ~n := #in~n; 65578#L25 assume ~n <= 0;#res := 1; 65577#factFINAL assume true; 65575#factEXIT >#70#return; 65574#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65573#factFINAL assume true; 65572#factEXIT >#82#return; 65571#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; 65570#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 65569#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 65568#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 65567#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; 65525#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 65530#$Ultimate##0 ~n := #in~n; 65632#L25 assume !(~n <= 0); 65539#L26 call #t~ret0 := fact(~n - 1);< 65551#$Ultimate##0 ~n := #in~n; 65562#L25 assume !(~n <= 0); 65541#L26 call #t~ret0 := fact(~n - 1);< 65559#$Ultimate##0 ~n := #in~n; 65563#L25 assume ~n <= 0;#res := 1; 65561#factFINAL assume true; 65558#factEXIT >#70#return; 65554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65549#factFINAL assume true; 65535#factEXIT >#70#return; 65533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65531#factFINAL assume true; 65523#factEXIT >#78#return; 65451#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 65516#$Ultimate##0 ~n := #in~n; 65583#L25 assume ~n <= 0;#res := 1; 65582#factFINAL assume true; 65581#factEXIT >#80#return; 65437#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 65476#$Ultimate##0 ~n := #in~n; 65463#L25 assume !(~n <= 0); 65396#L26 call #t~ret0 := fact(~n - 1);< 65400#$Ultimate##0 ~n := #in~n; 65426#L25 assume !(~n <= 0); 65390#L26 call #t~ret0 := fact(~n - 1);< 65403#$Ultimate##0 ~n := #in~n; 65428#L25 assume ~n <= 0;#res := 1; 65435#factFINAL assume true; 65434#factEXIT >#70#return; 65433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65431#factFINAL assume true; 65430#factEXIT >#70#return; 65398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65436#factFINAL assume true; 65438#factEXIT >#82#return; 65386#L30-8 [2023-11-06 22:37:48,838 INFO L750 eck$LassoCheckResult]: Loop: 65386#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; 65416#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 65370#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 65371#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 65343#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; 65344#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 65381#$Ultimate##0 ~n := #in~n; 65432#L25 assume !(~n <= 0); 65391#L26 call #t~ret0 := fact(~n - 1);< 65405#$Ultimate##0 ~n := #in~n; 65426#L25 assume !(~n <= 0); 65390#L26 call #t~ret0 := fact(~n - 1);< 65403#$Ultimate##0 ~n := #in~n; 65426#L25 assume !(~n <= 0); 65390#L26 call #t~ret0 := fact(~n - 1);< 65403#$Ultimate##0 ~n := #in~n; 65426#L25 assume !(~n <= 0); 65390#L26 call #t~ret0 := fact(~n - 1);< 65403#$Ultimate##0 ~n := #in~n; 65428#L25 assume ~n <= 0;#res := 1; 65435#factFINAL assume true; 65434#factEXIT >#70#return; 65433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65431#factFINAL assume true; 65430#factEXIT >#70#return; 65415#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65410#factFINAL assume true; 65406#factEXIT >#70#return; 65397#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65402#factFINAL assume true; 65389#factEXIT >#70#return; 65388#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65387#factFINAL assume true; 65384#factEXIT >#78#return; 65380#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 65381#$Ultimate##0 ~n := #in~n; 65432#L25 assume ~n <= 0;#res := 1; 65424#factFINAL assume true; 65408#factEXIT >#80#return; 65382#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 65383#$Ultimate##0 ~n := #in~n; 65455#L25 assume !(~n <= 0); 65395#L26 call #t~ret0 := fact(~n - 1);< 65400#$Ultimate##0 ~n := #in~n; 65426#L25 assume !(~n <= 0); 65390#L26 call #t~ret0 := fact(~n - 1);< 65403#$Ultimate##0 ~n := #in~n; 65428#L25 assume ~n <= 0;#res := 1; 65435#factFINAL assume true; 65434#factEXIT >#70#return; 65433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65431#factFINAL assume true; 65430#factEXIT >#70#return; 65407#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 65439#factFINAL assume true; 65440#factEXIT >#82#return; 65386#L30-8 [2023-11-06 22:37:48,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:48,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 4 times [2023-11-06 22:37:48,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:48,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092911145] [2023-11-06 22:37:48,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:48,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:48,846 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:48,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1419466145] [2023-11-06 22:37:48,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:37:48,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:48,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:48,848 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:48,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2023-11-06 22:37:48,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:37:48,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:48,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:49,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:49,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:49,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1783111492, now seen corresponding path program 6 times [2023-11-06 22:37:49,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:49,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914087012] [2023-11-06 22:37:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:49,032 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:49,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14117994] [2023-11-06 22:37:49,032 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:37:49,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:49,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:49,037 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:49,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2023-11-06 22:37:49,127 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-11-06 22:37:49,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:49,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:37:49,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 52 proven. 70 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-06 22:37:49,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 52 proven. 80 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-06 22:37:49,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:49,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914087012] [2023-11-06 22:37:49,886 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:49,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14117994] [2023-11-06 22:37:49,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14117994] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:49,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:49,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 18 [2023-11-06 22:37:49,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589389490] [2023-11-06 22:37:49,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:49,887 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:49,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:49,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:37:49,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:37:49,888 INFO L87 Difference]: Start difference. First operand 1514 states and 2154 transitions. cyclomatic complexity: 667 Second operand has 19 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 11 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 10 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-06 22:37:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:50,488 INFO L93 Difference]: Finished difference Result 1979 states and 2839 transitions. [2023-11-06 22:37:50,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1979 states and 2839 transitions. [2023-11-06 22:37:50,504 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 183 [2023-11-06 22:37:50,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1979 states to 1970 states and 2830 transitions. [2023-11-06 22:37:50,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 596 [2023-11-06 22:37:50,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 596 [2023-11-06 22:37:50,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1970 states and 2830 transitions. [2023-11-06 22:37:50,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:50,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1970 states and 2830 transitions. [2023-11-06 22:37:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states and 2830 transitions. [2023-11-06 22:37:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1682. [2023-11-06 22:37:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1054 states have (on average 1.0910815939278937) internal successors, (1150), 1074 states have internal predecessors, (1150), 403 states have call successors, (409), 190 states have call predecessors, (409), 225 states have return successors, (855), 417 states have call predecessors, (855), 403 states have call successors, (855) [2023-11-06 22:37:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2414 transitions. [2023-11-06 22:37:50,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1682 states and 2414 transitions. [2023-11-06 22:37:50,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:37:50,586 INFO L428 stractBuchiCegarLoop]: Abstraction has 1682 states and 2414 transitions. [2023-11-06 22:37:50,586 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2023-11-06 22:37:50,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1682 states and 2414 transitions. [2023-11-06 22:37:50,595 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 121 [2023-11-06 22:37:50,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:50,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:50,598 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:50,598 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [29, 29, 17, 17, 17, 17, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:50,598 INFO L748 eck$LassoCheckResult]: Stem: 68904#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 68843#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 68844#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; 68865#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; 68905#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69115#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70104#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; 70101#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 70102#$Ultimate##0 ~n := #in~n; 70115#L25 assume ~n <= 0;#res := 1; 70112#factFINAL assume true; 70100#factEXIT >#72#return; 70073#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70074#$Ultimate##0 ~n := #in~n; 70078#L25 assume ~n <= 0;#res := 1; 70077#factFINAL assume true; 70072#factEXIT >#74#return; 70066#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70067#$Ultimate##0 ~n := #in~n; 70087#L25 assume ~n <= 0;#res := 1; 70085#factFINAL assume true; 70065#factEXIT >#76#return; 70063#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; 70061#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 70060#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70059#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70058#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; 70055#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 70056#$Ultimate##0 ~n := #in~n; 70089#L25 assume !(~n <= 0); 70070#L26 call #t~ret0 := fact(~n - 1);< 70071#$Ultimate##0 ~n := #in~n; 70084#L25 assume ~n <= 0;#res := 1; 70127#factFINAL assume true; 70125#factEXIT >#70#return; 70123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70121#factFINAL assume true; 70075#factEXIT >#78#return; 70017#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70018#$Ultimate##0 ~n := #in~n; 70057#L25 assume ~n <= 0;#res := 1; 70050#factFINAL assume true; 70053#factEXIT >#80#return; 69852#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69854#$Ultimate##0 ~n := #in~n; 70041#L25 assume !(~n <= 0); 70036#L26 call #t~ret0 := fact(~n - 1);< 70039#$Ultimate##0 ~n := #in~n; 70052#L25 assume ~n <= 0;#res := 1; 70047#factFINAL assume true; 70035#factEXIT >#70#return; 70033#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69855#factFINAL assume true; 69851#factEXIT >#82#return; 69853#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; 70076#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 70446#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70444#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70443#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; 68823#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 68824#$Ultimate##0 ~n := #in~n; 70460#L25 assume !(~n <= 0); 70406#L26 call #t~ret0 := fact(~n - 1);< 70418#$Ultimate##0 ~n := #in~n; 70430#L25 assume !(~n <= 0); 70408#L26 call #t~ret0 := fact(~n - 1);< 70428#$Ultimate##0 ~n := #in~n; 70431#L25 assume ~n <= 0;#res := 1; 70429#factFINAL assume true; 70427#factEXIT >#70#return; 70425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70420#factFINAL assume true; 70415#factEXIT >#70#return; 70394#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70392#factFINAL assume true; 70390#factEXIT >#78#return; 68852#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70388#$Ultimate##0 ~n := #in~n; 70466#L25 assume ~n <= 0;#res := 1; 70467#factFINAL assume true; 70482#factEXIT >#80#return; 70464#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70481#$Ultimate##0 ~n := #in~n; 70480#L25 assume !(~n <= 0); 70280#L26 call #t~ret0 := fact(~n - 1);< 70290#$Ultimate##0 ~n := #in~n; 70309#L25 assume !(~n <= 0); 70277#L26 call #t~ret0 := fact(~n - 1);< 70300#$Ultimate##0 ~n := #in~n; 70308#L25 assume ~n <= 0;#res := 1; 70306#factFINAL assume true; 70299#factEXIT >#70#return; 70298#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70296#factFINAL assume true; 70293#factEXIT >#70#return; 70295#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70463#factFINAL assume true; 70465#factEXIT >#82#return; 70260#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; 69986#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 69971#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 68916#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 68917#L42-4 havoc main_~k~0#1; 68863#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 68864#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 68855#L42-3 [2023-11-06 22:37:50,599 INFO L750 eck$LassoCheckResult]: Loop: 68855#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69104#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; 69105#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69112#$Ultimate##0 ~n := #in~n; 69120#L25 assume !(~n <= 0); 69121#L26 call #t~ret0 := fact(~n - 1);< 69125#$Ultimate##0 ~n := #in~n; 69128#L25 assume !(~n <= 0); 69282#L26 call #t~ret0 := fact(~n - 1);< 69285#$Ultimate##0 ~n := #in~n; 69288#L25 assume ~n <= 0;#res := 1; 69289#factFINAL assume true; 69287#factEXIT >#70#return; 69286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69284#factFINAL assume true; 69281#factEXIT >#70#return; 69280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69279#factFINAL assume true; 69278#factEXIT >#72#return; 69107#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69112#$Ultimate##0 ~n := #in~n; 69120#L25 assume ~n <= 0;#res := 1; 69116#factFINAL assume true; 69117#factEXIT >#74#return; 69040#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69253#$Ultimate##0 ~n := #in~n; 69190#L25 assume !(~n <= 0); 68973#L26 call #t~ret0 := fact(~n - 1);< 69026#$Ultimate##0 ~n := #in~n; 69048#L25 assume !(~n <= 0); 68976#L26 call #t~ret0 := fact(~n - 1);< 69044#$Ultimate##0 ~n := #in~n; 69047#L25 assume ~n <= 0;#res := 1; 69046#factFINAL assume true; 69043#factEXIT >#70#return; 69042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69029#factFINAL assume true; 69021#factEXIT >#70#return; 69025#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69427#factFINAL assume true; 69152#factEXIT >#76#return; 69141#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; 69092#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 69091#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69090#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69089#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; 68921#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 68955#$Ultimate##0 ~n := #in~n; 69028#L25 assume !(~n <= 0); 68975#L26 call #t~ret0 := fact(~n - 1);< 69007#$Ultimate##0 ~n := #in~n; 69048#L25 assume !(~n <= 0); 68976#L26 call #t~ret0 := fact(~n - 1);< 69044#$Ultimate##0 ~n := #in~n; 69048#L25 assume !(~n <= 0); 68976#L26 call #t~ret0 := fact(~n - 1);< 69044#$Ultimate##0 ~n := #in~n; 69047#L25 assume ~n <= 0;#res := 1; 69046#factFINAL assume true; 69043#factEXIT >#70#return; 69042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69029#factFINAL assume true; 69021#factEXIT >#70#return; 68987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69049#factFINAL assume true; 68965#factEXIT >#70#return; 68957#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68958#factFINAL assume true; 68991#factEXIT >#72#return; 68945#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 68955#$Ultimate##0 ~n := #in~n; 69028#L25 assume !(~n <= 0); 68975#L26 call #t~ret0 := fact(~n - 1);< 69007#$Ultimate##0 ~n := #in~n; 69012#L25 assume ~n <= 0;#res := 1; 69008#factFINAL assume true; 68999#factEXIT >#70#return; 68998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68996#factFINAL assume true; 68919#factEXIT >#74#return; 68946#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69075#$Ultimate##0 ~n := #in~n; 69077#L25 assume !(~n <= 0); 68983#L26 call #t~ret0 := fact(~n - 1);< 69007#$Ultimate##0 ~n := #in~n; 69012#L25 assume ~n <= 0;#res := 1; 69008#factFINAL assume true; 68999#factEXIT >#70#return; 69006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69076#factFINAL assume true; 69074#factEXIT >#76#return; 69056#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; 69073#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 69072#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69071#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69070#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; 68925#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 68955#$Ultimate##0 ~n := #in~n; 69028#L25 assume !(~n <= 0); 68975#L26 call #t~ret0 := fact(~n - 1);< 69007#$Ultimate##0 ~n := #in~n; 69048#L25 assume !(~n <= 0); 68976#L26 call #t~ret0 := fact(~n - 1);< 69044#$Ultimate##0 ~n := #in~n; 69048#L25 assume !(~n <= 0); 68976#L26 call #t~ret0 := fact(~n - 1);< 69044#$Ultimate##0 ~n := #in~n; 69047#L25 assume ~n <= 0;#res := 1; 69046#factFINAL assume true; 69043#factEXIT >#70#return; 69042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69029#factFINAL assume true; 69021#factEXIT >#70#return; 68987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69049#factFINAL assume true; 68965#factEXIT >#70#return; 68957#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68958#factFINAL assume true; 68991#factEXIT >#72#return; 68931#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 68955#$Ultimate##0 ~n := #in~n; 69028#L25 assume !(~n <= 0); 68975#L26 call #t~ret0 := fact(~n - 1);< 69007#$Ultimate##0 ~n := #in~n; 69012#L25 assume ~n <= 0;#res := 1; 69008#factFINAL assume true; 68999#factEXIT >#70#return; 68998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68996#factFINAL assume true; 68919#factEXIT >#74#return; 68947#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69075#$Ultimate##0 ~n := #in~n; 69077#L25 assume ~n <= 0;#res := 1; 69058#factFINAL assume true; 69053#factEXIT >#76#return; 69051#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; 69050#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 68961#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 68962#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 68956#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; 68942#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 68955#$Ultimate##0 ~n := #in~n; 69028#L25 assume !(~n <= 0); 68975#L26 call #t~ret0 := fact(~n - 1);< 69007#$Ultimate##0 ~n := #in~n; 69048#L25 assume !(~n <= 0); 68976#L26 call #t~ret0 := fact(~n - 1);< 69044#$Ultimate##0 ~n := #in~n; 69047#L25 assume ~n <= 0;#res := 1; 69046#factFINAL assume true; 69043#factEXIT >#70#return; 69042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69029#factFINAL assume true; 69021#factEXIT >#70#return; 69015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68952#factFINAL assume true; 68954#factEXIT >#78#return; 68927#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 68955#$Ultimate##0 ~n := #in~n; 69028#L25 assume !(~n <= 0); 68975#L26 call #t~ret0 := fact(~n - 1);< 69007#$Ultimate##0 ~n := #in~n; 69012#L25 assume ~n <= 0;#res := 1; 69008#factFINAL assume true; 68999#factEXIT >#70#return; 68998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68996#factFINAL assume true; 68919#factEXIT >#80#return; 68943#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 68997#$Ultimate##0 ~n := #in~n; 69011#L25 assume !(~n <= 0); 68975#L26 call #t~ret0 := fact(~n - 1);< 69007#$Ultimate##0 ~n := #in~n; 69012#L25 assume ~n <= 0;#res := 1; 69008#factFINAL assume true; 68999#factEXIT >#70#return; 68998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 68996#factFINAL assume true; 68919#factEXIT >#82#return; 68915#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; 68914#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 68913#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 68911#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 68908#L42-4 havoc main_~k~0#1; 68862#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 68854#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 68855#L42-3 [2023-11-06 22:37:50,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash 157168703, now seen corresponding path program 10 times [2023-11-06 22:37:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:50,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814774118] [2023-11-06 22:37:50,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:50,609 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:50,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850368696] [2023-11-06 22:37:50,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:37:50,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:50,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:50,616 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:50,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2023-11-06 22:37:50,764 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:37:50,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:50,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:50,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:50,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1722619769, now seen corresponding path program 9 times [2023-11-06 22:37:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:50,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514160364] [2023-11-06 22:37:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:50,851 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:50,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132420742] [2023-11-06 22:37:50,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:37:50,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:50,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:50,856 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:50,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2023-11-06 22:37:51,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-06 22:37:51,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:51,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:37:51,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 576 proven. 73 refuted. 0 times theorem prover too weak. 1284 trivial. 0 not checked. [2023-11-06 22:37:51,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 328 proven. 105 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2023-11-06 22:37:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:51,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514160364] [2023-11-06 22:37:51,654 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:51,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132420742] [2023-11-06 22:37:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132420742] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:51,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2023-11-06 22:37:51,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144071283] [2023-11-06 22:37:51,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:51,656 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:51,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:51,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:37:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:37:51,657 INFO L87 Difference]: Start difference. First operand 1682 states and 2414 transitions. cyclomatic complexity: 759 Second operand has 16 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 16 states have internal predecessors, (50), 11 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-06 22:37:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:52,213 INFO L93 Difference]: Finished difference Result 1932 states and 2792 transitions. [2023-11-06 22:37:52,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1932 states and 2792 transitions. [2023-11-06 22:37:52,229 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 140 [2023-11-06 22:37:52,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1932 states to 1501 states and 2126 transitions. [2023-11-06 22:37:52,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 546 [2023-11-06 22:37:52,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 546 [2023-11-06 22:37:52,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1501 states and 2126 transitions. [2023-11-06 22:37:52,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:52,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1501 states and 2126 transitions. [2023-11-06 22:37:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states and 2126 transitions. [2023-11-06 22:37:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1397. [2023-11-06 22:37:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 890 states have (on average 1.0887640449438203) internal successors, (969), 908 states have internal predecessors, (969), 313 states have call successors, (319), 167 states have call predecessors, (319), 194 states have return successors, (651), 321 states have call predecessors, (651), 313 states have call successors, (651) [2023-11-06 22:37:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1939 transitions. [2023-11-06 22:37:52,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1397 states and 1939 transitions. [2023-11-06 22:37:52,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:37:52,288 INFO L428 stractBuchiCegarLoop]: Abstraction has 1397 states and 1939 transitions. [2023-11-06 22:37:52,288 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2023-11-06 22:37:52,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1397 states and 1939 transitions. [2023-11-06 22:37:52,294 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 117 [2023-11-06 22:37:52,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:52,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:52,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:52,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:52,295 INFO L748 eck$LassoCheckResult]: Stem: 73665#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 73605#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 73606#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; 73628#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; 73616#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 73618#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74312#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; 73601#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 73602#$Ultimate##0 ~n := #in~n; 74264#L25 assume ~n <= 0;#res := 1; 74263#factFINAL assume true; 74262#factEXIT >#72#return; 73650#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73651#$Ultimate##0 ~n := #in~n; 74441#L25 assume ~n <= 0;#res := 1; 74439#factFINAL assume true; 74437#factEXIT >#74#return; 74432#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74433#$Ultimate##0 ~n := #in~n; 74436#L25 assume ~n <= 0;#res := 1; 74435#factFINAL assume true; 74431#factEXIT >#76#return; 74429#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; 74427#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 74428#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74385#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74386#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; 74371#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74375#$Ultimate##0 ~n := #in~n; 74586#L25 assume !(~n <= 0); 74583#L26 call #t~ret0 := fact(~n - 1);< 74584#$Ultimate##0 ~n := #in~n; 74593#L25 assume ~n <= 0;#res := 1; 74701#factFINAL assume true; 74596#factEXIT >#70#return; 74595#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74594#factFINAL assume true; 74370#factEXIT >#78#return; 73659#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73660#$Ultimate##0 ~n := #in~n; 74565#L25 assume ~n <= 0;#res := 1; 74564#factFINAL assume true; 74562#factEXIT >#80#return; 73666#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 73667#$Ultimate##0 ~n := #in~n; 74576#L25 assume !(~n <= 0); 74569#L26 call #t~ret0 := fact(~n - 1);< 74572#$Ultimate##0 ~n := #in~n; 74575#L25 assume ~n <= 0;#res := 1; 74573#factFINAL assume true; 74568#factEXIT >#70#return; 74571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74717#factFINAL assume true; 74712#factEXIT >#82#return; 73607#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; 73608#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 74679#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74675#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74670#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; 74610#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74615#$Ultimate##0 ~n := #in~n; 74678#L25 assume !(~n <= 0); 74626#L26 call #t~ret0 := fact(~n - 1);< 74635#$Ultimate##0 ~n := #in~n; 74683#L25 assume !(~n <= 0); 74625#L26 call #t~ret0 := fact(~n - 1);< 74677#$Ultimate##0 ~n := #in~n; 74681#L25 assume ~n <= 0;#res := 1; 74680#factFINAL assume true; 74676#factEXIT >#70#return; 74672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74641#factFINAL assume true; 74624#factEXIT >#70#return; 74620#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74617#factFINAL assume true; 74609#factEXIT >#78#return; 73586#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74607#$Ultimate##0 ~n := #in~n; 74699#L25 assume ~n <= 0;#res := 1; 74700#factFINAL assume true; 73585#factEXIT >#80#return; 73587#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 73654#$Ultimate##0 ~n := #in~n; 73655#L25 assume !(~n <= 0); 74462#L26 call #t~ret0 := fact(~n - 1);< 74491#$Ultimate##0 ~n := #in~n; 74487#L25 assume !(~n <= 0); 74459#L26 call #t~ret0 := fact(~n - 1);< 74483#$Ultimate##0 ~n := #in~n; 74486#L25 assume ~n <= 0;#res := 1; 74485#factFINAL assume true; 74482#factEXIT >#70#return; 74480#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74477#factFINAL assume true; 74474#factEXIT >#70#return; 74475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74718#factFINAL assume true; 74716#factEXIT >#82#return; 74430#L30-8 [2023-11-06 22:37:52,295 INFO L750 eck$LassoCheckResult]: Loop: 74430#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; 74426#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 74391#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74392#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74376#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; 74377#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74455#$Ultimate##0 ~n := #in~n; 74505#L25 assume !(~n <= 0); 73645#L26 call #t~ret0 := fact(~n - 1);< 73612#$Ultimate##0 ~n := #in~n; 74487#L25 assume !(~n <= 0); 74459#L26 call #t~ret0 := fact(~n - 1);< 74483#$Ultimate##0 ~n := #in~n; 74487#L25 assume !(~n <= 0); 74459#L26 call #t~ret0 := fact(~n - 1);< 74483#$Ultimate##0 ~n := #in~n; 74487#L25 assume !(~n <= 0); 74459#L26 call #t~ret0 := fact(~n - 1);< 74483#$Ultimate##0 ~n := #in~n; 74486#L25 assume ~n <= 0;#res := 1; 74485#factFINAL assume true; 74482#factEXIT >#70#return; 74480#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74477#factFINAL assume true; 74474#factEXIT >#70#return; 74473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74472#factFINAL assume true; 74470#factEXIT >#70#return; 74463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74467#factFINAL assume true; 74457#factEXIT >#70#return; 74456#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74454#factFINAL assume true; 74449#factEXIT >#78#return; 74451#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74455#$Ultimate##0 ~n := #in~n; 74505#L25 assume !(~n <= 0); 73645#L26 call #t~ret0 := fact(~n - 1);< 73612#$Ultimate##0 ~n := #in~n; 74487#L25 assume !(~n <= 0); 74459#L26 call #t~ret0 := fact(~n - 1);< 74483#$Ultimate##0 ~n := #in~n; 74487#L25 assume !(~n <= 0); 74459#L26 call #t~ret0 := fact(~n - 1);< 74483#$Ultimate##0 ~n := #in~n; 74487#L25 assume !(~n <= 0); 74459#L26 call #t~ret0 := fact(~n - 1);< 74483#$Ultimate##0 ~n := #in~n; 74486#L25 assume ~n <= 0;#res := 1; 74485#factFINAL assume true; 74482#factEXIT >#70#return; 74480#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74477#factFINAL assume true; 74474#factEXIT >#70#return; 74473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74472#factFINAL assume true; 74470#factEXIT >#70#return; 74463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74467#factFINAL assume true; 74457#factEXIT >#70#return; 74456#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74454#factFINAL assume true; 74449#factEXIT >#80#return; 74450#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74453#$Ultimate##0 ~n := #in~n; 74479#L25 assume !(~n <= 0); 73645#L26 call #t~ret0 := fact(~n - 1);< 73612#$Ultimate##0 ~n := #in~n; 74487#L25 assume !(~n <= 0); 74459#L26 call #t~ret0 := fact(~n - 1);< 74483#$Ultimate##0 ~n := #in~n; 74487#L25 assume !(~n <= 0); 74459#L26 call #t~ret0 := fact(~n - 1);< 74483#$Ultimate##0 ~n := #in~n; 74487#L25 assume !(~n <= 0); 74459#L26 call #t~ret0 := fact(~n - 1);< 74483#$Ultimate##0 ~n := #in~n; 74486#L25 assume ~n <= 0;#res := 1; 74485#factFINAL assume true; 74482#factEXIT >#70#return; 74480#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74477#factFINAL assume true; 74474#factEXIT >#70#return; 74473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74472#factFINAL assume true; 74470#factEXIT >#70#return; 74463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74467#factFINAL assume true; 74457#factEXIT >#70#return; 74456#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74454#factFINAL assume true; 74449#factEXIT >#82#return; 74430#L30-8 [2023-11-06 22:37:52,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:52,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 5 times [2023-11-06 22:37:52,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:52,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943265569] [2023-11-06 22:37:52,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:52,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:52,302 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:52,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345530265] [2023-11-06 22:37:52,303 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:37:52,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:52,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:52,336 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:52,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2023-11-06 22:37:52,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-11-06 22:37:52,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:52,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:52,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:52,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 507587580, now seen corresponding path program 7 times [2023-11-06 22:37:52,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:52,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310192749] [2023-11-06 22:37:52,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:52,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:52,508 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:52,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354340845] [2023-11-06 22:37:52,508 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:37:52,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:52,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:52,516 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:52,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2023-11-06 22:37:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:52,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:37:52,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 290 proven. 140 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-11-06 22:37:52,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 26 proven. 364 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-06 22:37:54,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:54,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310192749] [2023-11-06 22:37:54,173 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:54,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354340845] [2023-11-06 22:37:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354340845] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:54,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 25 [2023-11-06 22:37:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817678192] [2023-11-06 22:37:54,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:54,174 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:54,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:37:54,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:37:54,175 INFO L87 Difference]: Start difference. First operand 1397 states and 1939 transitions. cyclomatic complexity: 567 Second operand has 25 states, 22 states have (on average 2.590909090909091) internal successors, (57), 24 states have internal predecessors, (57), 15 states have call successors, (17), 2 states have call predecessors, (17), 11 states have return successors, (22), 11 states have call predecessors, (22), 15 states have call successors, (22) [2023-11-06 22:37:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:54,913 INFO L93 Difference]: Finished difference Result 1845 states and 2917 transitions. [2023-11-06 22:37:54,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1845 states and 2917 transitions. [2023-11-06 22:37:54,926 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 161 [2023-11-06 22:37:54,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1845 states to 1836 states and 2908 transitions. [2023-11-06 22:37:54,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 655 [2023-11-06 22:37:54,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 667 [2023-11-06 22:37:54,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1836 states and 2908 transitions. [2023-11-06 22:37:54,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:54,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1836 states and 2908 transitions. [2023-11-06 22:37:54,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states and 2908 transitions. [2023-11-06 22:37:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1601. [2023-11-06 22:37:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1020 states have (on average 1.1058823529411765) internal successors, (1128), 1028 states have internal predecessors, (1128), 357 states have call successors, (363), 207 states have call predecessors, (363), 224 states have return successors, (975), 365 states have call predecessors, (975), 357 states have call successors, (975) [2023-11-06 22:37:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2466 transitions. [2023-11-06 22:37:55,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1601 states and 2466 transitions. [2023-11-06 22:37:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:37:55,008 INFO L428 stractBuchiCegarLoop]: Abstraction has 1601 states and 2466 transitions. [2023-11-06 22:37:55,008 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2023-11-06 22:37:55,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1601 states and 2466 transitions. [2023-11-06 22:37:55,015 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 122 [2023-11-06 22:37:55,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:55,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:55,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:55,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:55,016 INFO L748 eck$LassoCheckResult]: Stem: 77521#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 77459#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 77460#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; 77484#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; 77471#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 77473#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 77742#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; 77444#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 77445#$Ultimate##0 ~n := #in~n; 77845#L25 assume ~n <= 0;#res := 1; 77844#factFINAL assume true; 77843#factEXIT >#72#return; 77509#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 77510#$Ultimate##0 ~n := #in~n; 77911#L25 assume ~n <= 0;#res := 1; 77910#factFINAL assume true; 77908#factEXIT >#74#return; 77905#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 77906#$Ultimate##0 ~n := #in~n; 77909#L25 assume ~n <= 0;#res := 1; 77907#factFINAL assume true; 77904#factEXIT >#76#return; 77903#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; 77902#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 77901#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 77899#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 77897#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; 77893#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 77894#$Ultimate##0 ~n := #in~n; 77923#L25 assume !(~n <= 0); 77918#L26 call #t~ret0 := fact(~n - 1);< 77919#$Ultimate##0 ~n := #in~n; 77944#L25 assume ~n <= 0;#res := 1; 77946#factFINAL assume true; 77917#factEXIT >#70#return; 77914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77912#factFINAL assume true; 77913#factEXIT >#78#return; 77889#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 77890#$Ultimate##0 ~n := #in~n; 77920#L25 assume ~n <= 0;#res := 1; 77915#factFINAL assume true; 77916#factEXIT >#80#return; 77522#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 77523#$Ultimate##0 ~n := #in~n; 77932#L25 assume !(~n <= 0); 77925#L26 call #t~ret0 := fact(~n - 1);< 77928#$Ultimate##0 ~n := #in~n; 77931#L25 assume ~n <= 0;#res := 1; 77929#factFINAL assume true; 77924#factEXIT >#70#return; 77927#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78265#factFINAL assume true; 78264#factEXIT >#82#return; 77461#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; 77462#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 78175#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 78174#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 78173#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; 78016#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 78022#$Ultimate##0 ~n := #in~n; 78152#L25 assume !(~n <= 0); 78048#L26 call #t~ret0 := fact(~n - 1);< 78054#$Ultimate##0 ~n := #in~n; 78203#L25 assume !(~n <= 0); 78042#L26 call #t~ret0 := fact(~n - 1);< 78081#$Ultimate##0 ~n := #in~n; 78095#L25 assume ~n <= 0;#res := 1; 78089#factFINAL assume true; 78079#factEXIT >#70#return; 78077#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78071#factFINAL assume true; 78041#factEXIT >#70#return; 78038#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78032#factFINAL assume true; 78015#factEXIT >#78#return; 78001#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 78009#$Ultimate##0 ~n := #in~n; 78006#L25 assume ~n <= 0;#res := 1; 78007#factFINAL assume true; 78240#factEXIT >#80#return; 77994#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 78205#$Ultimate##0 ~n := #in~n; 78206#L25 assume !(~n <= 0); 77967#L26 call #t~ret0 := fact(~n - 1);< 77995#$Ultimate##0 ~n := #in~n; 78168#L25 assume !(~n <= 0); 77963#L26 call #t~ret0 := fact(~n - 1);< 78003#$Ultimate##0 ~n := #in~n; 78119#L25 assume ~n <= 0;#res := 1; 78166#factFINAL assume true; 78002#factEXIT >#70#return; 77998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77992#factFINAL assume true; 77988#factEXIT >#70#return; 77990#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78253#factFINAL assume true; 78251#factEXIT >#82#return; 77875#L30-8 [2023-11-06 22:37:55,017 INFO L750 eck$LassoCheckResult]: Loop: 77875#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; 77485#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 77486#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 77954#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 77953#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; 77426#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 77427#$Ultimate##0 ~n := #in~n; 78171#L25 assume !(~n <= 0); 77965#L26 call #t~ret0 := fact(~n - 1);< 77993#$Ultimate##0 ~n := #in~n; 78168#L25 assume !(~n <= 0); 77963#L26 call #t~ret0 := fact(~n - 1);< 78003#$Ultimate##0 ~n := #in~n; 78168#L25 assume !(~n <= 0); 77963#L26 call #t~ret0 := fact(~n - 1);< 78003#$Ultimate##0 ~n := #in~n; 78168#L25 assume !(~n <= 0); 77963#L26 call #t~ret0 := fact(~n - 1);< 78003#$Ultimate##0 ~n := #in~n; 78119#L25 assume ~n <= 0;#res := 1; 78166#factFINAL assume true; 78002#factEXIT >#70#return; 77998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77992#factFINAL assume true; 77988#factEXIT >#70#return; 77987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77984#factFINAL assume true; 77978#factEXIT >#70#return; 77977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77973#factFINAL assume true; 77961#factEXIT >#70#return; 77959#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77958#factFINAL assume true; 77956#factEXIT >#78#return; 77515#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 77516#$Ultimate##0 ~n := #in~n; 78172#L25 assume !(~n <= 0); 77980#L26 call #t~ret0 := fact(~n - 1);< 77986#$Ultimate##0 ~n := #in~n; 77996#L25 assume !(~n <= 0); 77466#L26 call #t~ret0 := fact(~n - 1);< 77991#$Ultimate##0 ~n := #in~n; 78117#L25 assume !(~n <= 0); 77465#L26 call #t~ret0 := fact(~n - 1);< 77467#$Ultimate##0 ~n := #in~n; 78119#L25 assume ~n <= 0;#res := 1; 78166#factFINAL assume true; 78002#factEXIT >#70#return; 77998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77992#factFINAL assume true; 77988#factEXIT >#70#return; 77987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77984#factFINAL assume true; 77978#factEXIT >#70#return; 77983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78212#factFINAL assume true; 78209#factEXIT >#80#return; 77949#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 77951#$Ultimate##0 ~n := #in~n; 78000#L25 assume !(~n <= 0); 77965#L26 call #t~ret0 := fact(~n - 1);< 77993#$Ultimate##0 ~n := #in~n; 78168#L25 assume !(~n <= 0); 77963#L26 call #t~ret0 := fact(~n - 1);< 78003#$Ultimate##0 ~n := #in~n; 78168#L25 assume !(~n <= 0); 77963#L26 call #t~ret0 := fact(~n - 1);< 78003#$Ultimate##0 ~n := #in~n; 78119#L25 assume ~n <= 0;#res := 1; 78166#factFINAL assume true; 78002#factEXIT >#70#return; 77998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77992#factFINAL assume true; 77988#factEXIT >#70#return; 77987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 77984#factFINAL assume true; 77978#factEXIT >#70#return; 77983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 78212#factFINAL assume true; 78209#factEXIT >#82#return; 77875#L30-8 [2023-11-06 22:37:55,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 6 times [2023-11-06 22:37:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698008854] [2023-11-06 22:37:55,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:55,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:55,024 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:55,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560462530] [2023-11-06 22:37:55,024 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:37:55,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:55,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:55,032 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:55,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2023-11-06 22:37:55,162 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-11-06 22:37:55,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:37:55,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:55,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:55,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1020997948, now seen corresponding path program 8 times [2023-11-06 22:37:55,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:55,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42823609] [2023-11-06 22:37:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:55,219 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:55,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803194417] [2023-11-06 22:37:55,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:55,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:55,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:55,224 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:55,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2023-11-06 22:37:55,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:55,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:55,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:37:55,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 37 proven. 242 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-06 22:37:55,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 37 proven. 268 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-11-06 22:37:56,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:56,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42823609] [2023-11-06 22:37:56,776 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:37:56,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803194417] [2023-11-06 22:37:56,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803194417] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:56,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:37:56,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 22 [2023-11-06 22:37:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689922160] [2023-11-06 22:37:56,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:56,777 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:37:56,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:56,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:37:56,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:37:56,778 INFO L87 Difference]: Start difference. First operand 1601 states and 2466 transitions. cyclomatic complexity: 890 Second operand has 23 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 13 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) [2023-11-06 22:37:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:57,405 INFO L93 Difference]: Finished difference Result 2025 states and 3221 transitions. [2023-11-06 22:37:57,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2025 states and 3221 transitions. [2023-11-06 22:37:57,418 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 215 [2023-11-06 22:37:57,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2025 states to 2016 states and 3212 transitions. [2023-11-06 22:37:57,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 740 [2023-11-06 22:37:57,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 740 [2023-11-06 22:37:57,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2016 states and 3212 transitions. [2023-11-06 22:37:57,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:37:57,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2016 states and 3212 transitions. [2023-11-06 22:37:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states and 3212 transitions. [2023-11-06 22:37:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1716. [2023-11-06 22:37:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1084 states have (on average 1.1005535055350553) internal successors, (1193), 1081 states have internal predecessors, (1193), 398 states have call successors, (404), 232 states have call predecessors, (404), 234 states have return successors, (1056), 402 states have call predecessors, (1056), 398 states have call successors, (1056) [2023-11-06 22:37:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2653 transitions. [2023-11-06 22:37:57,503 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1716 states and 2653 transitions. [2023-11-06 22:37:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:37:57,504 INFO L428 stractBuchiCegarLoop]: Abstraction has 1716 states and 2653 transitions. [2023-11-06 22:37:57,504 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2023-11-06 22:37:57,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1716 states and 2653 transitions. [2023-11-06 22:37:57,512 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 134 [2023-11-06 22:37:57,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:37:57,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:37:57,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:57,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:57,513 INFO L748 eck$LassoCheckResult]: Stem: 81655#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 81601#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 81602#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; 81623#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; 81610#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 81611#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81998#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; 81589#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81590#$Ultimate##0 ~n := #in~n; 82016#L25 assume ~n <= 0;#res := 1; 82014#factFINAL assume true; 82013#factEXIT >#72#return; 81645#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81646#$Ultimate##0 ~n := #in~n; 82059#L25 assume ~n <= 0;#res := 1; 82058#factFINAL assume true; 82056#factEXIT >#74#return; 82053#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 82054#$Ultimate##0 ~n := #in~n; 82057#L25 assume ~n <= 0;#res := 1; 82055#factFINAL assume true; 82052#factEXIT >#76#return; 82051#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; 82049#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 82050#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 82042#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82043#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; 81573#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81574#$Ultimate##0 ~n := #in~n; 82424#L25 assume !(~n <= 0); 82391#L26 call #t~ret0 := fact(~n - 1);< 82393#$Ultimate##0 ~n := #in~n; 82412#L25 assume ~n <= 0;#res := 1; 82433#factFINAL assume true; 82431#factEXIT >#70#return; 82428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82427#factFINAL assume true; 82421#factEXIT >#78#return; 82371#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 82372#$Ultimate##0 ~n := #in~n; 82432#L25 assume ~n <= 0;#res := 1; 82383#factFINAL assume true; 82422#factEXIT >#80#return; 82366#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 82367#$Ultimate##0 ~n := #in~n; 82380#L25 assume !(~n <= 0); 82375#L26 call #t~ret0 := fact(~n - 1);< 82378#$Ultimate##0 ~n := #in~n; 82381#L25 assume ~n <= 0;#res := 1; 82379#factFINAL assume true; 82374#factEXIT >#70#return; 82373#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82368#factFINAL assume true; 82365#factEXIT >#82#return; 82363#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; 82362#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 82360#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 82356#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82355#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; 82217#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 82221#$Ultimate##0 ~n := #in~n; 82465#L25 assume !(~n <= 0); 82245#L26 call #t~ret0 := fact(~n - 1);< 82251#$Ultimate##0 ~n := #in~n; 82336#L25 assume !(~n <= 0); 82243#L26 call #t~ret0 := fact(~n - 1);< 82272#$Ultimate##0 ~n := #in~n; 82275#L25 assume ~n <= 0;#res := 1; 82274#factFINAL assume true; 82269#factEXIT >#70#return; 82266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82263#factFINAL assume true; 82238#factEXIT >#70#return; 82228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82224#factFINAL assume true; 82214#factEXIT >#78#return; 82190#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 82204#$Ultimate##0 ~n := #in~n; 82198#L25 assume ~n <= 0;#res := 1; 82199#factFINAL assume true; 82478#factEXIT >#80#return; 81594#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81656#$Ultimate##0 ~n := #in~n; 82466#L25 assume !(~n <= 0); 82103#L26 call #t~ret0 := fact(~n - 1);< 82135#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82148#L25 assume ~n <= 0;#res := 1; 82229#factFINAL assume true; 82142#factEXIT >#70#return; 82139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82134#factFINAL assume true; 82128#factEXIT >#70#return; 82130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82956#factFINAL assume true; 82954#factEXIT >#82#return; 81580#L30-8 [2023-11-06 22:37:57,514 INFO L750 eck$LassoCheckResult]: Loop: 81580#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; 81603#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 81624#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 82048#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82040#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; 82041#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 82097#$Ultimate##0 ~n := #in~n; 82290#L25 assume !(~n <= 0); 82109#L26 call #t~ret0 := fact(~n - 1);< 82136#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82148#L25 assume ~n <= 0;#res := 1; 82229#factFINAL assume true; 82142#factEXIT >#70#return; 82139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82134#factFINAL assume true; 82128#factEXIT >#70#return; 82127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82125#factFINAL assume true; 82120#factEXIT >#70#return; 82119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82118#factFINAL assume true; 82116#factEXIT >#70#return; 82110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82113#factFINAL assume true; 82102#factEXIT >#70#return; 82101#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82100#factFINAL assume true; 82099#factEXIT >#78#return; 82066#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 82097#$Ultimate##0 ~n := #in~n; 82290#L25 assume !(~n <= 0); 82109#L26 call #t~ret0 := fact(~n - 1);< 82136#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82148#L25 assume ~n <= 0;#res := 1; 82229#factFINAL assume true; 82142#factEXIT >#70#return; 82139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82134#factFINAL assume true; 82128#factEXIT >#70#return; 82127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82125#factFINAL assume true; 82120#factEXIT >#70#return; 82119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82118#factFINAL assume true; 82116#factEXIT >#70#return; 82110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82113#factFINAL assume true; 82102#factEXIT >#70#return; 82101#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82100#factFINAL assume true; 82099#factEXIT >#80#return; 82065#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 82358#$Ultimate##0 ~n := #in~n; 82137#L25 assume !(~n <= 0); 82109#L26 call #t~ret0 := fact(~n - 1);< 82136#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82115#L25 assume !(~n <= 0); 82106#L26 call #t~ret0 := fact(~n - 1);< 82144#$Ultimate##0 ~n := #in~n; 82148#L25 assume ~n <= 0;#res := 1; 82229#factFINAL assume true; 82142#factEXIT >#70#return; 82139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82134#factFINAL assume true; 82128#factEXIT >#70#return; 82127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82125#factFINAL assume true; 82120#factEXIT >#70#return; 82119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82118#factFINAL assume true; 82116#factEXIT >#70#return; 82110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82113#factFINAL assume true; 82102#factEXIT >#70#return; 82101#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82100#factFINAL assume true; 82099#factEXIT >#82#return; 81580#L30-8 [2023-11-06 22:37:57,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:57,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 7 times [2023-11-06 22:37:57,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:57,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879252232] [2023-11-06 22:37:57,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:57,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:57,521 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:57,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371178239] [2023-11-06 22:37:57,522 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:37:57,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:57,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:57,528 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:57,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2023-11-06 22:37:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:57,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:37:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:37:57,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:37:57,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1945461756, now seen corresponding path program 9 times [2023-11-06 22:37:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180491590] [2023-11-06 22:37:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:57,722 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:37:57,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609661468] [2023-11-06 22:37:57,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:37:57,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:57,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:57,723 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:57,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2023-11-06 22:37:57,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2023-11-06 22:37:57,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:57,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-06 22:37:57,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 125 proven. 427 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-11-06 22:37:58,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 125 proven. 516 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-11-06 22:38:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180491590] [2023-11-06 22:38:00,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609661468] [2023-11-06 22:38:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609661468] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:00,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25] total 30 [2023-11-06 22:38:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697693602] [2023-11-06 22:38:00,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:00,763 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:38:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:00,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-06 22:38:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2023-11-06 22:38:00,764 INFO L87 Difference]: Start difference. First operand 1716 states and 2653 transitions. cyclomatic complexity: 962 Second operand has 31 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 17 states have call successors, (17), 1 states have call predecessors, (17), 13 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2023-11-06 22:38:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:02,357 INFO L93 Difference]: Finished difference Result 2577 states and 4733 transitions. [2023-11-06 22:38:02,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2577 states and 4733 transitions. [2023-11-06 22:38:02,377 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 303 [2023-11-06 22:38:02,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2577 states to 2530 states and 4656 transitions. [2023-11-06 22:38:02,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 930 [2023-11-06 22:38:02,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 948 [2023-11-06 22:38:02,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2530 states and 4656 transitions. [2023-11-06 22:38:02,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:02,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2530 states and 4656 transitions. [2023-11-06 22:38:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states and 4656 transitions. [2023-11-06 22:38:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 1997. [2023-11-06 22:38:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1235 states have (on average 1.1036437246963562) internal successors, (1363), 1223 states have internal predecessors, (1363), 479 states have call successors, (485), 263 states have call predecessors, (485), 283 states have return successors, (1739), 510 states have call predecessors, (1739), 479 states have call successors, (1739) [2023-11-06 22:38:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 3587 transitions. [2023-11-06 22:38:02,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1997 states and 3587 transitions. [2023-11-06 22:38:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 22:38:02,501 INFO L428 stractBuchiCegarLoop]: Abstraction has 1997 states and 3587 transitions. [2023-11-06 22:38:02,502 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2023-11-06 22:38:02,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1997 states and 3587 transitions. [2023-11-06 22:38:02,513 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 163 [2023-11-06 22:38:02,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:38:02,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:38:02,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:02,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:02,515 INFO L748 eck$LassoCheckResult]: Stem: 86695#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 86633#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 86634#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; 86657#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; 86645#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 86646#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86970#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; 86629#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86630#$Ultimate##0 ~n := #in~n; 86988#L25 assume ~n <= 0;#res := 1; 86987#factFINAL assume true; 86986#factEXIT >#72#return; 86982#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86985#$Ultimate##0 ~n := #in~n; 86981#L25 assume ~n <= 0;#res := 1; 86983#factFINAL assume true; 86992#factEXIT >#74#return; 86925#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86929#$Ultimate##0 ~n := #in~n; 86947#L25 assume ~n <= 0;#res := 1; 86930#factFINAL assume true; 86924#factEXIT >#76#return; 86926#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; 86668#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 86669#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86694#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86662#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; 86663#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 87254#$Ultimate##0 ~n := #in~n; 87262#L25 assume !(~n <= 0); 87258#L26 call #t~ret0 := fact(~n - 1);< 87261#$Ultimate##0 ~n := #in~n; 87265#L25 assume ~n <= 0;#res := 1; 87263#factFINAL assume true; 87264#factEXIT >#70#return; 87255#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87256#factFINAL assume true; 87240#factEXIT >#78#return; 86690#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86691#$Ultimate##0 ~n := #in~n; 87491#L25 assume ~n <= 0;#res := 1; 87430#factFINAL assume true; 87487#factEXIT >#80#return; 86696#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86697#$Ultimate##0 ~n := #in~n; 87501#L25 assume !(~n <= 0); 87419#L26 call #t~ret0 := fact(~n - 1);< 87422#$Ultimate##0 ~n := #in~n; 87443#L25 assume ~n <= 0;#res := 1; 87425#factFINAL assume true; 87418#factEXIT >#70#return; 87417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87416#factFINAL assume true; 87411#factEXIT >#82#return; 86635#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; 86636#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 87640#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87639#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87638#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; 87363#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 87368#$Ultimate##0 ~n := #in~n; 87649#L25 assume !(~n <= 0); 87459#L26 call #t~ret0 := fact(~n - 1);< 87469#$Ultimate##0 ~n := #in~n; 87684#L25 assume !(~n <= 0); 87462#L26 call #t~ret0 := fact(~n - 1);< 87479#$Ultimate##0 ~n := #in~n; 87482#L25 assume ~n <= 0;#res := 1; 87481#factFINAL assume true; 87477#factEXIT >#70#return; 87475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87471#factFINAL assume true; 87454#factEXIT >#70#return; 87441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87403#factFINAL assume true; 87358#factEXIT >#78#return; 87335#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 87355#$Ultimate##0 ~n := #in~n; 87407#L25 assume ~n <= 0;#res := 1; 87408#factFINAL assume true; 87334#factEXIT >#80#return; 87321#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 87331#$Ultimate##0 ~n := #in~n; 87332#L25 assume !(~n <= 0); 87288#L26 call #t~ret0 := fact(~n - 1);< 87322#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 86687#L25 assume ~n <= 0;#res := 1; 87352#factFINAL assume true; 87327#factEXIT >#70#return; 87324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87319#factFINAL assume true; 87312#factEXIT >#70#return; 87315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87712#factFINAL assume true; 87710#factEXIT >#82#return; 87239#L30-8 [2023-11-06 22:38:02,515 INFO L750 eck$LassoCheckResult]: Loop: 87239#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; 86658#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 86659#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87191#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87192#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; 86601#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86602#$Ultimate##0 ~n := #in~n; 87578#L25 assume !(~n <= 0); 87296#L26 call #t~ret0 := fact(~n - 1);< 87320#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 86687#L25 assume ~n <= 0;#res := 1; 87352#factFINAL assume true; 87327#factEXIT >#70#return; 87324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87319#factFINAL assume true; 87312#factEXIT >#70#return; 87309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87304#factFINAL assume true; 87286#factEXIT >#70#return; 87300#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87310#factFINAL assume true; 87306#factEXIT >#70#return; 87307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87415#factFINAL assume true; 87412#factEXIT >#70#return; 87414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87470#factFINAL assume true; 87448#factEXIT >#70#return; 87274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87273#factFINAL assume true; 87243#factEXIT >#78#return; 87248#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86602#$Ultimate##0 ~n := #in~n; 87578#L25 assume !(~n <= 0); 87296#L26 call #t~ret0 := fact(~n - 1);< 87320#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 87369#L25 assume !(~n <= 0); 87293#L26 call #t~ret0 := fact(~n - 1);< 87328#$Ultimate##0 ~n := #in~n; 86687#L25 assume ~n <= 0;#res := 1; 87352#factFINAL assume true; 87327#factEXIT >#70#return; 87324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87319#factFINAL assume true; 87312#factEXIT >#70#return; 87309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87304#factFINAL assume true; 87286#factEXIT >#70#return; 87300#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87310#factFINAL assume true; 87306#factEXIT >#70#return; 87307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87415#factFINAL assume true; 87412#factEXIT >#70#return; 87414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87470#factFINAL assume true; 87448#factEXIT >#70#return; 87428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87502#factFINAL assume true; 87427#factEXIT >#70#return; 87424#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87423#factFINAL assume true; 87378#factEXIT >#80#return; 87249#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 87372#$Ultimate##0 ~n := #in~n; 87371#L25 assume !(~n <= 0); 87287#L26 call #t~ret0 := fact(~n - 1);< 87325#$Ultimate##0 ~n := #in~n; 87323#L25 assume !(~n <= 0); 87297#L26 call #t~ret0 := fact(~n - 1);< 87318#$Ultimate##0 ~n := #in~n; 86687#L25 assume ~n <= 0;#res := 1; 87352#factFINAL assume true; 87327#factEXIT >#70#return; 87324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87319#factFINAL assume true; 87312#factEXIT >#70#return; 87314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87570#factFINAL assume true; 87376#factEXIT >#82#return; 87239#L30-8 [2023-11-06 22:38:02,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 8 times [2023-11-06 22:38:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:02,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181711660] [2023-11-06 22:38:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:02,524 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:02,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140375295] [2023-11-06 22:38:02,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:38:02,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:02,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:02,528 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:02,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2023-11-06 22:38:02,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:38:02,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:38:02,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:02,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:02,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash -70916292, now seen corresponding path program 10 times [2023-11-06 22:38:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:02,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869436822] [2023-11-06 22:38:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:02,748 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:02,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81940540] [2023-11-06 22:38:02,748 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:38:02,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:02,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:02,756 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:02,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2023-11-06 22:38:02,899 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:38:02,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:02,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 22:38:02,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 307 proven. 332 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2023-11-06 22:38:03,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 75 proven. 558 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-11-06 22:38:06,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:06,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869436822] [2023-11-06 22:38:06,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:06,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81940540] [2023-11-06 22:38:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81940540] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:06,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:06,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 33 [2023-11-06 22:38:06,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581997527] [2023-11-06 22:38:06,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:06,223 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:38:06,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:06,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 22:38:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2023-11-06 22:38:06,225 INFO L87 Difference]: Start difference. First operand 1997 states and 3587 transitions. cyclomatic complexity: 1615 Second operand has 33 states, 30 states have (on average 2.433333333333333) internal successors, (73), 32 states have internal predecessors, (73), 19 states have call successors, (21), 2 states have call predecessors, (21), 15 states have return successors, (30), 15 states have call predecessors, (30), 19 states have call successors, (30) [2023-11-06 22:38:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:07,564 INFO L93 Difference]: Finished difference Result 2480 states and 4536 transitions. [2023-11-06 22:38:07,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2480 states and 4536 transitions. [2023-11-06 22:38:07,583 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 206 [2023-11-06 22:38:07,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2480 states to 2471 states and 4527 transitions. [2023-11-06 22:38:07,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 851 [2023-11-06 22:38:07,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 875 [2023-11-06 22:38:07,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2471 states and 4527 transitions. [2023-11-06 22:38:07,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:07,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2471 states and 4527 transitions. [2023-11-06 22:38:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states and 4527 transitions. [2023-11-06 22:38:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2070. [2023-11-06 22:38:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 1287 states have (on average 1.121989121989122) internal successors, (1444), 1265 states have internal predecessors, (1444), 500 states have call successors, (506), 294 states have call predecessors, (506), 283 states have return successors, (1806), 510 states have call predecessors, (1806), 500 states have call successors, (1806) [2023-11-06 22:38:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 3756 transitions. [2023-11-06 22:38:07,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2070 states and 3756 transitions. [2023-11-06 22:38:07,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:38:07,703 INFO L428 stractBuchiCegarLoop]: Abstraction has 2070 states and 3756 transitions. [2023-11-06 22:38:07,703 INFO L335 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2023-11-06 22:38:07,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2070 states and 3756 transitions. [2023-11-06 22:38:07,714 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 163 [2023-11-06 22:38:07,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:38:07,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:38:07,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:07,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 11, 11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:07,716 INFO L748 eck$LassoCheckResult]: Stem: 91905#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 91842#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 91843#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; 91865#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; 91906#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 92141#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92138#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; 92131#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92132#$Ultimate##0 ~n := #in~n; 92137#L25 assume ~n <= 0;#res := 1; 92136#factFINAL assume true; 92130#factEXIT >#72#return; 92126#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92127#$Ultimate##0 ~n := #in~n; 92135#L25 assume ~n <= 0;#res := 1; 92129#factFINAL assume true; 92125#factEXIT >#74#return; 92122#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92123#$Ultimate##0 ~n := #in~n; 92146#L25 assume ~n <= 0;#res := 1; 92145#factFINAL assume true; 92121#factEXIT >#76#return; 92120#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; 92119#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 92117#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92112#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92110#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; 92107#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92108#$Ultimate##0 ~n := #in~n; 92118#L25 assume !(~n <= 0); 92115#L26 call #t~ret0 := fact(~n - 1);< 92116#$Ultimate##0 ~n := #in~n; 92143#L25 assume ~n <= 0;#res := 1; 92356#factFINAL assume true; 92355#factEXIT >#70#return; 92352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92346#factFINAL assume true; 92343#factEXIT >#78#return; 92324#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92326#$Ultimate##0 ~n := #in~n; 92345#L25 assume ~n <= 0;#res := 1; 92104#factFINAL assume true; 92323#factEXIT >#80#return; 91907#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 91908#$Ultimate##0 ~n := #in~n; 92101#L25 assume !(~n <= 0); 92093#L26 call #t~ret0 := fact(~n - 1);< 92096#$Ultimate##0 ~n := #in~n; 92102#L25 assume ~n <= 0;#res := 1; 92099#factFINAL assume true; 92092#factEXIT >#70#return; 92089#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92067#factFINAL assume true; 92064#factEXIT >#82#return; 91844#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; 91845#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 92784#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92775#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92776#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; 92625#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92631#$Ultimate##0 ~n := #in~n; 92928#L25 assume !(~n <= 0); 92693#L26 call #t~ret0 := fact(~n - 1);< 92927#$Ultimate##0 ~n := #in~n; 92923#L25 assume !(~n <= 0); 92701#L26 call #t~ret0 := fact(~n - 1);< 92919#$Ultimate##0 ~n := #in~n; 92751#L25 assume ~n <= 0;#res := 1; 92750#factFINAL assume true; 92736#factEXIT >#70#return; 92734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92707#factFINAL assume true; 92689#factEXIT >#70#return; 92686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92642#factFINAL assume true; 92621#factEXIT >#78#return; 92590#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92592#$Ultimate##0 ~n := #in~n; 92687#L25 assume ~n <= 0;#res := 1; 92688#factFINAL assume true; 92720#factEXIT >#80#return; 92535#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92719#$Ultimate##0 ~n := #in~n; 92718#L25 assume !(~n <= 0); 92564#L26 call #t~ret0 := fact(~n - 1);< 92582#$Ultimate##0 ~n := #in~n; 92580#L25 assume !(~n <= 0); 92562#L26 call #t~ret0 := fact(~n - 1);< 92745#$Ultimate##0 ~n := #in~n; 91896#L25 assume ~n <= 0;#res := 1; 92759#factFINAL assume true; 92744#factEXIT >#70#return; 92743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92710#factFINAL assume true; 92670#factEXIT >#70#return; 92672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92834#factFINAL assume true; 92586#factEXIT >#82#return; 92390#L30-8 [2023-11-06 22:38:07,716 INFO L750 eck$LassoCheckResult]: Loop: 92390#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; 91866#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 91867#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92462#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 91870#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; 91809#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 91810#$Ultimate##0 ~n := #in~n; 92576#L25 assume !(~n <= 0); 91883#L26 call #t~ret0 := fact(~n - 1);< 92574#$Ultimate##0 ~n := #in~n; 92580#L25 assume !(~n <= 0); 92562#L26 call #t~ret0 := fact(~n - 1);< 92745#$Ultimate##0 ~n := #in~n; 92580#L25 assume !(~n <= 0); 92562#L26 call #t~ret0 := fact(~n - 1);< 92745#$Ultimate##0 ~n := #in~n; 92580#L25 assume !(~n <= 0); 92562#L26 call #t~ret0 := fact(~n - 1);< 92745#$Ultimate##0 ~n := #in~n; 92580#L25 assume !(~n <= 0); 92562#L26 call #t~ret0 := fact(~n - 1);< 92745#$Ultimate##0 ~n := #in~n; 92580#L25 assume !(~n <= 0); 92562#L26 call #t~ret0 := fact(~n - 1);< 92745#$Ultimate##0 ~n := #in~n; 92580#L25 assume !(~n <= 0); 92562#L26 call #t~ret0 := fact(~n - 1);< 92745#$Ultimate##0 ~n := #in~n; 91896#L25 assume ~n <= 0;#res := 1; 92759#factFINAL assume true; 92744#factEXIT >#70#return; 92743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92710#factFINAL assume true; 92670#factEXIT >#70#return; 92668#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92637#factFINAL assume true; 92614#factEXIT >#70#return; 92617#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92809#factFINAL assume true; 92805#factEXIT >#70#return; 92806#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92953#factFINAL assume true; 92560#factEXIT >#70#return; 92566#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92771#factFINAL assume true; 92770#factEXIT >#70#return; 92573#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92578#factFINAL assume true; 92572#factEXIT >#70#return; 92570#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92559#factFINAL assume true; 92552#factEXIT >#78#return; 92393#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 91810#$Ultimate##0 ~n := #in~n; 92576#L25 assume ~n <= 0;#res := 1; 92555#factFINAL assume true; 92554#factEXIT >#80#return; 92518#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92533#$Ultimate##0 ~n := #in~n; 92571#L25 assume !(~n <= 0); 92563#L26 call #t~ret0 := fact(~n - 1);< 92569#$Ultimate##0 ~n := #in~n; 92746#L25 assume !(~n <= 0); 92561#L26 call #t~ret0 := fact(~n - 1);< 92579#$Ultimate##0 ~n := #in~n; 92580#L25 assume !(~n <= 0); 92562#L26 call #t~ret0 := fact(~n - 1);< 92745#$Ultimate##0 ~n := #in~n; 92580#L25 assume !(~n <= 0); 92562#L26 call #t~ret0 := fact(~n - 1);< 92745#$Ultimate##0 ~n := #in~n; 91896#L25 assume ~n <= 0;#res := 1; 92759#factFINAL assume true; 92744#factEXIT >#70#return; 92743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92710#factFINAL assume true; 92670#factEXIT >#70#return; 92668#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92637#factFINAL assume true; 92614#factEXIT >#70#return; 92617#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92809#factFINAL assume true; 92805#factEXIT >#70#return; 92807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92954#factFINAL assume true; 92545#factEXIT >#82#return; 92390#L30-8 [2023-11-06 22:38:07,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 9 times [2023-11-06 22:38:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523177450] [2023-11-06 22:38:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:07,727 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:07,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199989638] [2023-11-06 22:38:07,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:38:07,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:07,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:07,732 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:07,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2023-11-06 22:38:07,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-11-06 22:38:07,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:38:07,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:08,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:08,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:08,005 INFO L85 PathProgramCache]: Analyzing trace with hash 461565308, now seen corresponding path program 11 times [2023-11-06 22:38:08,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:08,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869509417] [2023-11-06 22:38:08,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:08,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:08,010 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:08,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158867599] [2023-11-06 22:38:08,010 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:38:08,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:08,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:08,011 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:08,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2023-11-06 22:38:08,201 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2023-11-06 22:38:08,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:08,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 22:38:08,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 95 proven. 229 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-06 22:38:08,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 93 proven. 284 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-11-06 22:38:11,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869509417] [2023-11-06 22:38:11,050 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158867599] [2023-11-06 22:38:11,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158867599] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:11,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:11,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 31 [2023-11-06 22:38:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093777928] [2023-11-06 22:38:11,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:11,051 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:38:11,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:11,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-06 22:38:11,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2023-11-06 22:38:11,052 INFO L87 Difference]: Start difference. First operand 2070 states and 3756 transitions. cyclomatic complexity: 1711 Second operand has 32 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 13 states have return successors, (27), 16 states have call predecessors, (27), 18 states have call successors, (27) [2023-11-06 22:38:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:12,674 INFO L93 Difference]: Finished difference Result 2867 states and 5392 transitions. [2023-11-06 22:38:12,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2867 states and 5392 transitions. [2023-11-06 22:38:12,703 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 294 [2023-11-06 22:38:12,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2867 states to 2820 states and 5342 transitions. [2023-11-06 22:38:12,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 976 [2023-11-06 22:38:12,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 976 [2023-11-06 22:38:12,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2820 states and 5342 transitions. [2023-11-06 22:38:12,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:12,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2820 states and 5342 transitions. [2023-11-06 22:38:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states and 5342 transitions. [2023-11-06 22:38:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2333. [2023-11-06 22:38:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2333 states, 1435 states have (on average 1.1094076655052265) internal successors, (1592), 1409 states have internal predecessors, (1592), 606 states have call successors, (612), 361 states have call predecessors, (612), 292 states have return successors, (2092), 562 states have call predecessors, (2092), 606 states have call successors, (2092) [2023-11-06 22:38:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 4296 transitions. [2023-11-06 22:38:12,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2333 states and 4296 transitions. [2023-11-06 22:38:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 22:38:12,870 INFO L428 stractBuchiCegarLoop]: Abstraction has 2333 states and 4296 transitions. [2023-11-06 22:38:12,870 INFO L335 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2023-11-06 22:38:12,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2333 states and 4296 transitions. [2023-11-06 22:38:12,883 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 184 [2023-11-06 22:38:12,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:38:12,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:38:12,884 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:12,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:12,885 INFO L748 eck$LassoCheckResult]: Stem: 97418#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 97356#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 97357#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; 97379#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; 97366#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 97368#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97712#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; 97350#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97351#$Ultimate##0 ~n := #in~n; 97740#L25 assume ~n <= 0;#res := 1; 97739#factFINAL assume true; 97738#factEXIT >#72#return; 97686#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97737#$Ultimate##0 ~n := #in~n; 97722#L25 assume ~n <= 0;#res := 1; 97723#factFINAL assume true; 97685#factEXIT >#74#return; 97683#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97684#$Ultimate##0 ~n := #in~n; 97721#L25 assume ~n <= 0;#res := 1; 97687#factFINAL assume true; 97682#factEXIT >#76#return; 97679#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; 97387#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 97388#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97996#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97997#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; 97334#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97335#$Ultimate##0 ~n := #in~n; 97396#L25 assume !(~n <= 0); 97361#L26 call #t~ret0 := fact(~n - 1);< 97362#$Ultimate##0 ~n := #in~n; 98543#L25 assume ~n <= 0;#res := 1; 98562#factFINAL assume true; 98561#factEXIT >#70#return; 98556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98072#factFINAL assume true; 98073#factEXIT >#78#return; 97413#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97414#$Ultimate##0 ~n := #in~n; 98509#L25 assume ~n <= 0;#res := 1; 98510#factFINAL assume true; 98521#factEXIT >#80#return; 98504#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 98523#$Ultimate##0 ~n := #in~n; 98522#L25 assume !(~n <= 0); 98515#L26 call #t~ret0 := fact(~n - 1);< 98517#$Ultimate##0 ~n := #in~n; 98524#L25 assume ~n <= 0;#res := 1; 98520#factFINAL assume true; 98513#factEXIT >#70#return; 98516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98594#factFINAL assume true; 98593#factEXIT >#82#return; 98592#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; 98591#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 98590#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 98589#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 98576#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; 98167#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 98170#$Ultimate##0 ~n := #in~n; 98393#L25 assume !(~n <= 0); 98180#L26 call #t~ret0 := fact(~n - 1);< 98193#$Ultimate##0 ~n := #in~n; 98569#L25 assume !(~n <= 0); 98187#L26 call #t~ret0 := fact(~n - 1);< 98202#$Ultimate##0 ~n := #in~n; 98224#L25 assume ~n <= 0;#res := 1; 98210#factFINAL assume true; 98200#factEXIT >#70#return; 98199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98195#factFINAL assume true; 98176#factEXIT >#70#return; 98173#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98171#factFINAL assume true; 98159#factEXIT >#78#return; 98146#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 98156#$Ultimate##0 ~n := #in~n; 98153#L25 assume ~n <= 0;#res := 1; 98154#factFINAL assume true; 98310#factEXIT >#80#return; 97340#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 98308#$Ultimate##0 ~n := #in~n; 98204#L25 assume !(~n <= 0); 98094#L26 call #t~ret0 := fact(~n - 1);< 98128#$Ultimate##0 ~n := #in~n; 98139#L25 assume !(~n <= 0); 98085#L26 call #t~ret0 := fact(~n - 1);< 98136#$Ultimate##0 ~n := #in~n; 98142#L25 assume ~n <= 0;#res := 1; 98138#factFINAL assume true; 98134#factEXIT >#70#return; 98132#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98127#factFINAL assume true; 98120#factEXIT >#70#return; 98124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98938#factFINAL assume true; 98935#factEXIT >#82#return; 97341#L30-8 [2023-11-06 22:38:12,885 INFO L750 eck$LassoCheckResult]: Loop: 97341#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; 97358#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 97380#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97417#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97383#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; 97384#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 98074#$Ultimate##0 ~n := #in~n; 98367#L25 assume !(~n <= 0); 98091#L26 call #t~ret0 := fact(~n - 1);< 98151#$Ultimate##0 ~n := #in~n; 98139#L25 assume !(~n <= 0); 98085#L26 call #t~ret0 := fact(~n - 1);< 98136#$Ultimate##0 ~n := #in~n; 98139#L25 assume !(~n <= 0); 98085#L26 call #t~ret0 := fact(~n - 1);< 98136#$Ultimate##0 ~n := #in~n; 98139#L25 assume !(~n <= 0); 98085#L26 call #t~ret0 := fact(~n - 1);< 98136#$Ultimate##0 ~n := #in~n; 98142#L25 assume ~n <= 0;#res := 1; 98138#factFINAL assume true; 98134#factEXIT >#70#return; 98132#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98127#factFINAL assume true; 98120#factEXIT >#70#return; 98116#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98112#factFINAL assume true; 98102#factEXIT >#70#return; 98101#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98097#factFINAL assume true; 98084#factEXIT >#70#return; 98083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98081#factFINAL assume true; 98077#factEXIT >#78#return; 98080#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 98354#$Ultimate##0 ~n := #in~n; 98368#L25 assume !(~n <= 0); 98106#L26 call #t~ret0 := fact(~n - 1);< 98113#$Ultimate##0 ~n := #in~n; 98129#L25 assume !(~n <= 0); 98121#L26 call #t~ret0 := fact(~n - 1);< 98126#$Ultimate##0 ~n := #in~n; 98140#L25 assume !(~n <= 0); 98135#L26 call #t~ret0 := fact(~n - 1);< 98137#$Ultimate##0 ~n := #in~n; 98142#L25 assume ~n <= 0;#res := 1; 98138#factFINAL assume true; 98134#factEXIT >#70#return; 98132#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98127#factFINAL assume true; 98120#factEXIT >#70#return; 98116#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98112#factFINAL assume true; 98102#factEXIT >#70#return; 98107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98547#factFINAL assume true; 98351#factEXIT >#80#return; 98352#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 98356#$Ultimate##0 ~n := #in~n; 98357#L25 assume !(~n <= 0); 98230#L26 call #t~ret0 := fact(~n - 1);< 98238#$Ultimate##0 ~n := #in~n; 98118#L25 assume ~n <= 0;#res := 1; 98236#factFINAL assume true; 98229#factEXIT >#70#return; 98232#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98544#factFINAL assume true; 98545#factEXIT >#82#return; 97341#L30-8 [2023-11-06 22:38:12,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 10 times [2023-11-06 22:38:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:12,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640939753] [2023-11-06 22:38:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:12,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:12,894 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481240232] [2023-11-06 22:38:12,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:38:12,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:12,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:12,899 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:12,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2023-11-06 22:38:13,137 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:38:13,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:38:13,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:13,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:13,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:13,192 INFO L85 PathProgramCache]: Analyzing trace with hash -290113156, now seen corresponding path program 12 times [2023-11-06 22:38:13,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:13,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719598956] [2023-11-06 22:38:13,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:13,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:13,198 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:13,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [373261594] [2023-11-06 22:38:13,198 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:38:13,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:13,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:13,202 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:13,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2023-11-06 22:38:13,428 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-11-06 22:38:13,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:38:13,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:13,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:13,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1915700183, now seen corresponding path program 11 times [2023-11-06 22:38:13,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:13,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632935027] [2023-11-06 22:38:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:13,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:13,473 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:13,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298661120] [2023-11-06 22:38:13,473 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:38:13,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:13,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:13,477 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:13,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2023-11-06 22:38:13,757 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-11-06 22:38:13,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:13,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:38:13,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:13,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 325 proven. 90 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2023-11-06 22:38:13,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 110 proven. 103 refuted. 0 times theorem prover too weak. 1295 trivial. 0 not checked. [2023-11-06 22:38:14,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632935027] [2023-11-06 22:38:14,175 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298661120] [2023-11-06 22:38:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298661120] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:14,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:14,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2023-11-06 22:38:14,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667168776] [2023-11-06 22:38:14,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:14,815 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:38:14,815 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:38:14,815 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:38:14,815 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:38:14,815 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:38:14,815 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:14,815 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:38:14,816 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:38:14,816 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration30_Loop [2023-11-06 22:38:14,816 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:38:14,816 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:38:14,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:14,968 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:38:14,968 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:38:14,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:14,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:14,972 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:14,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:14,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:14,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2023-11-06 22:38:15,000 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:15,000 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=3} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:15,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:15,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:15,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:15,006 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:15,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:15,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:15,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2023-11-06 22:38:15,033 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:15,033 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=4} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:15,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:15,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:15,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:15,038 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:15,042 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:15,042 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:15,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2023-11-06 22:38:15,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:15,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:15,068 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:15,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2023-11-06 22:38:15,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:38:15,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:15,100 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:38:15,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:15,104 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:38:15,105 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:38:15,105 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:38:15,105 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:38:15,105 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:38:15,105 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:15,105 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:38:15,105 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:38:15,105 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration30_Loop [2023-11-06 22:38:15,105 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:38:15,105 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:38:15,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:15,302 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:38:15,302 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:38:15,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:15,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:15,304 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:15,313 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 [2023-11-06 22:38:15,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2023-11-06 22:38:15,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:15,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:15,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:15,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:15,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:15,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:15,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:15,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:15,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:15,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:15,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:15,335 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:15,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2023-11-06 22:38:15,338 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 [2023-11-06 22:38:15,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:15,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:15,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:15,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:15,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:15,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:15,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:15,352 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:38:15,354 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:38:15,354 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:38:15,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:15,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:15,356 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:15,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2023-11-06 22:38:15,358 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:38:15,358 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:38:15,358 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:38:15,358 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2023-11-06 22:38:15,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2023-11-06 22:38:15,361 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:38:15,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:15,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-06 22:38:15,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:16,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-06 22:38:16,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-06 22:38:16,465 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 [2023-11-06 22:38:16,465 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2333 states and 4296 transitions. cyclomatic complexity: 1988 Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-06 22:38:16,943 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2333 states and 4296 transitions. cyclomatic complexity: 1988. Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 3919 states and 6700 transitions. Complement of second has 63 states. [2023-11-06 22:38:16,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-11-06 22:38:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-06 22:38:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2023-11-06 22:38:16,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 90 transitions. Stem has 98 letters. Loop has 68 letters. [2023-11-06 22:38:16,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:38:16,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 90 transitions. Stem has 166 letters. Loop has 68 letters. [2023-11-06 22:38:16,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:38:16,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 90 transitions. Stem has 98 letters. Loop has 136 letters. [2023-11-06 22:38:16,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:38:16,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3919 states and 6700 transitions. [2023-11-06 22:38:16,984 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 181 [2023-11-06 22:38:17,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3919 states to 3040 states and 5271 transitions. [2023-11-06 22:38:17,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 853 [2023-11-06 22:38:17,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 856 [2023-11-06 22:38:17,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3040 states and 5271 transitions. [2023-11-06 22:38:17,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:17,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3040 states and 5271 transitions. [2023-11-06 22:38:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states and 5271 transitions. [2023-11-06 22:38:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 2843. [2023-11-06 22:38:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 1755 states have (on average 1.1042735042735043) internal successors, (1938), 1733 states have internal predecessors, (1938), 698 states have call successors, (710), 431 states have call predecessors, (710), 390 states have return successors, (2370), 678 states have call predecessors, (2370), 698 states have call successors, (2370) [2023-11-06 22:38:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 5018 transitions. [2023-11-06 22:38:17,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2843 states and 5018 transitions. [2023-11-06 22:38:17,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:17,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:38:17,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:38:17,128 INFO L87 Difference]: Start difference. First operand 2843 states and 5018 transitions. Second operand has 11 states, 8 states have (on average 4.375) internal successors, (35), 11 states have internal predecessors, (35), 8 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2023-11-06 22:38:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:17,426 INFO L93 Difference]: Finished difference Result 2648 states and 4536 transitions. [2023-11-06 22:38:17,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2648 states and 4536 transitions. [2023-11-06 22:38:17,444 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 221 [2023-11-06 22:38:17,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2648 states to 2283 states and 3946 transitions. [2023-11-06 22:38:17,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 801 [2023-11-06 22:38:17,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 801 [2023-11-06 22:38:17,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2283 states and 3946 transitions. [2023-11-06 22:38:17,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:17,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2283 states and 3946 transitions. [2023-11-06 22:38:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states and 3946 transitions. [2023-11-06 22:38:17,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2139. [2023-11-06 22:38:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 1325 states have (on average 1.0679245283018868) internal successors, (1415), 1309 states have internal predecessors, (1415), 540 states have call successors, (552), 307 states have call predecessors, (552), 274 states have return successors, (1732), 522 states have call predecessors, (1732), 540 states have call successors, (1732) [2023-11-06 22:38:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3699 transitions. [2023-11-06 22:38:17,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2139 states and 3699 transitions. [2023-11-06 22:38:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:38:17,626 INFO L428 stractBuchiCegarLoop]: Abstraction has 2139 states and 3699 transitions. [2023-11-06 22:38:17,626 INFO L335 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2023-11-06 22:38:17,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2139 states and 3699 transitions. [2023-11-06 22:38:17,637 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 192 [2023-11-06 22:38:17,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:38:17,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:38:17,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:17,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 14, 14, 14, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:17,639 INFO L748 eck$LassoCheckResult]: Stem: 110767#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 110716#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 110717#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; 110737#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; 110768#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 110884#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 110882#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; 110878#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 110879#$Ultimate##0 ~n := #in~n; 110883#L25 assume ~n <= 0;#res := 1; 110881#factFINAL assume true; 110877#factEXIT >#72#return; 110873#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 110874#$Ultimate##0 ~n := #in~n; 110880#L25 assume ~n <= 0;#res := 1; 110876#factFINAL assume true; 110872#factEXIT >#74#return; 110869#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 110870#$Ultimate##0 ~n := #in~n; 110875#L25 assume ~n <= 0;#res := 1; 110871#factFINAL assume true; 110868#factEXIT >#76#return; 110867#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; 110865#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 110862#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 110857#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 110854#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; 110846#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 110847#$Ultimate##0 ~n := #in~n; 110864#L25 assume !(~n <= 0); 110860#L26 call #t~ret0 := fact(~n - 1);< 110861#$Ultimate##0 ~n := #in~n; 110866#L25 assume ~n <= 0;#res := 1; 110863#factFINAL assume true; 110859#factEXIT >#70#return; 110856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 110853#factFINAL assume true; 110845#factEXIT >#78#return; 110841#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 110842#$Ultimate##0 ~n := #in~n; 110851#L25 assume ~n <= 0;#res := 1; 110844#factFINAL assume true; 110840#factEXIT >#80#return; 110837#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 110838#$Ultimate##0 ~n := #in~n; 110852#L25 assume !(~n <= 0); 110849#L26 call #t~ret0 := fact(~n - 1);< 110850#$Ultimate##0 ~n := #in~n; 110858#L25 assume ~n <= 0;#res := 1; 110855#factFINAL assume true; 110848#factEXIT >#70#return; 110843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 110839#factFINAL assume true; 110836#factEXIT >#82#return; 110718#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; 110719#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 111841#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111840#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111839#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; 111519#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 111608#$Ultimate##0 ~n := #in~n; 111641#L25 assume !(~n <= 0); 111513#L26 call #t~ret0 := fact(~n - 1);< 111521#$Ultimate##0 ~n := #in~n; 111695#L25 assume !(~n <= 0); 111511#L26 call #t~ret0 := fact(~n - 1);< 111688#$Ultimate##0 ~n := #in~n; 111693#L25 assume ~n <= 0;#res := 1; 111691#factFINAL assume true; 111687#factEXIT >#70#return; 111686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111663#factFINAL assume true; 111510#factEXIT >#70#return; 111517#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111614#factFINAL assume true; 111607#factEXIT >#78#return; 111599#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 111602#$Ultimate##0 ~n := #in~n; 111613#L25 assume ~n <= 0;#res := 1; 111606#factFINAL assume true; 111598#factEXIT >#80#return; 110887#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111596#$Ultimate##0 ~n := #in~n; 111594#L25 assume !(~n <= 0); 111528#L26 call #t~ret0 := fact(~n - 1);< 111571#$Ultimate##0 ~n := #in~n; 111597#L25 assume !(~n <= 0); 110701#L26 call #t~ret0 := fact(~n - 1);< 111593#$Ultimate##0 ~n := #in~n; 110749#L25 assume ~n <= 0;#res := 1; 110750#factFINAL assume true; 110700#factEXIT >#70#return; 110702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111590#factFINAL assume true; 111586#factEXIT >#70#return; 111587#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111741#factFINAL assume true; 110886#factEXIT >#82#return; 110888#L30-8 [2023-11-06 22:38:17,639 INFO L750 eck$LassoCheckResult]: Loop: 110888#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; 111444#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 111442#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 111441#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 111440#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; 110692#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 110693#$Ultimate##0 ~n := #in~n; 111493#L25 assume !(~n <= 0); 111526#L26 call #t~ret0 := fact(~n - 1);< 111571#$Ultimate##0 ~n := #in~n; 111597#L25 assume !(~n <= 0); 110701#L26 call #t~ret0 := fact(~n - 1);< 111593#$Ultimate##0 ~n := #in~n; 111597#L25 assume !(~n <= 0); 110701#L26 call #t~ret0 := fact(~n - 1);< 111593#$Ultimate##0 ~n := #in~n; 111597#L25 assume !(~n <= 0); 110701#L26 call #t~ret0 := fact(~n - 1);< 111593#$Ultimate##0 ~n := #in~n; 111597#L25 assume !(~n <= 0); 110701#L26 call #t~ret0 := fact(~n - 1);< 111593#$Ultimate##0 ~n := #in~n; 111597#L25 assume !(~n <= 0); 110701#L26 call #t~ret0 := fact(~n - 1);< 111593#$Ultimate##0 ~n := #in~n; 111597#L25 assume !(~n <= 0); 110701#L26 call #t~ret0 := fact(~n - 1);< 111593#$Ultimate##0 ~n := #in~n; 110749#L25 assume ~n <= 0;#res := 1; 110750#factFINAL assume true; 110700#factEXIT >#70#return; 110702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111590#factFINAL assume true; 111586#factEXIT >#70#return; 111583#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111582#factFINAL assume true; 111580#factEXIT >#70#return; 111579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111578#factFINAL assume true; 111576#factEXIT >#70#return; 111574#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111555#factFINAL assume true; 111524#factEXIT >#70#return; 111533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111570#factFINAL assume true; 111569#factEXIT >#70#return; 111567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111568#factFINAL assume true; 111566#factEXIT >#70#return; 111565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111563#factFINAL assume true; 111562#factEXIT >#78#return; 111463#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 110693#$Ultimate##0 ~n := #in~n; 111493#L25 assume ~n <= 0;#res := 1; 111491#factFINAL assume true; 111490#factEXIT >#80#return; 111465#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 111466#$Ultimate##0 ~n := #in~n; 111573#L25 assume !(~n <= 0); 111535#L26 call #t~ret0 := fact(~n - 1);< 111536#$Ultimate##0 ~n := #in~n; 111575#L25 assume !(~n <= 0); 111556#L26 call #t~ret0 := fact(~n - 1);< 111557#$Ultimate##0 ~n := #in~n; 111592#L25 assume !(~n <= 0); 111525#L26 call #t~ret0 := fact(~n - 1);< 111572#$Ultimate##0 ~n := #in~n; 111585#L25 assume !(~n <= 0); 111530#L26 call #t~ret0 := fact(~n - 1);< 111577#$Ultimate##0 ~n := #in~n; 111591#L25 assume !(~n <= 0); 111531#L26 call #t~ret0 := fact(~n - 1);< 111581#$Ultimate##0 ~n := #in~n; 111595#L25 assume !(~n <= 0); 111527#L26 call #t~ret0 := fact(~n - 1);< 111588#$Ultimate##0 ~n := #in~n; 111597#L25 assume !(~n <= 0); 110701#L26 call #t~ret0 := fact(~n - 1);< 111593#$Ultimate##0 ~n := #in~n; 110749#L25 assume ~n <= 0;#res := 1; 110750#factFINAL assume true; 110700#factEXIT >#70#return; 110702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111590#factFINAL assume true; 111586#factEXIT >#70#return; 111583#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111582#factFINAL assume true; 111580#factEXIT >#70#return; 111579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111578#factFINAL assume true; 111576#factEXIT >#70#return; 111574#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111555#factFINAL assume true; 111524#factEXIT >#70#return; 111533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111570#factFINAL assume true; 111569#factEXIT >#70#return; 111567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111568#factFINAL assume true; 111566#factEXIT >#70#return; 111565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 111563#factFINAL assume true; 111562#factEXIT >#82#return; 110888#L30-8 [2023-11-06 22:38:17,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1721354542, now seen corresponding path program 12 times [2023-11-06 22:38:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350511903] [2023-11-06 22:38:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:17,657 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:17,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806677933] [2023-11-06 22:38:17,658 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:38:17,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:17,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:17,659 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:17,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Waiting until timeout for monitored process [2023-11-06 22:38:17,913 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-11-06 22:38:17,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:38:17,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:17,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:17,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1652380284, now seen corresponding path program 13 times [2023-11-06 22:38:17,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:17,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703553705] [2023-11-06 22:38:17,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:17,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:17,979 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:17,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375997317] [2023-11-06 22:38:17,979 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:38:17,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:17,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:17,981 INFO L229 MonitoredProcess]: Starting monitored process 189 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:18,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Waiting until timeout for monitored process [2023-11-06 22:38:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:18,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:18,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:18,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1374274217, now seen corresponding path program 13 times [2023-11-06 22:38:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:18,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135658246] [2023-11-06 22:38:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:18,280 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:18,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353873779] [2023-11-06 22:38:18,281 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:38:18,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:18,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:18,285 INFO L229 MonitoredProcess]: Starting monitored process 190 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:18,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (190)] Waiting until timeout for monitored process [2023-11-06 22:38:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:18,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:38:18,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2390 backedges. 1304 proven. 53 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2023-11-06 22:38:18,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2390 backedges. 294 proven. 226 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2023-11-06 22:38:19,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135658246] [2023-11-06 22:38:19,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353873779] [2023-11-06 22:38:19,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353873779] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:19,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 16 [2023-11-06 22:38:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433691488] [2023-11-06 22:38:19,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:20,500 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:38:20,500 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:38:20,500 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:38:20,500 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:38:20,500 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:38:20,500 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:20,500 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:38:20,500 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:38:20,500 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration31_Loop [2023-11-06 22:38:20,501 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:38:20,501 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:38:20,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,655 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:38:20,656 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:38:20,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:20,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:20,660 INFO L229 MonitoredProcess]: Starting monitored process 191 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:20,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2023-11-06 22:38:20,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:20,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:20,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:20,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:20,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:20,683 INFO L229 MonitoredProcess]: Starting monitored process 192 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:20,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2023-11-06 22:38:20,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:38:20,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:20,705 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:38:20,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2023-11-06 22:38:20,708 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:38:20,708 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:38:20,708 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:38:20,708 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:38:20,708 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:38:20,708 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:20,709 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:38:20,709 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:38:20,709 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration31_Loop [2023-11-06 22:38:20,709 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:38:20,709 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:38:20,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:20,825 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:38:20,825 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:38:20,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:20,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:20,827 INFO L229 MonitoredProcess]: Starting monitored process 193 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:20,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2023-11-06 22:38:20,830 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 [2023-11-06 22:38:20,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:20,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:20,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:20,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:20,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:20,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:20,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:20,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:38:20,847 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:38:20,847 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:38:20,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:20,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:20,851 INFO L229 MonitoredProcess]: Starting monitored process 194 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:20,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2023-11-06 22:38:20,852 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:38:20,852 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:38:20,852 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:38:20,852 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 13 Supporting invariants [] [2023-11-06 22:38:20,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:20,855 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:38:20,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:20,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-06 22:38:20,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:21,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-06 22:38:21,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 0 proven. 391 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2023-11-06 22:38:22,171 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 14 loop predicates [2023-11-06 22:38:22,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2139 states and 3699 transitions. cyclomatic complexity: 1588 Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-06 22:38:22,720 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2139 states and 3699 transitions. cyclomatic complexity: 1588. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) Result 4331 states and 6837 transitions. Complement of second has 83 states. [2023-11-06 22:38:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2023-11-06 22:38:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (19), 12 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-06 22:38:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 93 transitions. [2023-11-06 22:38:22,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 93 transitions. Stem has 98 letters. Loop has 104 letters. [2023-11-06 22:38:22,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:38:22,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 93 transitions. Stem has 202 letters. Loop has 104 letters. [2023-11-06 22:38:22,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:38:22,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 93 transitions. Stem has 98 letters. Loop has 208 letters. [2023-11-06 22:38:22,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:38:22,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4331 states and 6837 transitions. [2023-11-06 22:38:22,762 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 190 [2023-11-06 22:38:22,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4331 states to 2992 states and 4964 transitions. [2023-11-06 22:38:22,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 791 [2023-11-06 22:38:22,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 796 [2023-11-06 22:38:22,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2992 states and 4964 transitions. [2023-11-06 22:38:22,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:22,798 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2992 states and 4964 transitions. [2023-11-06 22:38:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states and 4964 transitions. [2023-11-06 22:38:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2523. [2023-11-06 22:38:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 1563 states have (on average 1.0601407549584132) internal successors, (1657), 1557 states have internal predecessors, (1657), 606 states have call successors, (628), 351 states have call predecessors, (628), 354 states have return successors, (2030), 614 states have call predecessors, (2030), 606 states have call successors, (2030) [2023-11-06 22:38:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 4315 transitions. [2023-11-06 22:38:22,881 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2523 states and 4315 transitions. [2023-11-06 22:38:22,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:22,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:38:22,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:38:22,882 INFO L87 Difference]: Start difference. First operand 2523 states and 4315 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (23), 9 states have call predecessors, (23), 11 states have call successors, (23) [2023-11-06 22:38:23,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:23,422 INFO L93 Difference]: Finished difference Result 3065 states and 5787 transitions. [2023-11-06 22:38:23,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3065 states and 5787 transitions. [2023-11-06 22:38:23,459 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 324 [2023-11-06 22:38:23,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3065 states to 3028 states and 5724 transitions. [2023-11-06 22:38:23,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1037 [2023-11-06 22:38:23,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1037 [2023-11-06 22:38:23,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3028 states and 5724 transitions. [2023-11-06 22:38:23,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:23,520 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3028 states and 5724 transitions. [2023-11-06 22:38:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states and 5724 transitions. [2023-11-06 22:38:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2645. [2023-11-06 22:38:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 1642 states have (on average 1.0609013398294762) internal successors, (1742), 1635 states have internal predecessors, (1742), 649 states have call successors, (674), 351 states have call predecessors, (674), 354 states have return successors, (2172), 658 states have call predecessors, (2172), 649 states have call successors, (2172) [2023-11-06 22:38:23,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4588 transitions. [2023-11-06 22:38:23,663 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2645 states and 4588 transitions. [2023-11-06 22:38:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:38:23,664 INFO L428 stractBuchiCegarLoop]: Abstraction has 2645 states and 4588 transitions. [2023-11-06 22:38:23,664 INFO L335 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2023-11-06 22:38:23,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2645 states and 4588 transitions. [2023-11-06 22:38:23,681 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 223 [2023-11-06 22:38:23,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:38:23,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:38:23,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 19, 10, 9, 9, 9, 9, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:23,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [43, 43, 31, 31, 31, 31, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:23,685 INFO L748 eck$LassoCheckResult]: Stem: 124874#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 124809#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 124810#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; 124834#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; 124821#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 124823#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 126528#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; 126524#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 126525#$Ultimate##0 ~n := #in~n; 126529#L25 assume ~n <= 0;#res := 1; 126527#factFINAL assume true; 126523#factEXIT >#72#return; 126519#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 126520#$Ultimate##0 ~n := #in~n; 126526#L25 assume ~n <= 0;#res := 1; 126522#factFINAL assume true; 126518#factEXIT >#74#return; 126515#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126516#$Ultimate##0 ~n := #in~n; 126521#L25 assume ~n <= 0;#res := 1; 126517#factFINAL assume true; 126514#factEXIT >#76#return; 126513#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; 126511#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 126509#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 126506#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 126505#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; 126484#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 126485#$Ultimate##0 ~n := #in~n; 126493#L25 assume !(~n <= 0); 126491#L26 call #t~ret0 := fact(~n - 1);< 126492#$Ultimate##0 ~n := #in~n; 126496#L25 assume ~n <= 0;#res := 1; 126494#factFINAL assume true; 126490#factEXIT >#70#return; 126488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126486#factFINAL assume true; 126483#factEXIT >#78#return; 126481#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 126482#$Ultimate##0 ~n := #in~n; 126489#L25 assume ~n <= 0;#res := 1; 126487#factFINAL assume true; 126480#factEXIT >#80#return; 126199#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126201#$Ultimate##0 ~n := #in~n; 126645#L25 assume !(~n <= 0); 126643#L26 call #t~ret0 := fact(~n - 1);< 126644#$Ultimate##0 ~n := #in~n; 126647#L25 assume ~n <= 0;#res := 1; 126646#factFINAL assume true; 126642#factEXIT >#70#return; 126641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126637#factFINAL assume true; 126198#factEXIT >#82#return; 126200#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; 126629#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 126790#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 126781#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 126779#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; 126772#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 126776#$Ultimate##0 ~n := #in~n; 126794#L25 assume !(~n <= 0); 126785#L26 call #t~ret0 := fact(~n - 1);< 126789#$Ultimate##0 ~n := #in~n; 126800#L25 assume !(~n <= 0); 126784#L26 call #t~ret0 := fact(~n - 1);< 126798#$Ultimate##0 ~n := #in~n; 126804#L25 assume ~n <= 0;#res := 1; 126799#factFINAL assume true; 126797#factEXIT >#70#return; 126796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126791#factFINAL assume true; 126782#factEXIT >#70#return; 126780#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126778#factFINAL assume true; 126771#factEXIT >#78#return; 126763#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 126765#$Ultimate##0 ~n := #in~n; 126777#L25 assume ~n <= 0;#res := 1; 126768#factFINAL assume true; 126762#factEXIT >#80#return; 126761#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126656#$Ultimate##0 ~n := #in~n; 126927#L25 assume !(~n <= 0); 126919#L26 call #t~ret0 := fact(~n - 1);< 127140#$Ultimate##0 ~n := #in~n; 127319#L25 assume !(~n <= 0); 126920#L26 call #t~ret0 := fact(~n - 1);< 127318#$Ultimate##0 ~n := #in~n; 127333#L25 assume ~n <= 0;#res := 1; 127320#factFINAL assume true; 127317#factEXIT >#70#return; 127315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 127309#factFINAL assume true; 126918#factEXIT >#70#return; 126917#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126916#factFINAL assume true; 126760#factEXIT >#82#return; 126759#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; 126758#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 126757#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 126158#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 126159#L42-4 havoc main_~k~0#1; 125271#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125272#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 125268#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125267#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; 125169#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125180#$Ultimate##0 ~n := #in~n; 125183#L25 assume !(~n <= 0); 125185#L26 call #t~ret0 := fact(~n - 1);< 125188#$Ultimate##0 ~n := #in~n; 125193#L25 assume !(~n <= 0); 125321#L26 call #t~ret0 := fact(~n - 1);< 125324#$Ultimate##0 ~n := #in~n; 125193#L25 assume !(~n <= 0); 125321#L26 call #t~ret0 := fact(~n - 1);< 125324#$Ultimate##0 ~n := #in~n; 125327#L25 assume ~n <= 0;#res := 1; 125328#factFINAL assume true; 125326#factEXIT >#70#return; 125325#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125323#factFINAL assume true; 125320#factEXIT >#70#return; 125322#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125437#factFINAL assume true; 125436#factEXIT >#70#return; 125427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125426#factFINAL assume true; 125423#factEXIT >#72#return; 125173#L30-1 [2023-11-06 22:38:23,686 INFO L750 eck$LassoCheckResult]: Loop: 125173#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125180#$Ultimate##0 ~n := #in~n; 125183#L25 assume ~n <= 0;#res := 1; 125184#factFINAL assume true; 125276#factEXIT >#74#return; 125278#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125417#$Ultimate##0 ~n := #in~n; 125416#L25 assume !(~n <= 0); 124941#L26 call #t~ret0 := fact(~n - 1);< 124990#$Ultimate##0 ~n := #in~n; 124988#L25 assume !(~n <= 0); 124945#L26 call #t~ret0 := fact(~n - 1);< 125081#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125102#L25 assume ~n <= 0;#res := 1; 125122#factFINAL assume true; 125117#factEXIT >#70#return; 125053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125057#factFINAL assume true; 125076#factEXIT >#70#return; 125074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125066#factFINAL assume true; 125061#factEXIT >#70#return; 125033#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125028#factFINAL assume true; 125019#factEXIT >#70#return; 125018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125012#factFINAL assume true; 125003#factEXIT >#70#return; 125009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125108#factFINAL assume true; 125105#factEXIT >#70#return; 124968#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125001#factFINAL assume true; 124933#factEXIT >#70#return; 124967#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125414#factFINAL assume true; 125413#factEXIT >#76#return; 125150#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; 125149#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 125148#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125147#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125145#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; 124780#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 124908#$Ultimate##0 ~n := #in~n; 126189#L25 assume !(~n <= 0); 124957#L26 call #t~ret0 := fact(~n - 1);< 124992#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125102#L25 assume ~n <= 0;#res := 1; 125122#factFINAL assume true; 125117#factEXIT >#70#return; 125053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125057#factFINAL assume true; 125076#factEXIT >#70#return; 125074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125066#factFINAL assume true; 125061#factEXIT >#70#return; 125033#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125028#factFINAL assume true; 125019#factEXIT >#70#return; 124931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124932#factFINAL assume true; 125045#factEXIT >#72#return; 124754#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 124908#$Ultimate##0 ~n := #in~n; 126189#L25 assume !(~n <= 0); 124957#L26 call #t~ret0 := fact(~n - 1);< 124992#$Ultimate##0 ~n := #in~n; 125052#L25 assume ~n <= 0;#res := 1; 124973#factFINAL assume true; 124985#factEXIT >#70#return; 124997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125073#factFINAL assume true; 125043#factEXIT >#74#return; 124845#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125137#$Ultimate##0 ~n := #in~n; 125133#L25 assume ~n <= 0;#res := 1; 124927#factFINAL assume true; 124915#factEXIT >#76#return; 124925#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; 125141#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 125140#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125139#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125138#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; 124744#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 124908#$Ultimate##0 ~n := #in~n; 126189#L25 assume !(~n <= 0); 124957#L26 call #t~ret0 := fact(~n - 1);< 124992#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125102#L25 assume ~n <= 0;#res := 1; 125122#factFINAL assume true; 125117#factEXIT >#70#return; 125053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125057#factFINAL assume true; 125076#factEXIT >#70#return; 125074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125066#factFINAL assume true; 125061#factEXIT >#70#return; 125033#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125028#factFINAL assume true; 125019#factEXIT >#70#return; 124931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124932#factFINAL assume true; 125045#factEXIT >#72#return; 124768#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 124908#$Ultimate##0 ~n := #in~n; 126189#L25 assume !(~n <= 0); 124957#L26 call #t~ret0 := fact(~n - 1);< 124992#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125102#L25 assume ~n <= 0;#res := 1; 125122#factFINAL assume true; 125117#factEXIT >#70#return; 125053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125057#factFINAL assume true; 125076#factEXIT >#70#return; 125074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125066#factFINAL assume true; 125061#factEXIT >#70#return; 125033#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125028#factFINAL assume true; 125019#factEXIT >#70#return; 125018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125012#factFINAL assume true; 125003#factEXIT >#70#return; 125009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125108#factFINAL assume true; 125105#factEXIT >#70#return; 125104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125103#factFINAL assume true; 125075#factEXIT >#74#return; 124898#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 124926#$Ultimate##0 ~n := #in~n; 124928#L25 assume ~n <= 0;#res := 1; 124927#factFINAL assume true; 124915#factEXIT >#76#return; 124924#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; 125100#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 125099#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125098#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 124909#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; 124745#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 124908#$Ultimate##0 ~n := #in~n; 126189#L25 assume !(~n <= 0); 124957#L26 call #t~ret0 := fact(~n - 1);< 124992#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125058#L25 assume !(~n <= 0); 124960#L26 call #t~ret0 := fact(~n - 1);< 125120#$Ultimate##0 ~n := #in~n; 125102#L25 assume ~n <= 0;#res := 1; 125122#factFINAL assume true; 125117#factEXIT >#70#return; 125053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125057#factFINAL assume true; 125076#factEXIT >#70#return; 125074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125066#factFINAL assume true; 125061#factEXIT >#70#return; 125064#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124905#factFINAL assume true; 124906#factEXIT >#78#return; 124890#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125041#$Ultimate##0 ~n := #in~n; 125072#L25 assume !(~n <= 0); 125056#L26 call #t~ret0 := fact(~n - 1);< 125071#$Ultimate##0 ~n := #in~n; 125109#L25 assume !(~n <= 0); 125055#L26 call #t~ret0 := fact(~n - 1);< 125082#$Ultimate##0 ~n := #in~n; 125102#L25 assume ~n <= 0;#res := 1; 125122#factFINAL assume true; 125117#factEXIT >#70#return; 125053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125057#factFINAL assume true; 125076#factEXIT >#70#return; 125080#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125114#factFINAL assume true; 124884#factEXIT >#80#return; 124885#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 124903#$Ultimate##0 ~n := #in~n; 125060#L25 assume !(~n <= 0); 124980#L26 call #t~ret0 := fact(~n - 1);< 125031#$Ultimate##0 ~n := #in~n; 125052#L25 assume ~n <= 0;#res := 1; 124973#factFINAL assume true; 124985#factEXIT >#70#return; 124997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125073#factFINAL assume true; 125043#factEXIT >#82#return; 124883#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; 124882#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 124881#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 124879#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 124877#L42-4 havoc main_~k~0#1; 124830#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124831#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 125192#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125190#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; 125175#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125180#$Ultimate##0 ~n := #in~n; 125183#L25 assume !(~n <= 0); 125185#L26 call #t~ret0 := fact(~n - 1);< 125188#$Ultimate##0 ~n := #in~n; 125193#L25 assume !(~n <= 0); 125321#L26 call #t~ret0 := fact(~n - 1);< 125324#$Ultimate##0 ~n := #in~n; 125193#L25 assume !(~n <= 0); 125321#L26 call #t~ret0 := fact(~n - 1);< 125324#$Ultimate##0 ~n := #in~n; 125327#L25 assume ~n <= 0;#res := 1; 125328#factFINAL assume true; 125326#factEXIT >#70#return; 125325#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125323#factFINAL assume true; 125320#factEXIT >#70#return; 125322#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125437#factFINAL assume true; 125436#factEXIT >#70#return; 125427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125426#factFINAL assume true; 125423#factEXIT >#72#return; 125173#L30-1 [2023-11-06 22:38:23,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1169310377, now seen corresponding path program 11 times [2023-11-06 22:38:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288408654] [2023-11-06 22:38:23,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:23,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:23,700 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:23,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201060466] [2023-11-06 22:38:23,701 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:38:23,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:23,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:23,703 INFO L229 MonitoredProcess]: Starting monitored process 195 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:23,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (195)] Waiting until timeout for monitored process [2023-11-06 22:38:23,983 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-11-06 22:38:23,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:23,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:38:23,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 187 proven. 23 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2023-11-06 22:38:24,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 187 proven. 27 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2023-11-06 22:38:24,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288408654] [2023-11-06 22:38:24,550 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201060466] [2023-11-06 22:38:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201060466] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:24,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2023-11-06 22:38:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554631670] [2023-11-06 22:38:24,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:24,551 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:38:24,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:24,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1119681801, now seen corresponding path program 10 times [2023-11-06 22:38:24,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:24,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473111118] [2023-11-06 22:38:24,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:24,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:24,566 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:24,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613397214] [2023-11-06 22:38:24,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:38:24,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:24,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:24,568 INFO L229 MonitoredProcess]: Starting monitored process 196 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:24,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Waiting until timeout for monitored process [2023-11-06 22:38:24,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:38:24,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:24,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:38:24,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4579 backedges. 2542 proven. 53 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-06 22:38:24,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4579 backedges. 316 proven. 799 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [2023-11-06 22:38:25,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:25,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473111118] [2023-11-06 22:38:25,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:25,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613397214] [2023-11-06 22:38:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613397214] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:25,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 20 [2023-11-06 22:38:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297367474] [2023-11-06 22:38:25,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:25,889 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:38:25,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:38:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:38:25,890 INFO L87 Difference]: Start difference. First operand 2645 states and 4588 transitions. cyclomatic complexity: 1975 Second operand has 17 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 11 states have call successors, (19), 1 states have call predecessors, (19), 4 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) [2023-11-06 22:38:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:26,584 INFO L93 Difference]: Finished difference Result 2849 states and 4958 transitions. [2023-11-06 22:38:26,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2849 states and 4958 transitions. [2023-11-06 22:38:26,649 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 299 [2023-11-06 22:38:26,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2849 states to 2849 states and 4958 transitions. [2023-11-06 22:38:26,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 950 [2023-11-06 22:38:26,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 950 [2023-11-06 22:38:26,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2849 states and 4958 transitions. [2023-11-06 22:38:26,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:26,684 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2849 states and 4958 transitions. [2023-11-06 22:38:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states and 4958 transitions. [2023-11-06 22:38:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2698. [2023-11-06 22:38:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 1682 states have (on average 1.063614744351962) internal successors, (1789), 1676 states have internal predecessors, (1789), 662 states have call successors, (687), 351 states have call predecessors, (687), 354 states have return successors, (2194), 670 states have call predecessors, (2194), 662 states have call successors, (2194) [2023-11-06 22:38:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 4670 transitions. [2023-11-06 22:38:26,775 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2698 states and 4670 transitions. [2023-11-06 22:38:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 22:38:26,776 INFO L428 stractBuchiCegarLoop]: Abstraction has 2698 states and 4670 transitions. [2023-11-06 22:38:26,776 INFO L335 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2023-11-06 22:38:26,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2698 states and 4670 transitions. [2023-11-06 22:38:26,789 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 253 [2023-11-06 22:38:26,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:38:26,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:38:26,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 12, 12, 12, 12, 12, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:26,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:26,792 INFO L748 eck$LassoCheckResult]: Stem: 132767#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 132712#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 132713#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; 132736#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; 132724#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 132726#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133466#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; 132708#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 132709#$Ultimate##0 ~n := #in~n; 133522#L25 assume ~n <= 0;#res := 1; 133519#factFINAL assume true; 133517#factEXIT >#72#return; 133513#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133514#$Ultimate##0 ~n := #in~n; 133518#L25 assume ~n <= 0;#res := 1; 133516#factFINAL assume true; 133512#factEXIT >#74#return; 133508#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133509#$Ultimate##0 ~n := #in~n; 133515#L25 assume ~n <= 0;#res := 1; 133511#factFINAL assume true; 133507#factEXIT >#76#return; 133503#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; 133501#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 133500#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133498#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133495#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; 133488#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133489#$Ultimate##0 ~n := #in~n; 133510#L25 assume !(~n <= 0); 133505#L26 call #t~ret0 := fact(~n - 1);< 133506#$Ultimate##0 ~n := #in~n; 133523#L25 assume ~n <= 0;#res := 1; 133521#factFINAL assume true; 133504#factEXIT >#70#return; 133502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133494#factFINAL assume true; 133487#factEXIT >#78#return; 133483#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133484#$Ultimate##0 ~n := #in~n; 133493#L25 assume ~n <= 0;#res := 1; 133486#factFINAL assume true; 133482#factEXIT >#80#return; 133476#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133478#$Ultimate##0 ~n := #in~n; 133497#L25 assume !(~n <= 0); 133491#L26 call #t~ret0 := fact(~n - 1);< 133492#$Ultimate##0 ~n := #in~n; 133499#L25 assume ~n <= 0;#res := 1; 133496#factFINAL assume true; 133490#factEXIT >#70#return; 133485#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133481#factFINAL assume true; 133475#factEXIT >#82#return; 133477#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; 133882#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 133876#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133875#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133874#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; 133619#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133624#$Ultimate##0 ~n := #in~n; 134033#L25 assume !(~n <= 0); 134025#L26 call #t~ret0 := fact(~n - 1);< 134031#$Ultimate##0 ~n := #in~n; 134044#L25 assume !(~n <= 0); 134026#L26 call #t~ret0 := fact(~n - 1);< 134043#$Ultimate##0 ~n := #in~n; 134047#L25 assume ~n <= 0;#res := 1; 134045#factFINAL assume true; 134042#factEXIT >#70#return; 134040#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134037#factFINAL assume true; 134024#factEXIT >#70#return; 134022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134021#factFINAL assume true; 133618#factEXIT >#78#return; 133623#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133612#$Ultimate##0 ~n := #in~n; 133873#L25 assume ~n <= 0;#res := 1; 133869#factFINAL assume true; 133865#factEXIT >#80#return; 133854#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133856#$Ultimate##0 ~n := #in~n; 133938#L25 assume !(~n <= 0); 133797#L26 call #t~ret0 := fact(~n - 1);< 133806#$Ultimate##0 ~n := #in~n; 133952#L25 assume !(~n <= 0); 133796#L26 call #t~ret0 := fact(~n - 1);< 133942#$Ultimate##0 ~n := #in~n; 133955#L25 assume ~n <= 0;#res := 1; 133953#factFINAL assume true; 133941#factEXIT >#70#return; 133939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133936#factFINAL assume true; 133818#factEXIT >#70#return; 133819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133944#factFINAL assume true; 133853#factEXIT >#82#return; 133849#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; 133847#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 133842#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133830#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 133826#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; 133789#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 133791#$Ultimate##0 ~n := #in~n; 133816#L25 assume !(~n <= 0); 133801#L26 call #t~ret0 := fact(~n - 1);< 133806#$Ultimate##0 ~n := #in~n; 133952#L25 assume !(~n <= 0); 133796#L26 call #t~ret0 := fact(~n - 1);< 133942#$Ultimate##0 ~n := #in~n; 133952#L25 assume !(~n <= 0); 133796#L26 call #t~ret0 := fact(~n - 1);< 133942#$Ultimate##0 ~n := #in~n; 133955#L25 assume ~n <= 0;#res := 1; 133953#factFINAL assume true; 133941#factEXIT >#70#return; 133939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133936#factFINAL assume true; 133818#factEXIT >#70#return; 133815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133807#factFINAL assume true; 133795#factEXIT >#70#return; 133794#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133793#factFINAL assume true; 133787#factEXIT >#78#return; 133674#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 133675#$Ultimate##0 ~n := #in~n; 133784#L25 assume ~n <= 0;#res := 1; 133783#factFINAL assume true; 133673#factEXIT >#80#return; 133590#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133591#$Ultimate##0 ~n := #in~n; 134127#L25 assume !(~n <= 0); 133539#L26 call #t~ret0 := fact(~n - 1);< 133578#$Ultimate##0 ~n := #in~n; 133670#L25 assume !(~n <= 0); 133547#L26 call #t~ret0 := fact(~n - 1);< 133596#$Ultimate##0 ~n := #in~n; 133681#L25 assume !(~n <= 0); 133537#L26 call #t~ret0 := fact(~n - 1);< 133602#$Ultimate##0 ~n := #in~n; 133680#L25 assume ~n <= 0;#res := 1; 133679#factFINAL assume true; 133601#factEXIT >#70#return; 133599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133597#factFINAL assume true; 133594#factEXIT >#70#return; 133593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133592#factFINAL assume true; 133583#factEXIT >#70#return; 133550#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134125#factFINAL assume true; 133604#factEXIT >#82#return; 133473#L30-8 [2023-11-06 22:38:26,792 INFO L750 eck$LassoCheckResult]: Loop: 133473#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; 132737#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 132738#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 133520#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 132740#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; 132688#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 132689#$Ultimate##0 ~n := #in~n; 133553#L25 assume !(~n <= 0); 133540#L26 call #t~ret0 := fact(~n - 1);< 133552#$Ultimate##0 ~n := #in~n; 133681#L25 assume !(~n <= 0); 133537#L26 call #t~ret0 := fact(~n - 1);< 133602#$Ultimate##0 ~n := #in~n; 133681#L25 assume !(~n <= 0); 133537#L26 call #t~ret0 := fact(~n - 1);< 133602#$Ultimate##0 ~n := #in~n; 133681#L25 assume !(~n <= 0); 133537#L26 call #t~ret0 := fact(~n - 1);< 133602#$Ultimate##0 ~n := #in~n; 133681#L25 assume !(~n <= 0); 133537#L26 call #t~ret0 := fact(~n - 1);< 133602#$Ultimate##0 ~n := #in~n; 133681#L25 assume !(~n <= 0); 133537#L26 call #t~ret0 := fact(~n - 1);< 133602#$Ultimate##0 ~n := #in~n; 133681#L25 assume !(~n <= 0); 133537#L26 call #t~ret0 := fact(~n - 1);< 133602#$Ultimate##0 ~n := #in~n; 133681#L25 assume !(~n <= 0); 133537#L26 call #t~ret0 := fact(~n - 1);< 133602#$Ultimate##0 ~n := #in~n; 133680#L25 assume ~n <= 0;#res := 1; 133679#factFINAL assume true; 133601#factEXIT >#70#return; 133599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133597#factFINAL assume true; 133594#factEXIT >#70#return; 133593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133592#factFINAL assume true; 133583#factEXIT >#70#return; 133579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133576#factFINAL assume true; 133574#factEXIT >#70#return; 133571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133570#factFINAL assume true; 133568#factEXIT >#70#return; 133567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133565#factFINAL assume true; 133563#factEXIT >#70#return; 133560#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133558#factFINAL assume true; 133557#factEXIT >#70#return; 133549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133555#factFINAL assume true; 133535#factEXIT >#70#return; 133529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133525#factFINAL assume true; 133524#factEXIT >#78#return; 132762#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 132689#$Ultimate##0 ~n := #in~n; 133553#L25 assume ~n <= 0;#res := 1; 133531#factFINAL assume true; 133530#factEXIT >#80#return; 133480#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 133526#$Ultimate##0 ~n := #in~n; 133559#L25 assume !(~n <= 0); 133544#L26 call #t~ret0 := fact(~n - 1);< 132720#$Ultimate##0 ~n := #in~n; 133573#L25 assume !(~n <= 0); 133543#L26 call #t~ret0 := fact(~n - 1);< 133556#$Ultimate##0 ~n := #in~n; 133582#L25 assume !(~n <= 0); 133545#L26 call #t~ret0 := fact(~n - 1);< 133569#$Ultimate##0 ~n := #in~n; 133907#L25 assume !(~n <= 0); 133541#L26 call #t~ret0 := fact(~n - 1);< 133575#$Ultimate##0 ~n := #in~n; 133909#L25 assume !(~n <= 0); 133542#L26 call #t~ret0 := fact(~n - 1);< 133584#$Ultimate##0 ~n := #in~n; 133670#L25 assume !(~n <= 0); 133547#L26 call #t~ret0 := fact(~n - 1);< 133596#$Ultimate##0 ~n := #in~n; 133681#L25 assume !(~n <= 0); 133537#L26 call #t~ret0 := fact(~n - 1);< 133602#$Ultimate##0 ~n := #in~n; 133680#L25 assume ~n <= 0;#res := 1; 133679#factFINAL assume true; 133601#factEXIT >#70#return; 133599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133597#factFINAL assume true; 133594#factEXIT >#70#return; 133593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133592#factFINAL assume true; 133583#factEXIT >#70#return; 133579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133576#factFINAL assume true; 133574#factEXIT >#70#return; 133571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133570#factFINAL assume true; 133568#factEXIT >#70#return; 133567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133565#factFINAL assume true; 133563#factEXIT >#70#return; 133560#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133558#factFINAL assume true; 133557#factEXIT >#70#return; 133554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 133534#factFINAL assume true; 133479#factEXIT >#82#return; 133473#L30-8 [2023-11-06 22:38:26,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:26,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1133326761, now seen corresponding path program 14 times [2023-11-06 22:38:26,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:26,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784722160] [2023-11-06 22:38:26,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:26,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:26,806 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:26,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316130219] [2023-11-06 22:38:26,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:38:26,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:26,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:26,812 INFO L229 MonitoredProcess]: Starting monitored process 197 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:26,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Waiting until timeout for monitored process [2023-11-06 22:38:27,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:38:27,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:38:27,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:27,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:27,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1704146172, now seen corresponding path program 14 times [2023-11-06 22:38:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:27,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239197211] [2023-11-06 22:38:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:27,193 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:27,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588578491] [2023-11-06 22:38:27,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:38:27,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:27,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:27,197 INFO L229 MonitoredProcess]: Starting monitored process 198 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:27,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2023-11-06 22:38:27,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:38:27,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:27,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 22:38:27,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 127 proven. 434 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-11-06 22:38:27,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 127 proven. 539 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-06 22:38:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239197211] [2023-11-06 22:38:32,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588578491] [2023-11-06 22:38:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588578491] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:32,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:32,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 35] total 38 [2023-11-06 22:38:32,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213332251] [2023-11-06 22:38:32,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:32,588 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:38:32,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:32,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-06 22:38:32,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1261, Unknown=0, NotChecked=0, Total=1482 [2023-11-06 22:38:32,590 INFO L87 Difference]: Start difference. First operand 2698 states and 4670 transitions. cyclomatic complexity: 2005 Second operand has 39 states, 35 states have (on average 2.2) internal successors, (77), 35 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 17 states have return successors, (34), 19 states have call predecessors, (34), 21 states have call successors, (34) [2023-11-06 22:38:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:34,932 INFO L93 Difference]: Finished difference Result 3664 states and 6739 transitions. [2023-11-06 22:38:34,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3664 states and 6739 transitions. [2023-11-06 22:38:34,961 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 342 [2023-11-06 22:38:35,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3664 states to 3651 states and 6726 transitions. [2023-11-06 22:38:35,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1050 [2023-11-06 22:38:35,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1050 [2023-11-06 22:38:35,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3651 states and 6726 transitions. [2023-11-06 22:38:35,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:35,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3651 states and 6726 transitions. [2023-11-06 22:38:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states and 6726 transitions. [2023-11-06 22:38:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 2816. [2023-11-06 22:38:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 1746 states have (on average 1.061282932416953) internal successors, (1853), 1738 states have internal predecessors, (1853), 705 states have call successors, (730), 373 states have call predecessors, (730), 365 states have return successors, (2463), 704 states have call predecessors, (2463), 705 states have call successors, (2463) [2023-11-06 22:38:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5046 transitions. [2023-11-06 22:38:35,186 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2816 states and 5046 transitions. [2023-11-06 22:38:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:38:35,187 INFO L428 stractBuchiCegarLoop]: Abstraction has 2816 states and 5046 transitions. [2023-11-06 22:38:35,187 INFO L335 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2023-11-06 22:38:35,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2816 states and 5046 transitions. [2023-11-06 22:38:35,201 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 266 [2023-11-06 22:38:35,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:38:35,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:38:35,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 12, 12, 12, 12, 12, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:35,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 16, 16, 16, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:35,204 INFO L748 eck$LassoCheckResult]: Stem: 139881#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 139824#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 139825#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; 139847#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; 139882#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 139994#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 141762#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; 141757#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141758#$Ultimate##0 ~n := #in~n; 141765#L25 assume ~n <= 0;#res := 1; 141761#factFINAL assume true; 141756#factEXIT >#72#return; 139868#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139869#$Ultimate##0 ~n := #in~n; 141932#L25 assume ~n <= 0;#res := 1; 141930#factFINAL assume true; 141923#factEXIT >#74#return; 141782#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141783#$Ultimate##0 ~n := #in~n; 141925#L25 assume ~n <= 0;#res := 1; 141924#factFINAL assume true; 141781#factEXIT >#76#return; 141773#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; 139854#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 139855#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139880#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 141950#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; 141944#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141949#$Ultimate##0 ~n := #in~n; 141959#L25 assume !(~n <= 0); 141956#L26 call #t~ret0 := fact(~n - 1);< 141957#$Ultimate##0 ~n := #in~n; 141960#L25 assume ~n <= 0;#res := 1; 141958#factFINAL assume true; 141955#factEXIT >#70#return; 141954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141943#factFINAL assume true; 141945#factEXIT >#78#return; 139876#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139877#$Ultimate##0 ~n := #in~n; 142077#L25 assume ~n <= 0;#res := 1; 142076#factFINAL assume true; 142072#factEXIT >#80#return; 139830#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 142068#$Ultimate##0 ~n := #in~n; 142064#L25 assume !(~n <= 0); 139829#L26 call #t~ret0 := fact(~n - 1);< 139831#$Ultimate##0 ~n := #in~n; 142154#L25 assume ~n <= 0;#res := 1; 142137#factFINAL assume true; 142135#factEXIT >#70#return; 142134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142127#factFINAL assume true; 142122#factEXIT >#82#return; 142119#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; 142117#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 142111#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 142102#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 142100#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; 142092#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 142097#$Ultimate##0 ~n := #in~n; 142115#L25 assume !(~n <= 0); 142105#L26 call #t~ret0 := fact(~n - 1);< 142110#$Ultimate##0 ~n := #in~n; 142124#L25 assume !(~n <= 0); 142104#L26 call #t~ret0 := fact(~n - 1);< 142121#$Ultimate##0 ~n := #in~n; 142128#L25 assume ~n <= 0;#res := 1; 142123#factFINAL assume true; 142120#factEXIT >#70#return; 142118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142112#factFINAL assume true; 142103#factEXIT >#70#return; 142101#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142099#factFINAL assume true; 142091#factEXIT >#78#return; 142096#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 142088#$Ultimate##0 ~n := #in~n; 142408#L25 assume ~n <= 0;#res := 1; 142407#factFINAL assume true; 142406#factEXIT >#80#return; 139816#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 142376#$Ultimate##0 ~n := #in~n; 142374#L25 assume !(~n <= 0); 142325#L26 call #t~ret0 := fact(~n - 1);< 142331#$Ultimate##0 ~n := #in~n; 142387#L25 assume !(~n <= 0); 142327#L26 call #t~ret0 := fact(~n - 1);< 142378#$Ultimate##0 ~n := #in~n; 142385#L25 assume ~n <= 0;#res := 1; 142382#factFINAL assume true; 142377#factEXIT >#70#return; 142375#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142373#factFINAL assume true; 142343#factEXIT >#70#return; 142344#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142554#factFINAL assume true; 142528#factEXIT >#82#return; 142523#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; 139850#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 139851#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139867#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139853#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; 139800#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139801#$Ultimate##0 ~n := #in~n; 142332#L25 assume !(~n <= 0); 142328#L26 call #t~ret0 := fact(~n - 1);< 142331#$Ultimate##0 ~n := #in~n; 142387#L25 assume !(~n <= 0); 142327#L26 call #t~ret0 := fact(~n - 1);< 142378#$Ultimate##0 ~n := #in~n; 142387#L25 assume !(~n <= 0); 142327#L26 call #t~ret0 := fact(~n - 1);< 142378#$Ultimate##0 ~n := #in~n; 142385#L25 assume ~n <= 0;#res := 1; 142382#factFINAL assume true; 142377#factEXIT >#70#return; 142375#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142373#factFINAL assume true; 142343#factEXIT >#70#return; 142342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142339#factFINAL assume true; 142321#factEXIT >#70#return; 142320#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142319#factFINAL assume true; 142299#factEXIT >#78#return; 139861#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 142550#$Ultimate##0 ~n := #in~n; 139860#L25 assume ~n <= 0;#res := 1; 139862#factFINAL assume true; 142564#factEXIT >#80#return; 139813#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139883#$Ultimate##0 ~n := #in~n; 142610#L25 assume !(~n <= 0); 141973#L26 call #t~ret0 := fact(~n - 1);< 142018#$Ultimate##0 ~n := #in~n; 142160#L25 assume !(~n <= 0); 141969#L26 call #t~ret0 := fact(~n - 1);< 142067#$Ultimate##0 ~n := #in~n; 142080#L25 assume !(~n <= 0); 141966#L26 call #t~ret0 := fact(~n - 1);< 142074#$Ultimate##0 ~n := #in~n; 142079#L25 assume ~n <= 0;#res := 1; 142078#factFINAL assume true; 142073#factEXIT >#70#return; 142070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142069#factFINAL assume true; 142065#factEXIT >#70#return; 142063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142061#factFINAL assume true; 142025#factEXIT >#70#return; 139858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139812#factFINAL assume true; 139814#factEXIT >#82#return; 139808#L30-8 [2023-11-06 22:38:35,204 INFO L750 eck$LassoCheckResult]: Loop: 139808#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; 139848#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 139849#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139866#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139852#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; 139798#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139799#$Ultimate##0 ~n := #in~n; 141951#L25 assume !(~n <= 0); 141952#L26 call #t~ret0 := fact(~n - 1);< 141979#$Ultimate##0 ~n := #in~n; 142080#L25 assume !(~n <= 0); 141966#L26 call #t~ret0 := fact(~n - 1);< 142074#$Ultimate##0 ~n := #in~n; 142080#L25 assume !(~n <= 0); 141966#L26 call #t~ret0 := fact(~n - 1);< 142074#$Ultimate##0 ~n := #in~n; 142080#L25 assume !(~n <= 0); 141966#L26 call #t~ret0 := fact(~n - 1);< 142074#$Ultimate##0 ~n := #in~n; 142080#L25 assume !(~n <= 0); 141966#L26 call #t~ret0 := fact(~n - 1);< 142074#$Ultimate##0 ~n := #in~n; 142080#L25 assume !(~n <= 0); 141966#L26 call #t~ret0 := fact(~n - 1);< 142074#$Ultimate##0 ~n := #in~n; 142080#L25 assume !(~n <= 0); 141966#L26 call #t~ret0 := fact(~n - 1);< 142074#$Ultimate##0 ~n := #in~n; 142080#L25 assume !(~n <= 0); 141966#L26 call #t~ret0 := fact(~n - 1);< 142074#$Ultimate##0 ~n := #in~n; 142079#L25 assume ~n <= 0;#res := 1; 142078#factFINAL assume true; 142073#factEXIT >#70#return; 142070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142069#factFINAL assume true; 142065#factEXIT >#70#return; 142063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142061#factFINAL assume true; 142025#factEXIT >#70#return; 142019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142017#factFINAL assume true; 142010#factEXIT >#70#return; 142009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142007#factFINAL assume true; 142002#factEXIT >#70#return; 142001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141998#factFINAL assume true; 141995#factEXIT >#70#return; 141994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141993#factFINAL assume true; 141992#factEXIT >#70#return; 141976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141982#factFINAL assume true; 141962#factEXIT >#70#return; 141961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141953#factFINAL assume true; 141937#factEXIT >#78#return; 141938#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139799#$Ultimate##0 ~n := #in~n; 141951#L25 assume ~n <= 0;#res := 1; 141948#factFINAL assume true; 141947#factEXIT >#80#return; 141939#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141946#$Ultimate##0 ~n := #in~n; 141986#L25 assume !(~n <= 0); 141967#L26 call #t~ret0 := fact(~n - 1);< 142089#$Ultimate##0 ~n := #in~n; 142081#L25 assume !(~n <= 0); 141968#L26 call #t~ret0 := fact(~n - 1);< 141983#$Ultimate##0 ~n := #in~n; 142526#L25 assume !(~n <= 0); 141965#L26 call #t~ret0 := fact(~n - 1);< 141997#$Ultimate##0 ~n := #in~n; 142414#L25 assume !(~n <= 0); 141964#L26 call #t~ret0 := fact(~n - 1);< 142003#$Ultimate##0 ~n := #in~n; 142527#L25 assume !(~n <= 0); 141971#L26 call #t~ret0 := fact(~n - 1);< 142011#$Ultimate##0 ~n := #in~n; 142540#L25 assume !(~n <= 0); 141963#L26 call #t~ret0 := fact(~n - 1);< 142026#$Ultimate##0 ~n := #in~n; 142160#L25 assume !(~n <= 0); 141969#L26 call #t~ret0 := fact(~n - 1);< 142067#$Ultimate##0 ~n := #in~n; 142080#L25 assume !(~n <= 0); 141966#L26 call #t~ret0 := fact(~n - 1);< 142074#$Ultimate##0 ~n := #in~n; 142079#L25 assume ~n <= 0;#res := 1; 142078#factFINAL assume true; 142073#factEXIT >#70#return; 142070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142069#factFINAL assume true; 142065#factEXIT >#70#return; 142063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142061#factFINAL assume true; 142025#factEXIT >#70#return; 142019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142017#factFINAL assume true; 142010#factEXIT >#70#return; 142009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142007#factFINAL assume true; 142002#factEXIT >#70#return; 142001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141998#factFINAL assume true; 141995#factEXIT >#70#return; 141994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141993#factFINAL assume true; 141992#factEXIT >#70#return; 141976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141982#factFINAL assume true; 141962#factEXIT >#70#return; 141961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141953#factFINAL assume true; 141937#factEXIT >#82#return; 139808#L30-8 [2023-11-06 22:38:35,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:35,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1133326761, now seen corresponding path program 15 times [2023-11-06 22:38:35,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:35,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151397929] [2023-11-06 22:38:35,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:35,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:35,218 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:35,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515485963] [2023-11-06 22:38:35,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:38:35,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:35,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:35,224 INFO L229 MonitoredProcess]: Starting monitored process 199 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:35,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Waiting until timeout for monitored process [2023-11-06 22:38:35,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-06 22:38:35,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:38:35,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:35,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:35,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1898041476, now seen corresponding path program 15 times [2023-11-06 22:38:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:35,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179491441] [2023-11-06 22:38:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:35,678 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:35,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692925815] [2023-11-06 22:38:35,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:38:35,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:35,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:35,680 INFO L229 MonitoredProcess]: Starting monitored process 200 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:35,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Waiting until timeout for monitored process [2023-11-06 22:38:35,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2023-11-06 22:38:35,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:38:35,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:36,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:36,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:36,056 INFO L85 PathProgramCache]: Analyzing trace with hash -702014172, now seen corresponding path program 16 times [2023-11-06 22:38:36,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:36,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704496101] [2023-11-06 22:38:36,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:36,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:36,069 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:36,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379675239] [2023-11-06 22:38:36,069 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:38:36,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:36,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:36,071 INFO L229 MonitoredProcess]: Starting monitored process 201 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:36,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (201)] Waiting until timeout for monitored process [2023-11-06 22:38:36,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:38:36,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:36,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:38:36,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2211 proven. 83 refuted. 0 times theorem prover too weak. 2124 trivial. 0 not checked. [2023-11-06 22:38:36,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 571 proven. 329 refuted. 0 times theorem prover too weak. 3518 trivial. 0 not checked. [2023-11-06 22:38:37,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:37,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704496101] [2023-11-06 22:38:37,665 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:37,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379675239] [2023-11-06 22:38:37,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379675239] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:37,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:37,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 19 [2023-11-06 22:38:37,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603470295] [2023-11-06 22:38:37,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:38,799 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:38:38,799 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:38:38,799 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:38:38,799 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:38:38,799 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:38:38,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:38,799 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:38:38,799 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:38:38,800 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration34_Loop [2023-11-06 22:38:38,800 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:38:38,800 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:38:38,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:38,928 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:38:38,928 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:38:38,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:38,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:38,932 INFO L229 MonitoredProcess]: Starting monitored process 202 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:38,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:38,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:38,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2023-11-06 22:38:38,963 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:38,963 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=40320} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=40320} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:38,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:38,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:38,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:38,969 INFO L229 MonitoredProcess]: Starting monitored process 203 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:38,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:38,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:38,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2023-11-06 22:38:38,995 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:38,995 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=8} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:38,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:38,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:38,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,001 INFO L229 MonitoredProcess]: Starting monitored process 204 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:39,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:39,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2023-11-06 22:38:39,037 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:39,038 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=40320} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=40320} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:39,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2023-11-06 22:38:39,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,041 INFO L229 MonitoredProcess]: Starting monitored process 205 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2023-11-06 22:38:39,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:39,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:39,062 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:39,062 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=8} Honda state: {ULTIMATE.start_main_~x~0#1=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:39,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:39,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,068 INFO L229 MonitoredProcess]: Starting monitored process 206 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2023-11-06 22:38:39,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:39,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:39,085 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:39,085 INFO L440 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: [] [2023-11-06 22:38:39,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2023-11-06 22:38:39,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,089 INFO L229 MonitoredProcess]: Starting monitored process 207 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2023-11-06 22:38:39,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:39,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:39,104 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:39,104 INFO L440 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: [] [2023-11-06 22:38:39,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2023-11-06 22:38:39,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,108 INFO L229 MonitoredProcess]: Starting monitored process 208 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2023-11-06 22:38:39,110 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:39,110 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:39,130 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:39,130 INFO L440 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: [] [2023-11-06 22:38:39,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2023-11-06 22:38:39,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,134 INFO L229 MonitoredProcess]: Starting monitored process 209 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2023-11-06 22:38:39,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:39,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:39,148 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:39,148 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:39,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2023-11-06 22:38:39,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,153 INFO L229 MonitoredProcess]: Starting monitored process 210 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2023-11-06 22:38:39,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:39,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:39,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:39,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,173 INFO L229 MonitoredProcess]: Starting monitored process 211 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2023-11-06 22:38:39,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:38:39,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:39,201 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:38:39,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2023-11-06 22:38:39,205 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:38:39,205 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:38:39,205 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:38:39,205 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:38:39,205 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:38:39,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:38:39,205 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:38:39,205 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration34_Loop [2023-11-06 22:38:39,206 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:38:39,206 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:38:39,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:39,332 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:38:39,332 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:38:39,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,334 INFO L229 MonitoredProcess]: Starting monitored process 212 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2023-11-06 22:38:39,337 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 [2023-11-06 22:38:39,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:39,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:39,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:39,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:39,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:39,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:39,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:39,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:39,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2023-11-06 22:38:39,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,354 INFO L229 MonitoredProcess]: Starting monitored process 213 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2023-11-06 22:38:39,358 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 [2023-11-06 22:38:39,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:39,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:39,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:39,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:39,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:39,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:39,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:39,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:39,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2023-11-06 22:38:39,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,375 INFO L229 MonitoredProcess]: Starting monitored process 214 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2023-11-06 22:38:39,378 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 [2023-11-06 22:38:39,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:39,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:39,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:39,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:39,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:39,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:39,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:39,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:39,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Ended with exit code 0 [2023-11-06 22:38:39,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,394 INFO L229 MonitoredProcess]: Starting monitored process 215 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2023-11-06 22:38:39,398 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 [2023-11-06 22:38:39,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:39,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:39,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:39,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:39,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:39,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:39,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:39,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:39,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2023-11-06 22:38:39,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,414 INFO L229 MonitoredProcess]: Starting monitored process 216 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2023-11-06 22:38:39,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:38:39,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:39,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:39,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:39,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:39,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:39,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:39,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:39,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:39,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2023-11-06 22:38:39,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,433 INFO L229 MonitoredProcess]: Starting monitored process 217 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2023-11-06 22:38:39,435 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 [2023-11-06 22:38:39,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:39,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:39,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:39,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:39,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:39,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:39,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:39,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:39,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Ended with exit code 0 [2023-11-06 22:38:39,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,453 INFO L229 MonitoredProcess]: Starting monitored process 218 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2023-11-06 22:38:39,455 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 [2023-11-06 22:38:39,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:39,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:39,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:39,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:39,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:39,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:39,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:39,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:39,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2023-11-06 22:38:39,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,471 INFO L229 MonitoredProcess]: Starting monitored process 219 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2023-11-06 22:38:39,474 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 [2023-11-06 22:38:39,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:39,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:39,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:39,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:39,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:39,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:39,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:39,504 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:38:39,506 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:38:39,506 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:38:39,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:39,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:39,512 INFO L229 MonitoredProcess]: Starting monitored process 220 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:39,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2023-11-06 22:38:39,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:38:39,515 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:38:39,515 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:38:39,515 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 15 Supporting invariants [] [2023-11-06 22:38:39,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Ended with exit code 0 [2023-11-06 22:38:39,518 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:38:39,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:39,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-06 22:38:39,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:40,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-06 22:38:40,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2023-11-06 22:38:41,450 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2023-11-06 22:38:41,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2816 states and 5046 transitions. cyclomatic complexity: 2263 Second operand has 18 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (20), 13 states have call predecessors, (20), 6 states have call successors, (20) [2023-11-06 22:38:42,146 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2816 states and 5046 transitions. cyclomatic complexity: 2263. Second operand has 18 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (20), 13 states have call predecessors, (20), 6 states have call successors, (20) Result 5948 states and 9710 transitions. Complement of second has 91 states. [2023-11-06 22:38:42,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2023-11-06 22:38:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 6 states have call successors, (12), 2 states have call predecessors, (12), 11 states have return successors, (20), 13 states have call predecessors, (20), 6 states have call successors, (20) [2023-11-06 22:38:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 98 transitions. [2023-11-06 22:38:42,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 98 transitions. Stem has 154 letters. Loop has 116 letters. [2023-11-06 22:38:42,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:38:42,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 98 transitions. Stem has 270 letters. Loop has 116 letters. [2023-11-06 22:38:42,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:38:42,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 98 transitions. Stem has 154 letters. Loop has 232 letters. [2023-11-06 22:38:42,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:38:42,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5948 states and 9710 transitions. [2023-11-06 22:38:42,286 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 266 [2023-11-06 22:38:42,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:42,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5948 states to 3940 states and 6784 transitions. [2023-11-06 22:38:42,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 969 [2023-11-06 22:38:42,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 974 [2023-11-06 22:38:42,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3940 states and 6784 transitions. [2023-11-06 22:38:42,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:42,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3940 states and 6784 transitions. [2023-11-06 22:38:42,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states and 6784 transitions. [2023-11-06 22:38:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3262. [2023-11-06 22:38:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3262 states, 2028 states have (on average 1.0547337278106508) internal successors, (2139), 2022 states have internal predecessors, (2139), 783 states have call successors, (820), 435 states have call predecessors, (820), 451 states have return successors, (2853), 804 states have call predecessors, (2853), 783 states have call successors, (2853) [2023-11-06 22:38:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 5812 transitions. [2023-11-06 22:38:42,504 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3262 states and 5812 transitions. [2023-11-06 22:38:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:42,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:38:42,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:38:42,505 INFO L87 Difference]: Start difference. First operand 3262 states and 5812 transitions. Second operand has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 13 states have call successors, (25), 2 states have call predecessors, (25), 7 states have return successors, (28), 11 states have call predecessors, (28), 13 states have call successors, (28) [2023-11-06 22:38:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:43,204 INFO L93 Difference]: Finished difference Result 4071 states and 8090 transitions. [2023-11-06 22:38:43,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4071 states and 8090 transitions. [2023-11-06 22:38:43,245 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 457 [2023-11-06 22:38:43,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4071 states to 4029 states and 7992 transitions. [2023-11-06 22:38:43,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1309 [2023-11-06 22:38:43,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1309 [2023-11-06 22:38:43,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4029 states and 7992 transitions. [2023-11-06 22:38:43,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:43,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4029 states and 7992 transitions. [2023-11-06 22:38:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states and 7992 transitions. [2023-11-06 22:38:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 3513. [2023-11-06 22:38:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3513 states, 2148 states have (on average 1.0567970204841712) internal successors, (2270), 2142 states have internal predecessors, (2270), 914 states have call successors, (959), 435 states have call predecessors, (959), 451 states have return successors, (3328), 935 states have call predecessors, (3328), 914 states have call successors, (3328) [2023-11-06 22:38:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 6557 transitions. [2023-11-06 22:38:43,455 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3513 states and 6557 transitions. [2023-11-06 22:38:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:38:43,456 INFO L428 stractBuchiCegarLoop]: Abstraction has 3513 states and 6557 transitions. [2023-11-06 22:38:43,456 INFO L335 stractBuchiCegarLoop]: ======== Iteration 35 ============ [2023-11-06 22:38:43,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3513 states and 6557 transitions. [2023-11-06 22:38:43,475 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 331 [2023-11-06 22:38:43,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:38:43,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:38:43,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [34, 34, 19, 19, 19, 19, 15, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:43,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 17, 17, 17, 17, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:43,478 INFO L748 eck$LassoCheckResult]: Stem: 158580#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 158522#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 158523#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; 158544#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; 158581#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 158875#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 159942#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; 158518#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 158519#$Ultimate##0 ~n := #in~n; 160177#L25 assume ~n <= 0;#res := 1; 160156#factFINAL assume true; 160147#factEXIT >#72#return; 160142#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 160143#$Ultimate##0 ~n := #in~n; 160153#L25 assume ~n <= 0;#res := 1; 160152#factFINAL assume true; 160141#factEXIT >#74#return; 158502#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 158503#$Ultimate##0 ~n := #in~n; 160296#L25 assume ~n <= 0;#res := 1; 160295#factFINAL assume true; 160294#factEXIT >#76#return; 160292#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; 160290#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 160282#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 160277#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 160268#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; 158498#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 158499#$Ultimate##0 ~n := #in~n; 160233#L25 assume !(~n <= 0); 160231#L26 call #t~ret0 := fact(~n - 1);< 160232#$Ultimate##0 ~n := #in~n; 160240#L25 assume ~n <= 0;#res := 1; 160238#factFINAL assume true; 160230#factEXIT >#70#return; 160206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160200#factFINAL assume true; 160162#factEXIT >#78#return; 158574#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 158575#$Ultimate##0 ~n := #in~n; 160420#L25 assume ~n <= 0;#res := 1; 160418#factFINAL assume true; 160417#factEXIT >#80#return; 158507#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 158582#$Ultimate##0 ~n := #in~n; 160542#L25 assume !(~n <= 0); 158527#L26 call #t~ret0 := fact(~n - 1);< 158528#$Ultimate##0 ~n := #in~n; 158570#L25 assume ~n <= 0;#res := 1; 161121#factFINAL assume true; 161124#factEXIT >#70#return; 161122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161123#factFINAL assume true; 158506#factEXIT >#82#return; 158508#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; 158524#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 160848#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 160847#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 160846#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; 160622#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 160625#$Ultimate##0 ~n := #in~n; 160697#L25 assume !(~n <= 0); 160691#L26 call #t~ret0 := fact(~n - 1);< 160695#$Ultimate##0 ~n := #in~n; 161075#L25 assume !(~n <= 0); 160690#L26 call #t~ret0 := fact(~n - 1);< 161074#$Ultimate##0 ~n := #in~n; 161078#L25 assume ~n <= 0;#res := 1; 161076#factFINAL assume true; 161073#factEXIT >#70#return; 161071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161060#factFINAL assume true; 160688#factEXIT >#70#return; 160686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160681#factFINAL assume true; 160617#factEXIT >#78#return; 160624#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 160615#$Ultimate##0 ~n := #in~n; 160850#L25 assume ~n <= 0;#res := 1; 160849#factFINAL assume true; 160845#factEXIT >#80#return; 160839#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 160844#$Ultimate##0 ~n := #in~n; 160906#L25 assume !(~n <= 0); 160865#L26 call #t~ret0 := fact(~n - 1);< 160872#$Ultimate##0 ~n := #in~n; 160911#L25 assume !(~n <= 0); 160862#L26 call #t~ret0 := fact(~n - 1);< 160909#$Ultimate##0 ~n := #in~n; 161008#L25 assume ~n <= 0;#res := 1; 161007#factFINAL assume true; 160908#factEXIT >#70#return; 160907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160905#factFINAL assume true; 160902#factEXIT >#70#return; 160903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161126#factFINAL assume true; 160838#factEXIT >#82#return; 160837#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; 160835#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 160832#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 160831#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 160830#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; 160722#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 160724#$Ultimate##0 ~n := #in~n; 160873#L25 assume !(~n <= 0); 160863#L26 call #t~ret0 := fact(~n - 1);< 160872#$Ultimate##0 ~n := #in~n; 160911#L25 assume !(~n <= 0); 160862#L26 call #t~ret0 := fact(~n - 1);< 160909#$Ultimate##0 ~n := #in~n; 160911#L25 assume !(~n <= 0); 160862#L26 call #t~ret0 := fact(~n - 1);< 160909#$Ultimate##0 ~n := #in~n; 161008#L25 assume ~n <= 0;#res := 1; 161007#factFINAL assume true; 160908#factEXIT >#70#return; 160907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160905#factFINAL assume true; 160902#factEXIT >#70#return; 160900#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160875#factFINAL assume true; 160861#factEXIT >#70#return; 160859#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160826#factFINAL assume true; 160718#factEXIT >#78#return; 160723#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 160716#$Ultimate##0 ~n := #in~n; 160751#L25 assume ~n <= 0;#res := 1; 160748#factFINAL assume true; 160741#factEXIT >#80#return; 160657#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 160658#$Ultimate##0 ~n := #in~n; 161097#L25 assume !(~n <= 0); 160572#L26 call #t~ret0 := fact(~n - 1);< 160591#$Ultimate##0 ~n := #in~n; 160616#L25 assume !(~n <= 0); 160573#L26 call #t~ret0 := fact(~n - 1);< 160582#$Ultimate##0 ~n := #in~n; 161088#L25 assume !(~n <= 0); 160576#L26 call #t~ret0 := fact(~n - 1);< 160676#$Ultimate##0 ~n := #in~n; 161086#L25 assume ~n <= 0;#res := 1; 161085#factFINAL assume true; 160675#factEXIT >#70#return; 160606#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160602#factFINAL assume true; 160599#factEXIT >#70#return; 160597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160592#factFINAL assume true; 160590#factEXIT >#70#return; 160580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161096#factFINAL assume true; 160805#factEXIT >#82#return; 160654#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; 160645#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 160644#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 160642#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 160641#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; 160564#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 160567#$Ultimate##0 ~n := #in~n; 160587#L25 assume !(~n <= 0); 160574#L26 call #t~ret0 := fact(~n - 1);< 160582#$Ultimate##0 ~n := #in~n; 161088#L25 assume !(~n <= 0); 160576#L26 call #t~ret0 := fact(~n - 1);< 160676#$Ultimate##0 ~n := #in~n; 161088#L25 assume !(~n <= 0); 160576#L26 call #t~ret0 := fact(~n - 1);< 160676#$Ultimate##0 ~n := #in~n; 161088#L25 assume !(~n <= 0); 160576#L26 call #t~ret0 := fact(~n - 1);< 160676#$Ultimate##0 ~n := #in~n; 161086#L25 assume ~n <= 0;#res := 1; 161085#factFINAL assume true; 160675#factEXIT >#70#return; 160606#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160602#factFINAL assume true; 160599#factEXIT >#70#return; 160597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160592#factFINAL assume true; 160590#factEXIT >#70#return; 160589#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160583#factFINAL assume true; 160570#factEXIT >#70#return; 160569#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160568#factFINAL assume true; 160563#factEXIT >#78#return; 160555#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 160559#$Ultimate##0 ~n := #in~n; 160561#L25 assume ~n <= 0;#res := 1; 160560#factFINAL assume true; 160554#factEXIT >#80#return; 160288#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 160549#$Ultimate##0 ~n := #in~n; 160731#L25 assume !(~n <= 0); 160217#L26 call #t~ret0 := fact(~n - 1);< 160289#$Ultimate##0 ~n := #in~n; 160458#L25 assume !(~n <= 0); 160219#L26 call #t~ret0 := fact(~n - 1);< 160339#$Ultimate##0 ~n := #in~n; 160442#L25 assume !(~n <= 0); 160214#L26 call #t~ret0 := fact(~n - 1);< 160415#$Ultimate##0 ~n := #in~n; 160440#L25 assume ~n <= 0;#res := 1; 160439#factFINAL assume true; 160414#factEXIT >#70#return; 160412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160407#factFINAL assume true; 160337#factEXIT >#70#return; 160336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160334#factFINAL assume true; 160307#factEXIT >#70#return; 160227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 161120#factFINAL assume true; 160544#factEXIT >#82#return; 160190#L30-8 [2023-11-06 22:38:43,478 INFO L750 eck$LassoCheckResult]: Loop: 160190#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; 160260#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 160245#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 160243#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 160239#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; 160180#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 160188#$Ultimate##0 ~n := #in~n; 160203#L25 assume !(~n <= 0); 160204#L26 call #t~ret0 := fact(~n - 1);< 160229#$Ultimate##0 ~n := #in~n; 160442#L25 assume !(~n <= 0); 160214#L26 call #t~ret0 := fact(~n - 1);< 160415#$Ultimate##0 ~n := #in~n; 160442#L25 assume !(~n <= 0); 160214#L26 call #t~ret0 := fact(~n - 1);< 160415#$Ultimate##0 ~n := #in~n; 160442#L25 assume !(~n <= 0); 160214#L26 call #t~ret0 := fact(~n - 1);< 160415#$Ultimate##0 ~n := #in~n; 160442#L25 assume !(~n <= 0); 160214#L26 call #t~ret0 := fact(~n - 1);< 160415#$Ultimate##0 ~n := #in~n; 160442#L25 assume !(~n <= 0); 160214#L26 call #t~ret0 := fact(~n - 1);< 160415#$Ultimate##0 ~n := #in~n; 160442#L25 assume !(~n <= 0); 160214#L26 call #t~ret0 := fact(~n - 1);< 160415#$Ultimate##0 ~n := #in~n; 160442#L25 assume !(~n <= 0); 160214#L26 call #t~ret0 := fact(~n - 1);< 160415#$Ultimate##0 ~n := #in~n; 160442#L25 assume !(~n <= 0); 160214#L26 call #t~ret0 := fact(~n - 1);< 160415#$Ultimate##0 ~n := #in~n; 160440#L25 assume ~n <= 0;#res := 1; 160439#factFINAL assume true; 160414#factEXIT >#70#return; 160412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160407#factFINAL assume true; 160337#factEXIT >#70#return; 160336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160334#factFINAL assume true; 160307#factEXIT >#70#return; 160303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160287#factFINAL assume true; 160280#factEXIT >#70#return; 160279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160270#factFINAL assume true; 160258#factEXIT >#70#return; 160257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160255#factFINAL assume true; 160253#factEXIT >#70#return; 160252#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160249#factFINAL assume true; 160248#factEXIT >#70#return; 160246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160244#factFINAL assume true; 160241#factEXIT >#70#return; 160226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160234#factFINAL assume true; 160209#factEXIT >#70#return; 160205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160178#factFINAL assume true; 160182#factEXIT >#78#return; 160179#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 160188#$Ultimate##0 ~n := #in~n; 160203#L25 assume ~n <= 0;#res := 1; 160199#factFINAL assume true; 160187#factEXIT >#80#return; 160181#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 160183#$Ultimate##0 ~n := #in~n; 160247#L25 assume !(~n <= 0); 160220#L26 call #t~ret0 := fact(~n - 1);< 160236#$Ultimate##0 ~n := #in~n; 160888#L25 assume !(~n <= 0); 160212#L26 call #t~ret0 := fact(~n - 1);< 160237#$Ultimate##0 ~n := #in~n; 160895#L25 assume !(~n <= 0); 160213#L26 call #t~ret0 := fact(~n - 1);< 160254#$Ultimate##0 ~n := #in~n; 160341#L25 assume !(~n <= 0); 160218#L26 call #t~ret0 := fact(~n - 1);< 160259#$Ultimate##0 ~n := #in~n; 160448#L25 assume !(~n <= 0); 160216#L26 call #t~ret0 := fact(~n - 1);< 160281#$Ultimate##0 ~n := #in~n; 160537#L25 assume !(~n <= 0); 160221#L26 call #t~ret0 := fact(~n - 1);< 160308#$Ultimate##0 ~n := #in~n; 160458#L25 assume !(~n <= 0); 160219#L26 call #t~ret0 := fact(~n - 1);< 160339#$Ultimate##0 ~n := #in~n; 160442#L25 assume !(~n <= 0); 160214#L26 call #t~ret0 := fact(~n - 1);< 160415#$Ultimate##0 ~n := #in~n; 160440#L25 assume ~n <= 0;#res := 1; 160439#factFINAL assume true; 160414#factEXIT >#70#return; 160412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160407#factFINAL assume true; 160337#factEXIT >#70#return; 160336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160334#factFINAL assume true; 160307#factEXIT >#70#return; 160303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160287#factFINAL assume true; 160280#factEXIT >#70#return; 160279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160270#factFINAL assume true; 160258#factEXIT >#70#return; 160257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160255#factFINAL assume true; 160253#factEXIT >#70#return; 160252#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160249#factFINAL assume true; 160248#factEXIT >#70#return; 160246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160244#factFINAL assume true; 160241#factEXIT >#70#return; 160242#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 160269#factFINAL assume true; 160262#factEXIT >#82#return; 160190#L30-8 [2023-11-06 22:38:43,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash -179437148, now seen corresponding path program 17 times [2023-11-06 22:38:43,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:43,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523161870] [2023-11-06 22:38:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:43,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:43,492 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:43,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058790257] [2023-11-06 22:38:43,492 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:38:43,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:43,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:43,494 INFO L229 MonitoredProcess]: Starting monitored process 221 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:43,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (221)] Waiting until timeout for monitored process [2023-11-06 22:38:43,904 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2023-11-06 22:38:43,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:43,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 22:38:43,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 558 proven. 156 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2023-11-06 22:38:44,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 560 proven. 166 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2023-11-06 22:38:44,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:44,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523161870] [2023-11-06 22:38:44,896 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:44,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058790257] [2023-11-06 22:38:44,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058790257] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:44,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:44,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 22 [2023-11-06 22:38:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204561557] [2023-11-06 22:38:44,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:44,897 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:38:44,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash 97453244, now seen corresponding path program 16 times [2023-11-06 22:38:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:44,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925991179] [2023-11-06 22:38:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:44,906 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609350965] [2023-11-06 22:38:44,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:38:44,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:44,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:44,910 INFO L229 MonitoredProcess]: Starting monitored process 222 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:44,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (222)] Waiting until timeout for monitored process [2023-11-06 22:38:45,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:38:45,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:45,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-06 22:38:45,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 156 proven. 547 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2023-11-06 22:38:45,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 156 proven. 683 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2023-11-06 22:38:52,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:52,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925991179] [2023-11-06 22:38:52,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:52,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609350965] [2023-11-06 22:38:52,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609350965] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:52,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:52,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 39] total 42 [2023-11-06 22:38:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277943154] [2023-11-06 22:38:52,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:52,374 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:38:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:52,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-06 22:38:52,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1541, Unknown=0, NotChecked=0, Total=1806 [2023-11-06 22:38:52,376 INFO L87 Difference]: Start difference. First operand 3513 states and 6557 transitions. cyclomatic complexity: 3081 Second operand has 43 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 19 states have return successors, (38), 21 states have call predecessors, (38), 23 states have call successors, (38) [2023-11-06 22:38:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:38:55,021 INFO L93 Difference]: Finished difference Result 4847 states and 9533 transitions. [2023-11-06 22:38:55,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4847 states and 9533 transitions. [2023-11-06 22:38:55,066 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 441 [2023-11-06 22:38:55,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4847 states to 4832 states and 9518 transitions. [2023-11-06 22:38:55,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1296 [2023-11-06 22:38:55,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1296 [2023-11-06 22:38:55,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4832 states and 9518 transitions. [2023-11-06 22:38:55,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:38:55,126 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4832 states and 9518 transitions. [2023-11-06 22:38:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states and 9518 transitions. [2023-11-06 22:38:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 3641. [2023-11-06 22:38:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3641 states, 2216 states have (on average 1.0550541516245486) internal successors, (2338), 2208 states have internal predecessors, (2338), 963 states have call successors, (1008), 459 states have call predecessors, (1008), 462 states have return successors, (3698), 973 states have call predecessors, (3698), 963 states have call successors, (3698) [2023-11-06 22:38:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 7044 transitions. [2023-11-06 22:38:55,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3641 states and 7044 transitions. [2023-11-06 22:38:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-06 22:38:55,259 INFO L428 stractBuchiCegarLoop]: Abstraction has 3641 states and 7044 transitions. [2023-11-06 22:38:55,260 INFO L335 stractBuchiCegarLoop]: ======== Iteration 36 ============ [2023-11-06 22:38:55,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3641 states and 7044 transitions. [2023-11-06 22:38:55,282 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 348 [2023-11-06 22:38:55,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:38:55,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:38:55,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [34, 34, 19, 19, 19, 19, 15, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:55,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:55,284 INFO L748 eck$LassoCheckResult]: Stem: 169090#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 169028#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 169029#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; 169052#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; 169091#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 169253#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 171111#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; 171106#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 171107#$Ultimate##0 ~n := #in~n; 171114#L25 assume ~n <= 0;#res := 1; 171110#factFINAL assume true; 171105#factEXIT >#72#return; 169076#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 169077#$Ultimate##0 ~n := #in~n; 171573#L25 assume ~n <= 0;#res := 1; 171572#factFINAL assume true; 171570#factEXIT >#74#return; 171567#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 171568#$Ultimate##0 ~n := #in~n; 171571#L25 assume ~n <= 0;#res := 1; 171569#factFINAL assume true; 171566#factEXIT >#76#return; 171565#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; 171563#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 171564#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 171742#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 171741#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; 168999#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 169000#$Ultimate##0 ~n := #in~n; 171749#L25 assume !(~n <= 0); 171746#L26 call #t~ret0 := fact(~n - 1);< 171747#$Ultimate##0 ~n := #in~n; 171772#L25 assume ~n <= 0;#res := 1; 171771#factFINAL assume true; 171745#factEXIT >#70#return; 171744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171743#factFINAL assume true; 171735#factEXIT >#78#return; 171730#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 171731#$Ultimate##0 ~n := #in~n; 171736#L25 assume ~n <= 0;#res := 1; 171732#factFINAL assume true; 171729#factEXIT >#80#return; 169035#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 169092#$Ultimate##0 ~n := #in~n; 171785#L25 assume !(~n <= 0); 169034#L26 call #t~ret0 := fact(~n - 1);< 169036#$Ultimate##0 ~n := #in~n; 172182#L25 assume ~n <= 0;#res := 1; 172181#factFINAL assume true; 172180#factEXIT >#70#return; 172179#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172175#factFINAL assume true; 172173#factEXIT >#82#return; 172172#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; 172171#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 172166#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 172162#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 172157#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; 169008#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 172038#$Ultimate##0 ~n := #in~n; 172061#L25 assume !(~n <= 0); 172049#L26 call #t~ret0 := fact(~n - 1);< 172055#$Ultimate##0 ~n := #in~n; 172082#L25 assume !(~n <= 0); 172051#L26 call #t~ret0 := fact(~n - 1);< 172081#$Ultimate##0 ~n := #in~n; 172087#L25 assume ~n <= 0;#res := 1; 172085#factFINAL assume true; 172080#factEXIT >#70#return; 172064#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172057#factFINAL assume true; 172048#factEXIT >#70#return; 172044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172040#factFINAL assume true; 172035#factEXIT >#78#return; 172037#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 171992#$Ultimate##0 ~n := #in~n; 172286#L25 assume ~n <= 0;#res := 1; 172285#factFINAL assume true; 172284#factEXIT >#80#return; 172279#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 172283#$Ultimate##0 ~n := #in~n; 172554#L25 assume !(~n <= 0); 172295#L26 call #t~ret0 := fact(~n - 1);< 172337#$Ultimate##0 ~n := #in~n; 172396#L25 assume !(~n <= 0); 172300#L26 call #t~ret0 := fact(~n - 1);< 172395#$Ultimate##0 ~n := #in~n; 172392#L25 assume ~n <= 0;#res := 1; 172375#factFINAL assume true; 172356#factEXIT >#70#return; 172347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172335#factFINAL assume true; 172336#factEXIT >#70#return; 172402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172625#factFINAL assume true; 172277#factEXIT >#82#return; 172273#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; 172217#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 172216#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 172215#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 172213#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; 169001#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 169002#$Ultimate##0 ~n := #in~n; 172322#L25 assume !(~n <= 0); 172298#L26 call #t~ret0 := fact(~n - 1);< 172337#$Ultimate##0 ~n := #in~n; 172396#L25 assume !(~n <= 0); 172300#L26 call #t~ret0 := fact(~n - 1);< 172395#$Ultimate##0 ~n := #in~n; 172396#L25 assume !(~n <= 0); 172300#L26 call #t~ret0 := fact(~n - 1);< 172395#$Ultimate##0 ~n := #in~n; 172392#L25 assume ~n <= 0;#res := 1; 172375#factFINAL assume true; 172356#factEXIT >#70#return; 172347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172335#factFINAL assume true; 172336#factEXIT >#70#return; 172326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172327#factFINAL assume true; 172293#factEXIT >#70#return; 172303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172197#factFINAL assume true; 172200#factEXIT >#78#return; 172513#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 172516#$Ultimate##0 ~n := #in~n; 172565#L25 assume ~n <= 0;#res := 1; 172564#factFINAL assume true; 172559#factEXIT >#80#return; 172410#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 172413#$Ultimate##0 ~n := #in~n; 172408#L25 assume !(~n <= 0); 172317#L26 call #t~ret0 := fact(~n - 1);< 172334#$Ultimate##0 ~n := #in~n; 172432#L25 assume !(~n <= 0); 172316#L26 call #t~ret0 := fact(~n - 1);< 172306#$Ultimate##0 ~n := #in~n; 172400#L25 assume !(~n <= 0); 172312#L26 call #t~ret0 := fact(~n - 1);< 172398#$Ultimate##0 ~n := #in~n; 172401#L25 assume ~n <= 0;#res := 1; 172399#factFINAL assume true; 172397#factEXIT >#70#return; 172393#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172394#factFINAL assume true; 172406#factEXIT >#70#return; 172405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172403#factFINAL assume true; 172330#factEXIT >#70#return; 172331#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172636#factFINAL assume true; 172558#factEXIT >#82#return; 172556#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; 169055#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 169056#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 169089#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 172423#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; 172195#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 172328#$Ultimate##0 ~n := #in~n; 172329#L25 assume !(~n <= 0); 172305#L26 call #t~ret0 := fact(~n - 1);< 172306#$Ultimate##0 ~n := #in~n; 172400#L25 assume !(~n <= 0); 172312#L26 call #t~ret0 := fact(~n - 1);< 172398#$Ultimate##0 ~n := #in~n; 172400#L25 assume !(~n <= 0); 172312#L26 call #t~ret0 := fact(~n - 1);< 172398#$Ultimate##0 ~n := #in~n; 172400#L25 assume !(~n <= 0); 172312#L26 call #t~ret0 := fact(~n - 1);< 172398#$Ultimate##0 ~n := #in~n; 172401#L25 assume ~n <= 0;#res := 1; 172399#factFINAL assume true; 172397#factEXIT >#70#return; 172393#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172394#factFINAL assume true; 172406#factEXIT >#70#return; 172405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172403#factFINAL assume true; 172330#factEXIT >#70#return; 172332#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172310#factFINAL assume true; 172318#factEXIT >#70#return; 172289#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172290#factFINAL assume true; 172192#factEXIT >#78#return; 169004#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 172186#$Ultimate##0 ~n := #in~n; 172196#L25 assume ~n <= 0;#res := 1; 172562#factFINAL assume true; 169003#factEXIT >#80#return; 169005#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 172212#$Ultimate##0 ~n := #in~n; 169071#L25 assume !(~n <= 0); 169072#L26 call #t~ret0 := fact(~n - 1);< 169080#$Ultimate##0 ~n := #in~n; 169082#L25 assume !(~n <= 0); 171752#L26 call #t~ret0 := fact(~n - 1);< 171844#$Ultimate##0 ~n := #in~n; 172022#L25 assume !(~n <= 0); 171762#L26 call #t~ret0 := fact(~n - 1);< 172021#$Ultimate##0 ~n := #in~n; 172024#L25 assume ~n <= 0;#res := 1; 172023#factFINAL assume true; 172020#factEXIT >#70#return; 172018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171977#factFINAL assume true; 171842#factEXIT >#70#return; 171840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171839#factFINAL assume true; 171827#factEXIT >#70#return; 171768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 172634#factFINAL assume true; 172588#factEXIT >#82#return; 171632#L30-8 [2023-11-06 22:38:55,285 INFO L750 eck$LassoCheckResult]: Loop: 171632#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; 169053#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 169054#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 171562#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 171560#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; 171561#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 169087#$Ultimate##0 ~n := #in~n; 171770#L25 assume !(~n <= 0); 171763#L26 call #t~ret0 := fact(~n - 1);< 171769#$Ultimate##0 ~n := #in~n; 172022#L25 assume !(~n <= 0); 171762#L26 call #t~ret0 := fact(~n - 1);< 172021#$Ultimate##0 ~n := #in~n; 172022#L25 assume !(~n <= 0); 171762#L26 call #t~ret0 := fact(~n - 1);< 172021#$Ultimate##0 ~n := #in~n; 172022#L25 assume !(~n <= 0); 171762#L26 call #t~ret0 := fact(~n - 1);< 172021#$Ultimate##0 ~n := #in~n; 172022#L25 assume !(~n <= 0); 171762#L26 call #t~ret0 := fact(~n - 1);< 172021#$Ultimate##0 ~n := #in~n; 172022#L25 assume !(~n <= 0); 171762#L26 call #t~ret0 := fact(~n - 1);< 172021#$Ultimate##0 ~n := #in~n; 172022#L25 assume !(~n <= 0); 171762#L26 call #t~ret0 := fact(~n - 1);< 172021#$Ultimate##0 ~n := #in~n; 172022#L25 assume !(~n <= 0); 171762#L26 call #t~ret0 := fact(~n - 1);< 172021#$Ultimate##0 ~n := #in~n; 172022#L25 assume !(~n <= 0); 171762#L26 call #t~ret0 := fact(~n - 1);< 172021#$Ultimate##0 ~n := #in~n; 172024#L25 assume ~n <= 0;#res := 1; 172023#factFINAL assume true; 172020#factEXIT >#70#return; 172018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171977#factFINAL assume true; 171842#factEXIT >#70#return; 171840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171839#factFINAL assume true; 171827#factEXIT >#70#return; 171825#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171824#factFINAL assume true; 171816#factEXIT >#70#return; 171815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171813#factFINAL assume true; 171810#factEXIT >#70#return; 171809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171806#factFINAL assume true; 171803#factEXIT >#70#return; 171802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171799#factFINAL assume true; 171794#factEXIT >#70#return; 171793#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171787#factFINAL assume true; 171786#factEXIT >#70#return; 171765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171775#factFINAL assume true; 171750#factEXIT >#70#return; 171748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171737#factFINAL assume true; 171733#factEXIT >#78#return; 169086#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 169087#$Ultimate##0 ~n := #in~n; 171770#L25 assume ~n <= 0;#res := 1; 171740#factFINAL assume true; 171739#factEXIT >#80#return; 171734#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 171738#$Ultimate##0 ~n := #in~n; 171773#L25 assume !(~n <= 0); 171761#L26 call #t~ret0 := fact(~n - 1);< 172008#$Ultimate##0 ~n := #in~n; 172007#L25 assume !(~n <= 0); 171764#L26 call #t~ret0 := fact(~n - 1);< 171776#$Ultimate##0 ~n := #in~n; 171882#L25 assume !(~n <= 0); 171751#L26 call #t~ret0 := fact(~n - 1);< 171795#$Ultimate##0 ~n := #in~n; 171870#L25 assume !(~n <= 0); 171754#L26 call #t~ret0 := fact(~n - 1);< 171805#$Ultimate##0 ~n := #in~n; 171886#L25 assume !(~n <= 0); 171753#L26 call #t~ret0 := fact(~n - 1);< 171811#$Ultimate##0 ~n := #in~n; 172307#L25 assume !(~n <= 0); 171757#L26 call #t~ret0 := fact(~n - 1);< 171817#$Ultimate##0 ~n := #in~n; 171917#L25 assume !(~n <= 0); 171758#L26 call #t~ret0 := fact(~n - 1);< 171828#$Ultimate##0 ~n := #in~n; 169082#L25 assume !(~n <= 0); 171752#L26 call #t~ret0 := fact(~n - 1);< 171844#$Ultimate##0 ~n := #in~n; 172022#L25 assume !(~n <= 0); 171762#L26 call #t~ret0 := fact(~n - 1);< 172021#$Ultimate##0 ~n := #in~n; 172024#L25 assume ~n <= 0;#res := 1; 172023#factFINAL assume true; 172020#factEXIT >#70#return; 172018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171977#factFINAL assume true; 171842#factEXIT >#70#return; 171840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171839#factFINAL assume true; 171827#factEXIT >#70#return; 171825#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171824#factFINAL assume true; 171816#factEXIT >#70#return; 171815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171813#factFINAL assume true; 171810#factEXIT >#70#return; 171809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171806#factFINAL assume true; 171803#factEXIT >#70#return; 171802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171799#factFINAL assume true; 171794#factEXIT >#70#return; 171793#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171787#factFINAL assume true; 171786#factEXIT >#70#return; 171765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171775#factFINAL assume true; 171750#factEXIT >#70#return; 171748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 171737#factFINAL assume true; 171733#factEXIT >#82#return; 171632#L30-8 [2023-11-06 22:38:55,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash -179437148, now seen corresponding path program 18 times [2023-11-06 22:38:55,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:55,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230225954] [2023-11-06 22:38:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:55,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:55,300 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830943440] [2023-11-06 22:38:55,300 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:38:55,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:55,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:55,375 INFO L229 MonitoredProcess]: Starting monitored process 223 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:55,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (223)] Waiting until timeout for monitored process [2023-11-06 22:38:55,867 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2023-11-06 22:38:55,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:55,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:38:55,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 678 proven. 155 refuted. 0 times theorem prover too weak. 1803 trivial. 0 not checked. [2023-11-06 22:38:56,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 678 proven. 168 refuted. 0 times theorem prover too weak. 1790 trivial. 0 not checked. [2023-11-06 22:38:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230225954] [2023-11-06 22:38:57,075 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:38:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830943440] [2023-11-06 22:38:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830943440] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:57,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:38:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 22 [2023-11-06 22:38:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985950076] [2023-11-06 22:38:57,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:57,077 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:38:57,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash -262221316, now seen corresponding path program 17 times [2023-11-06 22:38:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:57,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204229261] [2023-11-06 22:38:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:57,086 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:38:57,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984342411] [2023-11-06 22:38:57,086 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:38:57,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:57,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:57,088 INFO L229 MonitoredProcess]: Starting monitored process 224 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:57,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (224)] Waiting until timeout for monitored process [2023-11-06 22:38:57,504 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2023-11-06 22:38:57,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:38:57,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:38:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:38:57,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:38:58,791 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:38:58,791 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:38:58,791 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:38:58,791 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:38:58,791 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:38:58,792 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:58,792 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:38:58,792 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:38:58,792 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration36_Loop [2023-11-06 22:38:58,792 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:38:58,792 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:38:58,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:58,926 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:38:58,926 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:38:58,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:58,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:58,927 INFO L229 MonitoredProcess]: Starting monitored process 225 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:58,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2023-11-06 22:38:58,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:58,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:58,942 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:58,942 INFO L440 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: [] [2023-11-06 22:38:58,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Ended with exit code 0 [2023-11-06 22:38:58,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:58,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:58,946 INFO L229 MonitoredProcess]: Starting monitored process 226 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:58,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2023-11-06 22:38:58,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:58,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:58,960 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:58,960 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:58,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2023-11-06 22:38:58,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:58,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:58,965 INFO L229 MonitoredProcess]: Starting monitored process 227 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:58,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2023-11-06 22:38:58,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:58,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:58,979 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:58,979 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=362880} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=362880} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:58,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Ended with exit code 0 [2023-11-06 22:38:58,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:58,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:58,983 INFO L229 MonitoredProcess]: Starting monitored process 228 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:58,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2023-11-06 22:38:58,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:58,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:58,998 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:58,998 INFO L440 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: [] [2023-11-06 22:38:59,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Ended with exit code 0 [2023-11-06 22:38:59,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,002 INFO L229 MonitoredProcess]: Starting monitored process 229 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2023-11-06 22:38:59,004 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:59,004 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:59,016 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:59,016 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:59,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:59,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,020 INFO L229 MonitoredProcess]: Starting monitored process 230 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2023-11-06 22:38:59,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:59,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:59,035 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:59,035 INFO L440 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: [] [2023-11-06 22:38:59,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Ended with exit code 0 [2023-11-06 22:38:59,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,039 INFO L229 MonitoredProcess]: Starting monitored process 231 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2023-11-06 22:38:59,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:59,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:59,053 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:59,053 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=9} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:59,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Ended with exit code 0 [2023-11-06 22:38:59,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,057 INFO L229 MonitoredProcess]: Starting monitored process 232 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2023-11-06 22:38:59,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:59,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:59,072 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:59,072 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=362880} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=362880} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:59,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Ended with exit code 0 [2023-11-06 22:38:59,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,076 INFO L229 MonitoredProcess]: Starting monitored process 233 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2023-11-06 22:38:59,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:59,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:59,096 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:38:59,096 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=9} Honda state: {ULTIMATE.start_main_~x~0#1=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:38:59,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Ended with exit code 0 [2023-11-06 22:38:59,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,100 INFO L229 MonitoredProcess]: Starting monitored process 234 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2023-11-06 22:38:59,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:38:59,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:59,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Ended with exit code 0 [2023-11-06 22:38:59,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,125 INFO L229 MonitoredProcess]: Starting monitored process 235 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2023-11-06 22:38:59,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:38:59,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:38:59,140 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:38:59,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Ended with exit code 0 [2023-11-06 22:38:59,143 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:38:59,143 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:38:59,143 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:38:59,143 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:38:59,143 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:38:59,143 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,143 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:38:59,144 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:38:59,144 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration36_Loop [2023-11-06 22:38:59,144 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:38:59,144 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:38:59,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:38:59,277 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:38:59,277 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:38:59,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,278 INFO L229 MonitoredProcess]: Starting monitored process 236 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2023-11-06 22:38:59,281 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 [2023-11-06 22:38:59,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Ended with exit code 0 [2023-11-06 22:38:59,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,302 INFO L229 MonitoredProcess]: Starting monitored process 237 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2023-11-06 22:38:59,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 [2023-11-06 22:38:59,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Ended with exit code 0 [2023-11-06 22:38:59,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,319 INFO L229 MonitoredProcess]: Starting monitored process 238 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Waiting until timeout for monitored process [2023-11-06 22:38:59,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 [2023-11-06 22:38:59,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Ended with exit code 0 [2023-11-06 22:38:59,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,339 INFO L229 MonitoredProcess]: Starting monitored process 239 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2023-11-06 22:38:59,342 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 [2023-11-06 22:38:59,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:59,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,358 INFO L229 MonitoredProcess]: Starting monitored process 240 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Waiting until timeout for monitored process [2023-11-06 22:38:59,361 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 [2023-11-06 22:38:59,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:59,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,378 INFO L229 MonitoredProcess]: Starting monitored process 241 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2023-11-06 22:38:59,381 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 [2023-11-06 22:38:59,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:59,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,398 INFO L229 MonitoredProcess]: Starting monitored process 242 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2023-11-06 22:38:59,401 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 [2023-11-06 22:38:59,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Ended with exit code 0 [2023-11-06 22:38:59,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,417 INFO L229 MonitoredProcess]: Starting monitored process 243 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Waiting until timeout for monitored process [2023-11-06 22:38:59,420 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 [2023-11-06 22:38:59,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Ended with exit code 0 [2023-11-06 22:38:59,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,438 INFO L229 MonitoredProcess]: Starting monitored process 244 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Waiting until timeout for monitored process [2023-11-06 22:38:59,440 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 [2023-11-06 22:38:59,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Ended with exit code 0 [2023-11-06 22:38:59,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,456 INFO L229 MonitoredProcess]: Starting monitored process 245 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2023-11-06 22:38:59,458 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 [2023-11-06 22:38:59,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:59,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,475 INFO L229 MonitoredProcess]: Starting monitored process 246 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2023-11-06 22:38:59,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 [2023-11-06 22:38:59,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:38:59,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Ended with exit code 0 [2023-11-06 22:38:59,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,494 INFO L229 MonitoredProcess]: Starting monitored process 247 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Waiting until timeout for monitored process [2023-11-06 22:38:59,497 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 [2023-11-06 22:38:59,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:38:59,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:38:59,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:38:59,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:38:59,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:38:59,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:38:59,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:38:59,510 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:38:59,512 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:38:59,512 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:38:59,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:38:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,516 INFO L229 MonitoredProcess]: Starting monitored process 248 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2023-11-06 22:38:59,517 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:38:59,517 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:38:59,517 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:38:59,517 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 17 Supporting invariants [] [2023-11-06 22:38:59,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Ended with exit code 0 [2023-11-06 22:38:59,520 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:38:59,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:59,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-06 22:38:59,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:00,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:01,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-06 22:39:01,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 0 proven. 618 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2023-11-06 22:39:01,972 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 16 loop predicates [2023-11-06 22:39:01,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3641 states and 7044 transitions. cyclomatic complexity: 3440 Second operand has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (12), 2 states have call predecessors, (12), 12 states have return successors, (21), 14 states have call predecessors, (21), 6 states have call successors, (21) [2023-11-06 22:39:02,680 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3641 states and 7044 transitions. cyclomatic complexity: 3440. Second operand has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (12), 2 states have call predecessors, (12), 12 states have return successors, (21), 14 states have call predecessors, (21), 6 states have call successors, (21) Result 8023 states and 13823 transitions. Complement of second has 99 states. [2023-11-06 22:39:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 2 stem states 15 non-accepting loop states 1 accepting loop states [2023-11-06 22:39:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (12), 2 states have call predecessors, (12), 12 states have return successors, (21), 14 states have call predecessors, (21), 6 states have call successors, (21) [2023-11-06 22:39:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 103 transitions. [2023-11-06 22:39:02,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 103 transitions. Stem has 216 letters. Loop has 128 letters. [2023-11-06 22:39:02,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:39:02,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 103 transitions. Stem has 344 letters. Loop has 128 letters. [2023-11-06 22:39:02,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:39:02,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 103 transitions. Stem has 216 letters. Loop has 256 letters. [2023-11-06 22:39:02,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:39:02,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8023 states and 13823 transitions. [2023-11-06 22:39:02,759 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 348 [2023-11-06 22:39:02,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8023 states to 5154 states and 9459 transitions. [2023-11-06 22:39:02,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1192 [2023-11-06 22:39:02,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1198 [2023-11-06 22:39:02,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5154 states and 9459 transitions. [2023-11-06 22:39:02,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:39:02,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5154 states and 9459 transitions. [2023-11-06 22:39:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5154 states and 9459 transitions. [2023-11-06 22:39:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5154 to 4157. [2023-11-06 22:39:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4157 states, 2542 states have (on average 1.049567269866247) internal successors, (2668), 2536 states have internal predecessors, (2668), 1053 states have call successors, (1112), 531 states have call predecessors, (1112), 562 states have return successors, (4192), 1089 states have call predecessors, (4192), 1053 states have call successors, (4192) [2023-11-06 22:39:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 4157 states and 7972 transitions. [2023-11-06 22:39:03,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4157 states and 7972 transitions. [2023-11-06 22:39:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:39:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:39:03,003 INFO L87 Difference]: Start difference. First operand 4157 states and 7972 transitions. Second operand has 23 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 22 states have internal predecessors, (58), 12 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2023-11-06 22:39:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:03,937 INFO L93 Difference]: Finished difference Result 6009 states and 12375 transitions. [2023-11-06 22:39:03,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6009 states and 12375 transitions. [2023-11-06 22:39:04,038 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 431 [2023-11-06 22:39:04,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6009 states to 5961 states and 12213 transitions. [2023-11-06 22:39:04,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1414 [2023-11-06 22:39:04,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1414 [2023-11-06 22:39:04,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5961 states and 12213 transitions. [2023-11-06 22:39:04,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:39:04,140 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5961 states and 12213 transitions. [2023-11-06 22:39:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states and 12213 transitions. [2023-11-06 22:39:04,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 4754. [2023-11-06 22:39:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 2900 states have (on average 1.0479310344827586) internal successors, (3039), 2892 states have internal predecessors, (3039), 1264 states have call successors, (1361), 593 states have call predecessors, (1361), 590 states have return successors, (5203), 1268 states have call predecessors, (5203), 1264 states have call successors, (5203) [2023-11-06 22:39:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 9603 transitions. [2023-11-06 22:39:04,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4754 states and 9603 transitions. [2023-11-06 22:39:04,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:39:04,331 INFO L428 stractBuchiCegarLoop]: Abstraction has 4754 states and 9603 transitions. [2023-11-06 22:39:04,332 INFO L335 stractBuchiCegarLoop]: ======== Iteration 37 ============ [2023-11-06 22:39:04,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4754 states and 9603 transitions. [2023-11-06 22:39:04,359 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 393 [2023-11-06 22:39:04,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:39:04,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:39:04,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [35, 35, 20, 20, 20, 20, 15, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:04,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [23, 23, 20, 20, 20, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:04,361 INFO L748 eck$LassoCheckResult]: Stem: 193465#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 193412#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 193413#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; 193433#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; 193466#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 193671#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 195123#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; 193408#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 193409#$Ultimate##0 ~n := #in~n; 195238#L25 assume ~n <= 0;#res := 1; 195233#factFINAL assume true; 195232#factEXIT >#72#return; 193452#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 193453#$Ultimate##0 ~n := #in~n; 195260#L25 assume ~n <= 0;#res := 1; 195259#factFINAL assume true; 195257#factEXIT >#74#return; 195254#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 195255#$Ultimate##0 ~n := #in~n; 195258#L25 assume ~n <= 0;#res := 1; 195256#factFINAL assume true; 195253#factEXIT >#76#return; 195252#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; 193438#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 193439#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 195365#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 195363#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; 195326#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 195361#$Ultimate##0 ~n := #in~n; 195379#L25 assume !(~n <= 0); 195368#L26 call #t~ret0 := fact(~n - 1);< 195369#$Ultimate##0 ~n := #in~n; 195380#L25 assume ~n <= 0;#res := 1; 195378#factFINAL assume true; 195367#factEXIT >#70#return; 195364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195325#factFINAL assume true; 195327#factEXIT >#78#return; 193462#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 193463#$Ultimate##0 ~n := #in~n; 195919#L25 assume ~n <= 0;#res := 1; 195917#factFINAL assume true; 195915#factEXIT >#80#return; 193417#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 195914#$Ultimate##0 ~n := #in~n; 195911#L25 assume !(~n <= 0); 193416#L26 call #t~ret0 := fact(~n - 1);< 193418#$Ultimate##0 ~n := #in~n; 196603#L25 assume ~n <= 0;#res := 1; 196600#factFINAL assume true; 196598#factEXIT >#70#return; 196595#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 196591#factFINAL assume true; 196589#factEXIT >#82#return; 196586#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; 196585#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 196582#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 196576#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 196573#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; 195444#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 195455#$Ultimate##0 ~n := #in~n; 195470#L25 assume !(~n <= 0); 195463#L26 call #t~ret0 := fact(~n - 1);< 195469#$Ultimate##0 ~n := #in~n; 195487#L25 assume !(~n <= 0); 195464#L26 call #t~ret0 := fact(~n - 1);< 195485#$Ultimate##0 ~n := #in~n; 195489#L25 assume ~n <= 0;#res := 1; 195486#factFINAL assume true; 195484#factEXIT >#70#return; 195482#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195472#factFINAL assume true; 195461#factEXIT >#70#return; 195460#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195459#factFINAL assume true; 195443#factEXIT >#78#return; 195452#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 195433#$Ultimate##0 ~n := #in~n; 196110#L25 assume ~n <= 0;#res := 1; 196109#factFINAL assume true; 196106#factEXIT >#80#return; 195931#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 196020#$Ultimate##0 ~n := #in~n; 196012#L25 assume !(~n <= 0); 195728#L26 call #t~ret0 := fact(~n - 1);< 195733#$Ultimate##0 ~n := #in~n; 195990#L25 assume !(~n <= 0); 195724#L26 call #t~ret0 := fact(~n - 1);< 195989#$Ultimate##0 ~n := #in~n; 195975#L25 assume ~n <= 0;#res := 1; 195976#factFINAL assume true; 196005#factEXIT >#70#return; 196006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 196008#factFINAL assume true; 195995#factEXIT >#70#return; 195996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 196233#factFINAL assume true; 196230#factEXIT >#82#return; 196229#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; 196228#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 196227#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 196226#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 196225#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; 195704#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 195712#$Ultimate##0 ~n := #in~n; 195734#L25 assume !(~n <= 0); 195722#L26 call #t~ret0 := fact(~n - 1);< 195733#$Ultimate##0 ~n := #in~n; 195990#L25 assume !(~n <= 0); 195724#L26 call #t~ret0 := fact(~n - 1);< 195989#$Ultimate##0 ~n := #in~n; 195990#L25 assume !(~n <= 0); 195724#L26 call #t~ret0 := fact(~n - 1);< 195989#$Ultimate##0 ~n := #in~n; 195975#L25 assume ~n <= 0;#res := 1; 195976#factFINAL assume true; 196005#factEXIT >#70#return; 196006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 196008#factFINAL assume true; 195995#factEXIT >#70#return; 195920#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195921#factFINAL assume true; 195721#factEXIT >#70#return; 195720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195703#factFINAL assume true; 195711#factEXIT >#78#return; 196208#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 195692#$Ultimate##0 ~n := #in~n; 196218#L25 assume ~n <= 0;#res := 1; 196216#factFINAL assume true; 196207#factEXIT >#80#return; 196017#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 196018#$Ultimate##0 ~n := #in~n; 196572#L25 assume !(~n <= 0); 195744#L26 call #t~ret0 := fact(~n - 1);< 195993#$Ultimate##0 ~n := #in~n; 195992#L25 assume !(~n <= 0); 195746#L26 call #t~ret0 := fact(~n - 1);< 195960#$Ultimate##0 ~n := #in~n; 195983#L25 assume !(~n <= 0); 195741#L26 call #t~ret0 := fact(~n - 1);< 195982#$Ultimate##0 ~n := #in~n; 195986#L25 assume ~n <= 0;#res := 1; 195984#factFINAL assume true; 195981#factEXIT >#70#return; 195977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195967#factFINAL assume true; 195958#factEXIT >#70#return; 195951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195930#factFINAL assume true; 195924#factEXIT >#70#return; 195927#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 196570#factFINAL assume true; 196553#factEXIT >#82#return; 196554#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; 196656#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 196415#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 196416#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 196234#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; 195701#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 195702#$Ultimate##0 ~n := #in~n; 195736#L25 assume !(~n <= 0); 195738#L26 call #t~ret0 := fact(~n - 1);< 195960#$Ultimate##0 ~n := #in~n; 195983#L25 assume !(~n <= 0); 195741#L26 call #t~ret0 := fact(~n - 1);< 195982#$Ultimate##0 ~n := #in~n; 195983#L25 assume !(~n <= 0); 195741#L26 call #t~ret0 := fact(~n - 1);< 195982#$Ultimate##0 ~n := #in~n; 195983#L25 assume !(~n <= 0); 195741#L26 call #t~ret0 := fact(~n - 1);< 195982#$Ultimate##0 ~n := #in~n; 195986#L25 assume ~n <= 0;#res := 1; 195984#factFINAL assume true; 195981#factEXIT >#70#return; 195977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195967#factFINAL assume true; 195958#factEXIT >#70#return; 195951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195930#factFINAL assume true; 195924#factEXIT >#70#return; 195925#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195737#factFINAL assume true; 195749#factEXIT >#70#return; 196220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 196219#factFINAL assume true; 195696#factEXIT >#78#return; 195687#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 196213#$Ultimate##0 ~n := #in~n; 195717#L25 assume ~n <= 0;#res := 1; 195718#factFINAL assume true; 195686#factEXIT >#80#return; 193467#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 193468#$Ultimate##0 ~n := #in~n; 196704#L25 assume !(~n <= 0); 195352#L26 call #t~ret0 := fact(~n - 1);< 195412#$Ultimate##0 ~n := #in~n; 196608#L25 assume !(~n <= 0); 195337#L26 call #t~ret0 := fact(~n - 1);< 195417#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195457#L25 assume ~n <= 0;#res := 1; 195456#factFINAL assume true; 195439#factEXIT >#70#return; 195428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195424#factFINAL assume true; 195422#factEXIT >#70#return; 195421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195418#factFINAL assume true; 195414#factEXIT >#70#return; 195413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195410#factFINAL assume true; 195408#factEXIT >#70#return; 195358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 196698#factFINAL assume true; 196690#factEXIT >#82#return; 193351#L30-8 [2023-11-06 22:39:04,362 INFO L750 eck$LassoCheckResult]: Loop: 193351#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; 193414#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 193434#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 193445#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 193436#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; 193345#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 193346#$Ultimate##0 ~n := #in~n; 195362#L25 assume !(~n <= 0); 195338#L26 call #t~ret0 := fact(~n - 1);< 195360#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195457#L25 assume ~n <= 0;#res := 1; 195456#factFINAL assume true; 195439#factEXIT >#70#return; 195428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195424#factFINAL assume true; 195422#factEXIT >#70#return; 195421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195418#factFINAL assume true; 195414#factEXIT >#70#return; 195413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195410#factFINAL assume true; 195408#factEXIT >#70#return; 195407#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195406#factFINAL assume true; 195404#factEXIT >#70#return; 195403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195400#factFINAL assume true; 195397#factEXIT >#70#return; 195396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195393#factFINAL assume true; 195391#factEXIT >#70#return; 195390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195388#factFINAL assume true; 195387#factEXIT >#70#return; 195384#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195383#factFINAL assume true; 195381#factEXIT >#70#return; 195355#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195374#factFINAL assume true; 195333#factEXIT >#70#return; 195329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195330#factFINAL assume true; 195322#factEXIT >#78#return; 195323#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 193346#$Ultimate##0 ~n := #in~n; 195362#L25 assume ~n <= 0;#res := 1; 195332#factFINAL assume true; 195331#factEXIT >#80#return; 195324#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 195328#$Ultimate##0 ~n := #in~n; 195477#L25 assume !(~n <= 0); 195342#L26 call #t~ret0 := fact(~n - 1);< 195376#$Ultimate##0 ~n := #in~n; 195476#L25 assume !(~n <= 0); 195335#L26 call #t~ret0 := fact(~n - 1);< 195377#$Ultimate##0 ~n := #in~n; 195558#L25 assume !(~n <= 0); 195336#L26 call #t~ret0 := fact(~n - 1);< 195392#$Ultimate##0 ~n := #in~n; 196619#L25 assume !(~n <= 0); 195339#L26 call #t~ret0 := fact(~n - 1);< 195399#$Ultimate##0 ~n := #in~n; 196243#L25 assume !(~n <= 0); 195340#L26 call #t~ret0 := fact(~n - 1);< 195405#$Ultimate##0 ~n := #in~n; 196551#L25 assume !(~n <= 0); 195345#L26 call #t~ret0 := fact(~n - 1);< 195409#$Ultimate##0 ~n := #in~n; 195488#L25 assume !(~n <= 0); 195347#L26 call #t~ret0 := fact(~n - 1);< 195483#$Ultimate##0 ~n := #in~n; 195481#L25 assume !(~n <= 0); 195351#L26 call #t~ret0 := fact(~n - 1);< 195417#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195458#L25 assume !(~n <= 0); 195344#L26 call #t~ret0 := fact(~n - 1);< 195440#$Ultimate##0 ~n := #in~n; 195457#L25 assume ~n <= 0;#res := 1; 195456#factFINAL assume true; 195439#factEXIT >#70#return; 195428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195424#factFINAL assume true; 195422#factEXIT >#70#return; 195421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195418#factFINAL assume true; 195414#factEXIT >#70#return; 195413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195410#factFINAL assume true; 195408#factEXIT >#70#return; 195407#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195406#factFINAL assume true; 195404#factEXIT >#70#return; 195403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195400#factFINAL assume true; 195397#factEXIT >#70#return; 195396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195393#factFINAL assume true; 195391#factEXIT >#70#return; 195390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195388#factFINAL assume true; 195387#factEXIT >#70#return; 195384#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195383#factFINAL assume true; 195381#factEXIT >#70#return; 195355#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195374#factFINAL assume true; 195333#factEXIT >#70#return; 195329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195330#factFINAL assume true; 195322#factEXIT >#82#return; 193351#L30-8 [2023-11-06 22:39:04,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash 784125476, now seen corresponding path program 19 times [2023-11-06 22:39:04,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:04,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910722128] [2023-11-06 22:39:04,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:04,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:04,388 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:39:04,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689423109] [2023-11-06 22:39:04,388 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:39:04,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:04,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:04,390 INFO L229 MonitoredProcess]: Starting monitored process 249 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:04,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (249)] Waiting until timeout for monitored process [2023-11-06 22:39:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:39:04,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:39:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:39:05,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:39:05,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash 613125884, now seen corresponding path program 18 times [2023-11-06 22:39:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:05,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141105187] [2023-11-06 22:39:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:05,069 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:39:05,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1787288249] [2023-11-06 22:39:05,069 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:39:05,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:05,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:05,071 INFO L229 MonitoredProcess]: Starting monitored process 250 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:05,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (250)] Waiting until timeout for monitored process [2023-11-06 22:39:05,578 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2023-11-06 22:39:05,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:39:05,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:39:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:39:05,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:39:05,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash 451940511, now seen corresponding path program 20 times [2023-11-06 22:39:05,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:05,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15149663] [2023-11-06 22:39:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:05,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:05,697 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:39:05,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405146884] [2023-11-06 22:39:05,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:39:05,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:05,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:05,699 INFO L229 MonitoredProcess]: Starting monitored process 251 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:05,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (251)] Waiting until timeout for monitored process [2023-11-06 22:39:06,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:39:06,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:39:06,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 22:39:06,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8254 backedges. 3815 proven. 133 refuted. 0 times theorem prover too weak. 4306 trivial. 0 not checked. [2023-11-06 22:39:06,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8254 backedges. 1007 proven. 494 refuted. 0 times theorem prover too weak. 6753 trivial. 0 not checked. [2023-11-06 22:39:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:08,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15149663] [2023-11-06 22:39:08,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:39:08,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405146884] [2023-11-06 22:39:08,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405146884] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:08,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:39:08,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 22 [2023-11-06 22:39:08,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396068339] [2023-11-06 22:39:08,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:09,479 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:39:09,480 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:39:09,480 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:39:09,480 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:39:09,480 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:39:09,480 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,480 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:39:09,480 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:39:09,480 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration37_Loop [2023-11-06 22:39:09,480 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:39:09,481 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:39:09,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,623 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:39:09,624 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:39:09,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,628 INFO L229 MonitoredProcess]: Starting monitored process 252 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2023-11-06 22:39:09,662 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,662 INFO L440 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: [] [2023-11-06 22:39:09,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Ended with exit code 0 [2023-11-06 22:39:09,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,666 INFO L229 MonitoredProcess]: Starting monitored process 253 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2023-11-06 22:39:09,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,681 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,681 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:39:09,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:09,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,685 INFO L229 MonitoredProcess]: Starting monitored process 254 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2023-11-06 22:39:09,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,700 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,700 INFO L440 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: [] [2023-11-06 22:39:09,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Ended with exit code 0 [2023-11-06 22:39:09,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,705 INFO L229 MonitoredProcess]: Starting monitored process 255 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2023-11-06 22:39:09,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,708 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,720 INFO L440 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: [] [2023-11-06 22:39:09,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Ended with exit code 0 [2023-11-06 22:39:09,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,732 INFO L229 MonitoredProcess]: Starting monitored process 256 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Waiting until timeout for monitored process [2023-11-06 22:39:09,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,742 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,755 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,755 INFO L440 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: [] [2023-11-06 22:39:09,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Ended with exit code 0 [2023-11-06 22:39:09,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,759 INFO L229 MonitoredProcess]: Starting monitored process 257 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Waiting until timeout for monitored process [2023-11-06 22:39:09,781 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,781 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=3628800} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=3628800} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:39:09,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Ended with exit code 0 [2023-11-06 22:39:09,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,785 INFO L229 MonitoredProcess]: Starting monitored process 258 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Waiting until timeout for monitored process [2023-11-06 22:39:09,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,799 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,799 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:39:09,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Ended with exit code 0 [2023-11-06 22:39:09,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,803 INFO L229 MonitoredProcess]: Starting monitored process 259 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2023-11-06 22:39:09,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,817 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,817 INFO L440 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: [] [2023-11-06 22:39:09,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Ended with exit code 0 [2023-11-06 22:39:09,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,821 INFO L229 MonitoredProcess]: Starting monitored process 260 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2023-11-06 22:39:09,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,824 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,836 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,836 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=3628800} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=3628800} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:39:09,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Ended with exit code 0 [2023-11-06 22:39:09,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,840 INFO L229 MonitoredProcess]: Starting monitored process 261 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2023-11-06 22:39:09,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,854 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,854 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=10} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:39:09,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Ended with exit code 0 [2023-11-06 22:39:09,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,858 INFO L229 MonitoredProcess]: Starting monitored process 262 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2023-11-06 22:39:09,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,878 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,878 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=10} Honda state: {ULTIMATE.start_main_~x~0#1=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:39:09,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Ended with exit code 0 [2023-11-06 22:39:09,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,885 INFO L229 MonitoredProcess]: Starting monitored process 263 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2023-11-06 22:39:09,913 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:09,913 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=10} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:39:09,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Ended with exit code 0 [2023-11-06 22:39:09,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,917 INFO L229 MonitoredProcess]: Starting monitored process 264 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Waiting until timeout for monitored process [2023-11-06 22:39:09,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:09,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Ended with exit code 0 [2023-11-06 22:39:09,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:09,940 INFO L229 MonitoredProcess]: Starting monitored process 265 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:09,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:39:09,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:09,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2023-11-06 22:39:09,958 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:39:09,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Ended with exit code 0 [2023-11-06 22:39:09,960 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:39:09,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:39:09,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:39:09,960 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:39:09,961 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:39:09,961 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:09,961 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:39:09,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:39:09,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration37_Loop [2023-11-06 22:39:09,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:39:09,961 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:39:09,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:09,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:10,083 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:39:10,084 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:39:10,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,085 INFO L229 MonitoredProcess]: Starting monitored process 266 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2023-11-06 22:39:10,088 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 [2023-11-06 22:39:10,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:10,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,104 INFO L229 MonitoredProcess]: Starting monitored process 267 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Waiting until timeout for monitored process [2023-11-06 22:39:10,106 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 [2023-11-06 22:39:10,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Ended with exit code 0 [2023-11-06 22:39:10,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,123 INFO L229 MonitoredProcess]: Starting monitored process 268 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Waiting until timeout for monitored process [2023-11-06 22:39:10,126 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 [2023-11-06 22:39:10,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Ended with exit code 0 [2023-11-06 22:39:10,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,142 INFO L229 MonitoredProcess]: Starting monitored process 269 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Waiting until timeout for monitored process [2023-11-06 22:39:10,144 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 [2023-11-06 22:39:10,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Ended with exit code 0 [2023-11-06 22:39:10,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,161 INFO L229 MonitoredProcess]: Starting monitored process 270 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Waiting until timeout for monitored process [2023-11-06 22:39:10,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:39:10,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:10,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,189 INFO L229 MonitoredProcess]: Starting monitored process 271 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Waiting until timeout for monitored process [2023-11-06 22:39:10,192 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 [2023-11-06 22:39:10,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Ended with exit code 0 [2023-11-06 22:39:10,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,210 INFO L229 MonitoredProcess]: Starting monitored process 272 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Waiting until timeout for monitored process [2023-11-06 22:39:10,212 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 [2023-11-06 22:39:10,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Ended with exit code 0 [2023-11-06 22:39:10,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,229 INFO L229 MonitoredProcess]: Starting monitored process 273 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Waiting until timeout for monitored process [2023-11-06 22:39:10,231 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 [2023-11-06 22:39:10,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Ended with exit code 0 [2023-11-06 22:39:10,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,248 INFO L229 MonitoredProcess]: Starting monitored process 274 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Waiting until timeout for monitored process [2023-11-06 22:39:10,250 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 [2023-11-06 22:39:10,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:10,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,266 INFO L229 MonitoredProcess]: Starting monitored process 275 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Waiting until timeout for monitored process [2023-11-06 22:39:10,269 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 [2023-11-06 22:39:10,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Ended with exit code 0 [2023-11-06 22:39:10,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,289 INFO L229 MonitoredProcess]: Starting monitored process 276 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Waiting until timeout for monitored process [2023-11-06 22:39:10,291 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 [2023-11-06 22:39:10,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Ended with exit code 0 [2023-11-06 22:39:10,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,308 INFO L229 MonitoredProcess]: Starting monitored process 277 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Waiting until timeout for monitored process [2023-11-06 22:39:10,310 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 [2023-11-06 22:39:10,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:10,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Ended with exit code 0 [2023-11-06 22:39:10,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,327 INFO L229 MonitoredProcess]: Starting monitored process 278 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Waiting until timeout for monitored process [2023-11-06 22:39:10,329 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 [2023-11-06 22:39:10,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:10,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:10,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:10,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:10,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:10,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:10,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:10,343 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:39:10,345 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:39:10,345 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:39:10,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:10,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:10,347 INFO L229 MonitoredProcess]: Starting monitored process 279 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:10,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Waiting until timeout for monitored process [2023-11-06 22:39:10,349 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:39:10,349 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:39:10,349 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:39:10,349 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 19 Supporting invariants [] [2023-11-06 22:39:10,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:10,352 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:39:10,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:10,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 1481 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-06 22:39:10,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:12,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-06 22:39:12,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2023-11-06 22:39:12,911 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 17 loop predicates [2023-11-06 22:39:12,911 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4754 states and 9603 transitions. cyclomatic complexity: 4895 Second operand has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (12), 2 states have call predecessors, (12), 13 states have return successors, (22), 15 states have call predecessors, (22), 6 states have call successors, (22) [2023-11-06 22:39:13,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:13,826 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4754 states and 9603 transitions. cyclomatic complexity: 4895. Second operand has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (12), 2 states have call predecessors, (12), 13 states have return successors, (22), 15 states have call predecessors, (22), 6 states have call successors, (22) Result 10847 states and 19964 transitions. Complement of second has 107 states. [2023-11-06 22:39:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 2 stem states 16 non-accepting loop states 1 accepting loop states [2023-11-06 22:39:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (12), 2 states have call predecessors, (12), 13 states have return successors, (22), 15 states have call predecessors, (22), 6 states have call successors, (22) [2023-11-06 22:39:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 109 transitions. [2023-11-06 22:39:13,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 109 transitions. Stem has 222 letters. Loop has 140 letters. [2023-11-06 22:39:13,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:39:13,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 109 transitions. Stem has 362 letters. Loop has 140 letters. [2023-11-06 22:39:13,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:39:13,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 109 transitions. Stem has 222 letters. Loop has 280 letters. [2023-11-06 22:39:13,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:39:13,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10847 states and 19964 transitions. [2023-11-06 22:39:13,949 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 393 [2023-11-06 22:39:14,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10847 states to 6749 states and 13129 transitions. [2023-11-06 22:39:14,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1335 [2023-11-06 22:39:14,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1342 [2023-11-06 22:39:14,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6749 states and 13129 transitions. [2023-11-06 22:39:14,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:39:14,022 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6749 states and 13129 transitions. [2023-11-06 22:39:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6749 states and 13129 transitions. [2023-11-06 22:39:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6749 to 5176. [2023-11-06 22:39:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5176 states, 3172 states have (on average 1.0450819672131149) internal successors, (3315), 3166 states have internal predecessors, (3315), 1332 states have call successors, (1451), 653 states have call predecessors, (1451), 672 states have return successors, (5825), 1356 states have call predecessors, (5825), 1332 states have call successors, (5825) [2023-11-06 22:39:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5176 states to 5176 states and 10591 transitions. [2023-11-06 22:39:14,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5176 states and 10591 transitions. [2023-11-06 22:39:14,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:14,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 22:39:14,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:39:14,211 INFO L87 Difference]: Start difference. First operand 5176 states and 10591 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 15 states have call successors, (29), 2 states have call predecessors, (29), 8 states have return successors, (33), 13 states have call predecessors, (33), 15 states have call successors, (33) [2023-11-06 22:39:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:15,126 INFO L93 Difference]: Finished difference Result 6571 states and 14949 transitions. [2023-11-06 22:39:15,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6571 states and 14949 transitions. [2023-11-06 22:39:15,229 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 629 [2023-11-06 22:39:15,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6571 states to 6492 states and 14652 transitions. [2023-11-06 22:39:15,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1765 [2023-11-06 22:39:15,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1765 [2023-11-06 22:39:15,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6492 states and 14652 transitions. [2023-11-06 22:39:15,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:39:15,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6492 states and 14652 transitions. [2023-11-06 22:39:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states and 14652 transitions. [2023-11-06 22:39:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 5658. [2023-11-06 22:39:15,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5658 states, 3403 states have (on average 1.0476050543637967) internal successors, (3565), 3397 states have internal predecessors, (3565), 1575 states have call successors, (1724), 653 states have call predecessors, (1724), 680 states have return successors, (6708), 1607 states have call predecessors, (6708), 1575 states have call successors, (6708) [2023-11-06 22:39:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5658 states to 5658 states and 11997 transitions. [2023-11-06 22:39:15,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5658 states and 11997 transitions. [2023-11-06 22:39:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:39:15,777 INFO L428 stractBuchiCegarLoop]: Abstraction has 5658 states and 11997 transitions. [2023-11-06 22:39:15,777 INFO L335 stractBuchiCegarLoop]: ======== Iteration 38 ============ [2023-11-06 22:39:15,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5658 states and 11997 transitions. [2023-11-06 22:39:15,809 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 485 [2023-11-06 22:39:15,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:39:15,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:39:15,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 48, 30, 30, 30, 30, 18, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:15,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [25, 25, 22, 22, 22, 22, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:15,812 INFO L748 eck$LassoCheckResult]: Stem: 224251#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 224189#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 224190#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; 224213#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; 224252#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 224476#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 227412#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; 227407#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 227408#$Ultimate##0 ~n := #in~n; 227418#L25 assume ~n <= 0;#res := 1; 227411#factFINAL assume true; 227406#factEXIT >#72#return; 224235#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 224236#$Ultimate##0 ~n := #in~n; 227895#L25 assume ~n <= 0;#res := 1; 227892#factFINAL assume true; 227890#factEXIT >#74#return; 227879#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 227880#$Ultimate##0 ~n := #in~n; 227887#L25 assume ~n <= 0;#res := 1; 227882#factFINAL assume true; 227878#factEXIT >#76#return; 227877#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; 227849#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 227847#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 227845#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 227844#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; 227837#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 227843#$Ultimate##0 ~n := #in~n; 227905#L25 assume !(~n <= 0); 227901#L26 call #t~ret0 := fact(~n - 1);< 227902#$Ultimate##0 ~n := #in~n; 227909#L25 assume ~n <= 0;#res := 1; 227904#factFINAL assume true; 227900#factEXIT >#70#return; 227898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227836#factFINAL assume true; 227838#factEXIT >#78#return; 224244#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 224245#$Ultimate##0 ~n := #in~n; 228317#L25 assume ~n <= 0;#res := 1; 228316#factFINAL assume true; 228315#factEXIT >#80#return; 224196#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 228313#$Ultimate##0 ~n := #in~n; 228268#L25 assume !(~n <= 0); 224195#L26 call #t~ret0 := fact(~n - 1);< 224197#$Ultimate##0 ~n := #in~n; 228597#L25 assume ~n <= 0;#res := 1; 228596#factFINAL assume true; 228594#factEXIT >#70#return; 228590#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228589#factFINAL assume true; 228588#factEXIT >#82#return; 228586#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; 228583#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 228581#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 228580#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 228579#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; 228424#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 228435#$Ultimate##0 ~n := #in~n; 228487#L25 assume !(~n <= 0); 228476#L26 call #t~ret0 := fact(~n - 1);< 228483#$Ultimate##0 ~n := #in~n; 228510#L25 assume !(~n <= 0); 228478#L26 call #t~ret0 := fact(~n - 1);< 228508#$Ultimate##0 ~n := #in~n; 228777#L25 assume ~n <= 0;#res := 1; 228776#factFINAL assume true; 228507#factEXIT >#70#return; 228505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228501#factFINAL assume true; 228475#factEXIT >#70#return; 228474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228469#factFINAL assume true; 228419#factEXIT >#78#return; 228432#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 228411#$Ultimate##0 ~n := #in~n; 228931#L25 assume ~n <= 0;#res := 1; 228930#factFINAL assume true; 228925#factEXIT >#80#return; 228915#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 228924#$Ultimate##0 ~n := #in~n; 228919#L25 assume !(~n <= 0); 228849#L26 call #t~ret0 := fact(~n - 1);< 228856#$Ultimate##0 ~n := #in~n; 228936#L25 assume !(~n <= 0); 228847#L26 call #t~ret0 := fact(~n - 1);< 228935#$Ultimate##0 ~n := #in~n; 228939#L25 assume ~n <= 0;#res := 1; 228937#factFINAL assume true; 228934#factEXIT >#70#return; 228933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228913#factFINAL assume true; 228906#factEXIT >#70#return; 228907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228932#factFINAL assume true; 228920#factEXIT >#82#return; 228922#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; 229273#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 229269#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 229265#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 229261#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; 228814#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 228827#$Ultimate##0 ~n := #in~n; 228857#L25 assume !(~n <= 0); 228846#L26 call #t~ret0 := fact(~n - 1);< 228856#$Ultimate##0 ~n := #in~n; 228936#L25 assume !(~n <= 0); 228847#L26 call #t~ret0 := fact(~n - 1);< 228935#$Ultimate##0 ~n := #in~n; 228936#L25 assume !(~n <= 0); 228847#L26 call #t~ret0 := fact(~n - 1);< 228935#$Ultimate##0 ~n := #in~n; 228939#L25 assume ~n <= 0;#res := 1; 228937#factFINAL assume true; 228934#factEXIT >#70#return; 228933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228913#factFINAL assume true; 228906#factEXIT >#70#return; 228885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228859#factFINAL assume true; 228844#factEXIT >#70#return; 228843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228832#factFINAL assume true; 228813#factEXIT >#78#return; 228823#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 228811#$Ultimate##0 ~n := #in~n; 229260#L25 assume ~n <= 0;#res := 1; 229258#factFINAL assume true; 229255#factEXIT >#80#return; 229207#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 229251#$Ultimate##0 ~n := #in~n; 229247#L25 assume !(~n <= 0); 229046#L26 call #t~ret0 := fact(~n - 1);< 229066#$Ultimate##0 ~n := #in~n; 229381#L25 assume !(~n <= 0); 229040#L26 call #t~ret0 := fact(~n - 1);< 229054#$Ultimate##0 ~n := #in~n; 229203#L25 assume !(~n <= 0); 229047#L26 call #t~ret0 := fact(~n - 1);< 229199#$Ultimate##0 ~n := #in~n; 229202#L25 assume ~n <= 0;#res := 1; 229201#factFINAL assume true; 229198#factEXIT >#70#return; 229196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 229192#factFINAL assume true; 229190#factEXIT >#70#return; 229189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 229188#factFINAL assume true; 229063#factEXIT >#70#return; 229064#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 229290#factFINAL assume true; 229206#factEXIT >#82#return; 229210#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; 229276#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 229272#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 229268#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 229264#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; 229034#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 224156#$Ultimate##0 ~n := #in~n; 229060#L25 assume !(~n <= 0); 229044#L26 call #t~ret0 := fact(~n - 1);< 229054#$Ultimate##0 ~n := #in~n; 229203#L25 assume !(~n <= 0); 229047#L26 call #t~ret0 := fact(~n - 1);< 229199#$Ultimate##0 ~n := #in~n; 229203#L25 assume !(~n <= 0); 229047#L26 call #t~ret0 := fact(~n - 1);< 229199#$Ultimate##0 ~n := #in~n; 229203#L25 assume !(~n <= 0); 229047#L26 call #t~ret0 := fact(~n - 1);< 229199#$Ultimate##0 ~n := #in~n; 229202#L25 assume ~n <= 0;#res := 1; 229201#factFINAL assume true; 229198#factEXIT >#70#return; 229196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 229192#factFINAL assume true; 229190#factEXIT >#70#return; 229189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 229188#factFINAL assume true; 229063#factEXIT >#70#return; 229062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 229055#factFINAL assume true; 229039#factEXIT >#70#return; 229038#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 229037#factFINAL assume true; 229030#factEXIT >#78#return; 224165#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 229028#$Ultimate##0 ~n := #in~n; 229663#L25 assume ~n <= 0;#res := 1; 229662#factFINAL assume true; 224162#factEXIT >#80#return; 224170#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 228075#$Ultimate##0 ~n := #in~n; 224233#L25 assume !(~n <= 0); 224234#L26 call #t~ret0 := fact(~n - 1);< 228172#$Ultimate##0 ~n := #in~n; 228262#L25 assume !(~n <= 0); 228055#L26 call #t~ret0 := fact(~n - 1);< 228068#$Ultimate##0 ~n := #in~n; 228199#L25 assume !(~n <= 0); 228063#L26 call #t~ret0 := fact(~n - 1);< 228291#$Ultimate##0 ~n := #in~n; 228199#L25 assume !(~n <= 0); 228063#L26 call #t~ret0 := fact(~n - 1);< 228291#$Ultimate##0 ~n := #in~n; 228319#L25 assume ~n <= 0;#res := 1; 228318#factFINAL assume true; 228290#factEXIT >#70#return; 228288#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228284#factFINAL assume true; 228190#factEXIT >#70#return; 228187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228182#factFINAL assume true; 228175#factEXIT >#70#return; 228174#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228171#factFINAL assume true; 228117#factEXIT >#70#return; 228066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 229676#factFINAL assume true; 229576#factEXIT >#82#return; 228072#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; 228069#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 228051#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 228049#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 228047#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; 228008#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 228011#$Ultimate##0 ~n := #in~n; 228070#L25 assume !(~n <= 0); 228056#L26 call #t~ret0 := fact(~n - 1);< 228068#$Ultimate##0 ~n := #in~n; 228199#L25 assume !(~n <= 0); 228063#L26 call #t~ret0 := fact(~n - 1);< 228291#$Ultimate##0 ~n := #in~n; 228199#L25 assume !(~n <= 0); 228063#L26 call #t~ret0 := fact(~n - 1);< 228291#$Ultimate##0 ~n := #in~n; 228199#L25 assume !(~n <= 0); 228063#L26 call #t~ret0 := fact(~n - 1);< 228291#$Ultimate##0 ~n := #in~n; 228199#L25 assume !(~n <= 0); 228063#L26 call #t~ret0 := fact(~n - 1);< 228291#$Ultimate##0 ~n := #in~n; 228319#L25 assume ~n <= 0;#res := 1; 228318#factFINAL assume true; 228290#factEXIT >#70#return; 228288#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228284#factFINAL assume true; 228190#factEXIT >#70#return; 228187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228182#factFINAL assume true; 228175#factEXIT >#70#return; 228174#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228171#factFINAL assume true; 228117#factEXIT >#70#return; 228115#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228104#factFINAL assume true; 228102#factEXIT >#70#return; 228100#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228098#factFINAL assume true; 228045#factEXIT >#78#return; 227943#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 227947#$Ultimate##0 ~n := #in~n; 228002#L25 assume ~n <= 0;#res := 1; 227952#factFINAL assume true; 227942#factEXIT >#80#return; 227923#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 228101#$Ultimate##0 ~n := #in~n; 228099#L25 assume !(~n <= 0); 227867#L26 call #t~ret0 := fact(~n - 1);< 227924#$Ultimate##0 ~n := #in~n; 229528#L25 assume !(~n <= 0); 227851#L26 call #t~ret0 := fact(~n - 1);< 227991#$Ultimate##0 ~n := #in~n; 228298#L25 assume !(~n <= 0); 227863#L26 call #t~ret0 := fact(~n - 1);< 228295#$Ultimate##0 ~n := #in~n; 228294#L25 assume !(~n <= 0); 227853#L26 call #t~ret0 := fact(~n - 1);< 228029#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228324#L25 assume ~n <= 0;#res := 1; 228323#factFINAL assume true; 228282#factEXIT >#70#return; 228280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228277#factFINAL assume true; 228275#factEXIT >#70#return; 228274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228271#factFINAL assume true; 228026#factEXIT >#70#return; 228012#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227993#factFINAL assume true; 227990#factEXIT >#70#return; 227987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227986#factFINAL assume true; 227938#factEXIT >#70#return; 227919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228391#factFINAL assume true; 228259#factEXIT >#82#return; 227830#L30-8 [2023-11-06 22:39:15,812 INFO L750 eck$LassoCheckResult]: Loop: 227830#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; 228230#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 227840#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 227832#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 227831#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; 224153#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 224154#$Ultimate##0 ~n := #in~n; 227881#L25 assume !(~n <= 0); 227857#L26 call #t~ret0 := fact(~n - 1);< 227876#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228324#L25 assume ~n <= 0;#res := 1; 228323#factFINAL assume true; 228282#factEXIT >#70#return; 228280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228277#factFINAL assume true; 228275#factEXIT >#70#return; 228274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228271#factFINAL assume true; 228026#factEXIT >#70#return; 228012#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227993#factFINAL assume true; 227990#factEXIT >#70#return; 227987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227986#factFINAL assume true; 227938#factEXIT >#70#return; 227931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227922#factFINAL assume true; 227918#factEXIT >#70#return; 227916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227913#factFINAL assume true; 227911#factEXIT >#70#return; 227910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227906#factFINAL assume true; 227903#factEXIT >#70#return; 227899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227897#factFINAL assume true; 227896#factEXIT >#70#return; 227893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227891#factFINAL assume true; 227888#factEXIT >#70#return; 227871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227883#factFINAL assume true; 227850#factEXIT >#70#return; 227848#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227846#factFINAL assume true; 227827#factEXIT >#78#return; 227828#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 224154#$Ultimate##0 ~n := #in~n; 227881#L25 assume ~n <= 0;#res := 1; 227842#factFINAL assume true; 227841#factEXIT >#80#return; 227829#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 227839#$Ultimate##0 ~n := #in~n; 227894#L25 assume !(~n <= 0); 227855#L26 call #t~ret0 := fact(~n - 1);< 227886#$Ultimate##0 ~n := #in~n; 228113#L25 assume !(~n <= 0); 227856#L26 call #t~ret0 := fact(~n - 1);< 227884#$Ultimate##0 ~n := #in~n; 229789#L25 assume !(~n <= 0); 227862#L26 call #t~ret0 := fact(~n - 1);< 227912#$Ultimate##0 ~n := #in~n; 228076#L25 assume !(~n <= 0); 227866#L26 call #t~ret0 := fact(~n - 1);< 227920#$Ultimate##0 ~n := #in~n; 228121#L25 assume !(~n <= 0); 227870#L26 call #t~ret0 := fact(~n - 1);< 227939#$Ultimate##0 ~n := #in~n; 229528#L25 assume !(~n <= 0); 227851#L26 call #t~ret0 := fact(~n - 1);< 227991#$Ultimate##0 ~n := #in~n; 228298#L25 assume !(~n <= 0); 227863#L26 call #t~ret0 := fact(~n - 1);< 228295#$Ultimate##0 ~n := #in~n; 228294#L25 assume !(~n <= 0); 227853#L26 call #t~ret0 := fact(~n - 1);< 228029#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228325#L25 assume !(~n <= 0); 227868#L26 call #t~ret0 := fact(~n - 1);< 228283#$Ultimate##0 ~n := #in~n; 228324#L25 assume ~n <= 0;#res := 1; 228323#factFINAL assume true; 228282#factEXIT >#70#return; 228280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228277#factFINAL assume true; 228275#factEXIT >#70#return; 228274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 228271#factFINAL assume true; 228026#factEXIT >#70#return; 228012#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227993#factFINAL assume true; 227990#factEXIT >#70#return; 227987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227986#factFINAL assume true; 227938#factEXIT >#70#return; 227931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227922#factFINAL assume true; 227918#factEXIT >#70#return; 227916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227913#factFINAL assume true; 227911#factEXIT >#70#return; 227910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227906#factFINAL assume true; 227903#factEXIT >#70#return; 227899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227897#factFINAL assume true; 227896#factEXIT >#70#return; 227893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227891#factFINAL assume true; 227888#factEXIT >#70#return; 227871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227883#factFINAL assume true; 227850#factEXIT >#70#return; 227848#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 227846#factFINAL assume true; 227827#factEXIT >#82#return; 227830#L30-8 [2023-11-06 22:39:15,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:15,813 INFO L85 PathProgramCache]: Analyzing trace with hash -676404449, now seen corresponding path program 21 times [2023-11-06 22:39:15,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:15,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945429421] [2023-11-06 22:39:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:15,830 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:39:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989177576] [2023-11-06 22:39:15,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:39:15,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:15,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:15,833 INFO L229 MonitoredProcess]: Starting monitored process 280 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:15,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (280)] Waiting until timeout for monitored process [2023-11-06 22:39:16,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2023-11-06 22:39:16,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:39:16,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:39:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:39:16,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:39:16,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1632358780, now seen corresponding path program 19 times [2023-11-06 22:39:16,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:16,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587167648] [2023-11-06 22:39:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:16,755 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:39:16,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392293744] [2023-11-06 22:39:16,755 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:39:16,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:16,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:16,757 INFO L229 MonitoredProcess]: Starting monitored process 281 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:16,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (281)] Waiting until timeout for monitored process [2023-11-06 22:39:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:39:17,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:39:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:39:17,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:39:17,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2042288794, now seen corresponding path program 22 times [2023-11-06 22:39:17,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:17,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469703190] [2023-11-06 22:39:17,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:17,329 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:39:17,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598177165] [2023-11-06 22:39:17,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:39:17,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:17,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:17,334 INFO L229 MonitoredProcess]: Starting monitored process 282 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:17,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (282)] Waiting until timeout for monitored process [2023-11-06 22:39:17,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:39:17,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:39:17,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 22:39:17,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 5621 proven. 181 refuted. 0 times theorem prover too weak. 7484 trivial. 0 not checked. [2023-11-06 22:39:18,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 1599 proven. 644 refuted. 0 times theorem prover too weak. 11043 trivial. 0 not checked. [2023-11-06 22:39:20,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:20,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469703190] [2023-11-06 22:39:20,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:39:20,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598177165] [2023-11-06 22:39:20,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598177165] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:20,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:39:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 25 [2023-11-06 22:39:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681860353] [2023-11-06 22:39:20,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:22,393 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:39:22,393 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:39:22,393 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:39:22,394 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:39:22,394 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:39:22,394 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,394 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:39:22,394 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:39:22,394 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration38_Loop [2023-11-06 22:39:22,394 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:39:22,394 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:39:22,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,530 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:39:22,530 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:39:22,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:22,532 INFO L229 MonitoredProcess]: Starting monitored process 283 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:22,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Waiting until timeout for monitored process [2023-11-06 22:39:22,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:22,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:22,550 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:22,550 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=39916800} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=39916800} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:39:22,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Ended with exit code 0 [2023-11-06 22:39:22,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:22,555 INFO L229 MonitoredProcess]: Starting monitored process 284 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:22,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Waiting until timeout for monitored process [2023-11-06 22:39:22,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:22,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:22,573 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:22,573 INFO L440 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: [] [2023-11-06 22:39:22,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Ended with exit code 0 [2023-11-06 22:39:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:22,578 INFO L229 MonitoredProcess]: Starting monitored process 285 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:22,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Waiting until timeout for monitored process [2023-11-06 22:39:22,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:22,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:22,595 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:22,595 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=39916800} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=39916800} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:39:22,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Ended with exit code 0 [2023-11-06 22:39:22,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:22,600 INFO L229 MonitoredProcess]: Starting monitored process 286 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:22,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Waiting until timeout for monitored process [2023-11-06 22:39:22,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:22,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:22,616 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:39:22,616 INFO L440 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: [] [2023-11-06 22:39:22,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:22,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:22,620 INFO L229 MonitoredProcess]: Starting monitored process 287 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:22,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Waiting until timeout for monitored process [2023-11-06 22:39:22,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:39:22,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:22,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Ended with exit code 0 [2023-11-06 22:39:22,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:22,641 INFO L229 MonitoredProcess]: Starting monitored process 288 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:22,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Waiting until timeout for monitored process [2023-11-06 22:39:22,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:39:22,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:39:22,660 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:39:22,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:22,663 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:39:22,663 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:39:22,663 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:39:22,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:39:22,664 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:39:22,664 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,664 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:39:22,664 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:39:22,664 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration38_Loop [2023-11-06 22:39:22,664 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:39:22,664 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:39:22,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:39:22,808 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:39:22,808 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:39:22,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:22,811 INFO L229 MonitoredProcess]: Starting monitored process 289 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:22,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Waiting until timeout for monitored process [2023-11-06 22:39:22,814 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 [2023-11-06 22:39:22,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:22,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:22,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:22,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:22,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:22,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:22,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:22,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:22,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Ended with exit code 0 [2023-11-06 22:39:22,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:22,833 INFO L229 MonitoredProcess]: Starting monitored process 290 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:22,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Waiting until timeout for monitored process [2023-11-06 22:39:22,836 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 [2023-11-06 22:39:22,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:22,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:22,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:22,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:22,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:22,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:22,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:22,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:39:22,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:22,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:22,854 INFO L229 MonitoredProcess]: Starting monitored process 291 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:22,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Waiting until timeout for monitored process [2023-11-06 22:39:22,857 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 [2023-11-06 22:39:22,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:39:22,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:39:22,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:39:22,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:39:22,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:39:22,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:39:22,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:39:22,873 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:39:22,876 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:39:22,876 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:39:22,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:39:22,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:22,878 INFO L229 MonitoredProcess]: Starting monitored process 292 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:22,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Waiting until timeout for monitored process [2023-11-06 22:39:22,880 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:39:22,880 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:39:22,880 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:39:22,880 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 21 Supporting invariants [] [2023-11-06 22:39:22,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Ended with exit code 0 [2023-11-06 22:39:22,883 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:39:22,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:23,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-06 22:39:23,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:24,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Ended with exit code 0 [2023-11-06 22:39:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-06 22:39:25,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1662 backedges. 0 proven. 897 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2023-11-06 22:39:26,576 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 18 loop predicates [2023-11-06 22:39:26,576 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5658 states and 11997 transitions. cyclomatic complexity: 6389 Second operand has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 6 states have call successors, (12), 2 states have call predecessors, (12), 14 states have return successors, (23), 16 states have call predecessors, (23), 6 states have call successors, (23) [2023-11-06 22:39:27,552 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5658 states and 11997 transitions. cyclomatic complexity: 6389. Second operand has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 6 states have call successors, (12), 2 states have call predecessors, (12), 14 states have return successors, (23), 16 states have call predecessors, (23), 6 states have call successors, (23) Result 13437 states and 25965 transitions. Complement of second has 115 states. [2023-11-06 22:39:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 2 stem states 17 non-accepting loop states 1 accepting loop states [2023-11-06 22:39:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 6 states have call successors, (12), 2 states have call predecessors, (12), 14 states have return successors, (23), 16 states have call predecessors, (23), 6 states have call successors, (23) [2023-11-06 22:39:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2023-11-06 22:39:27,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 115 transitions. Stem has 302 letters. Loop has 152 letters. [2023-11-06 22:39:27,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:39:27,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 115 transitions. Stem has 454 letters. Loop has 152 letters. [2023-11-06 22:39:27,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:39:27,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 115 transitions. Stem has 302 letters. Loop has 304 letters. [2023-11-06 22:39:27,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:39:27,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13437 states and 25965 transitions. [2023-11-06 22:39:27,736 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 485 [2023-11-06 22:39:27,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13437 states to 8213 states and 16718 transitions. [2023-11-06 22:39:27,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1568 [2023-11-06 22:39:27,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1576 [2023-11-06 22:39:27,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8213 states and 16718 transitions. [2023-11-06 22:39:27,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:39:27,860 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8213 states and 16718 transitions. [2023-11-06 22:39:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8213 states and 16718 transitions. [2023-11-06 22:39:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8213 to 6100. [2023-11-06 22:39:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6100 states, 3689 states have (on average 1.044998644619138) internal successors, (3855), 3685 states have internal predecessors, (3855), 1643 states have call successors, (1816), 715 states have call predecessors, (1816), 768 states have return successors, (7410), 1699 states have call predecessors, (7410), 1643 states have call successors, (7410) [2023-11-06 22:39:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6100 states to 6100 states and 13081 transitions. [2023-11-06 22:39:28,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6100 states and 13081 transitions. [2023-11-06 22:39:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:28,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:39:28,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:39:28,361 INFO L87 Difference]: Start difference. First operand 6100 states and 13081 transitions. Second operand has 25 states, 24 states have (on average 3.25) internal successors, (78), 25 states have internal predecessors, (78), 17 states have call successors, (33), 2 states have call predecessors, (33), 9 states have return successors, (38), 15 states have call predecessors, (38), 17 states have call successors, (38) [2023-11-06 22:39:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:29,600 INFO L93 Difference]: Finished difference Result 7741 states and 18620 transitions. [2023-11-06 22:39:29,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7741 states and 18620 transitions. [2023-11-06 22:39:29,709 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 733 [2023-11-06 22:39:29,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7741 states to 7631 states and 18140 transitions. [2023-11-06 22:39:29,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2016 [2023-11-06 22:39:29,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2016 [2023-11-06 22:39:29,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7631 states and 18140 transitions. [2023-11-06 22:39:29,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:39:29,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7631 states and 18140 transitions. [2023-11-06 22:39:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7631 states and 18140 transitions. [2023-11-06 22:39:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7631 to 6601. [2023-11-06 22:39:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6601 states, 3904 states have (on average 1.0473872950819672) internal successors, (4089), 3900 states have internal predecessors, (4089), 1929 states have call successors, (2133), 715 states have call predecessors, (2133), 768 states have return successors, (8448), 1985 states have call predecessors, (8448), 1929 states have call successors, (8448) [2023-11-06 22:39:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 14670 transitions. [2023-11-06 22:39:30,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6601 states and 14670 transitions. [2023-11-06 22:39:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:39:30,484 INFO L428 stractBuchiCegarLoop]: Abstraction has 6601 states and 14670 transitions. [2023-11-06 22:39:30,484 INFO L335 stractBuchiCegarLoop]: ======== Iteration 39 ============ [2023-11-06 22:39:30,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6601 states and 14670 transitions. [2023-11-06 22:39:30,521 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 582 [2023-11-06 22:39:30,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:39:30,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:39:30,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [63, 63, 42, 42, 42, 42, 21, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:30,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 21, 21, 21, 21, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:30,525 INFO L748 eck$LassoCheckResult]: Stem: 261482#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 261426#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 261427#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; 261450#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; 261483#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 261724#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 263080#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; 261413#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 261414#$Ultimate##0 ~n := #in~n; 263624#L25 assume ~n <= 0;#res := 1; 263623#factFINAL assume true; 263611#factEXIT >#72#return; 261472#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 261473#$Ultimate##0 ~n := #in~n; 264096#L25 assume ~n <= 0;#res := 1; 264092#factFINAL assume true; 264087#factEXIT >#74#return; 261409#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 261410#$Ultimate##0 ~n := #in~n; 263974#L25 assume ~n <= 0;#res := 1; 263973#factFINAL assume true; 263972#factEXIT >#76#return; 263971#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; 263969#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 263970#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 264086#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 264085#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; 264080#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264084#$Ultimate##0 ~n := #in~n; 264100#L25 assume !(~n <= 0); 264098#L26 call #t~ret0 := fact(~n - 1);< 264099#$Ultimate##0 ~n := #in~n; 264131#L25 assume ~n <= 0;#res := 1; 264101#factFINAL assume true; 264097#factEXIT >#70#return; 264093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264089#factFINAL assume true; 264079#factEXIT >#78#return; 261478#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 261479#$Ultimate##0 ~n := #in~n; 264712#L25 assume ~n <= 0;#res := 1; 264706#factFINAL assume true; 264705#factEXIT >#80#return; 261433#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 261484#$Ultimate##0 ~n := #in~n; 264661#L25 assume !(~n <= 0); 261432#L26 call #t~ret0 := fact(~n - 1);< 261434#$Ultimate##0 ~n := #in~n; 264614#L25 assume ~n <= 0;#res := 1; 264613#factFINAL assume true; 264610#factEXIT >#70#return; 264608#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264607#factFINAL assume true; 264606#factEXIT >#82#return; 264605#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; 264603#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 264602#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 264601#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 264600#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; 264390#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264405#$Ultimate##0 ~n := #in~n; 264425#L25 assume !(~n <= 0); 264417#L26 call #t~ret0 := fact(~n - 1);< 264424#$Ultimate##0 ~n := #in~n; 264662#L25 assume !(~n <= 0); 264419#L26 call #t~ret0 := fact(~n - 1);< 264578#$Ultimate##0 ~n := #in~n; 264623#L25 assume ~n <= 0;#res := 1; 264622#factFINAL assume true; 264577#factEXIT >#70#return; 264576#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264454#factFINAL assume true; 264416#factEXIT >#70#return; 264414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264409#factFINAL assume true; 264385#factEXIT >#78#return; 264401#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 264382#$Ultimate##0 ~n := #in~n; 265237#L25 assume ~n <= 0;#res := 1; 265235#factFINAL assume true; 265230#factEXIT >#80#return; 265212#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 265229#$Ultimate##0 ~n := #in~n; 265244#L25 assume !(~n <= 0); 265136#L26 call #t~ret0 := fact(~n - 1);< 265141#$Ultimate##0 ~n := #in~n; 265273#L25 assume !(~n <= 0); 265131#L26 call #t~ret0 := fact(~n - 1);< 265271#$Ultimate##0 ~n := #in~n; 265356#L25 assume ~n <= 0;#res := 1; 265355#factFINAL assume true; 265270#factEXIT >#70#return; 265258#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265256#factFINAL assume true; 265242#factEXIT >#70#return; 265240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265236#factFINAL assume true; 265224#factEXIT >#82#return; 265228#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; 265388#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 265387#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 265386#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 265385#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; 265109#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 265114#$Ultimate##0 ~n := #in~n; 265143#L25 assume !(~n <= 0); 265132#L26 call #t~ret0 := fact(~n - 1);< 265141#$Ultimate##0 ~n := #in~n; 265273#L25 assume !(~n <= 0); 265131#L26 call #t~ret0 := fact(~n - 1);< 265271#$Ultimate##0 ~n := #in~n; 265273#L25 assume !(~n <= 0); 265131#L26 call #t~ret0 := fact(~n - 1);< 265271#$Ultimate##0 ~n := #in~n; 265356#L25 assume ~n <= 0;#res := 1; 265355#factFINAL assume true; 265270#factEXIT >#70#return; 265258#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265256#factFINAL assume true; 265242#factEXIT >#70#return; 265153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265148#factFINAL assume true; 265129#factEXIT >#70#return; 265128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265115#factFINAL assume true; 265102#factEXIT >#78#return; 265090#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 265100#$Ultimate##0 ~n := #in~n; 265167#L25 assume ~n <= 0;#res := 1; 265159#factFINAL assume true; 265089#factEXIT >#80#return; 265049#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 265053#$Ultimate##0 ~n := #in~n; 265047#L25 assume !(~n <= 0); 264741#L26 call #t~ret0 := fact(~n - 1);< 264929#$Ultimate##0 ~n := #in~n; 264951#L25 assume !(~n <= 0); 264742#L26 call #t~ret0 := fact(~n - 1);< 264747#$Ultimate##0 ~n := #in~n; 264949#L25 assume !(~n <= 0); 264736#L26 call #t~ret0 := fact(~n - 1);< 264948#$Ultimate##0 ~n := #in~n; 264952#L25 assume ~n <= 0;#res := 1; 264950#factFINAL assume true; 264947#factEXIT >#70#return; 264945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264939#factFINAL assume true; 264935#factEXIT >#70#return; 264931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264925#factFINAL assume true; 264921#factEXIT >#70#return; 264923#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265406#factFINAL assume true; 265077#factEXIT >#82#return; 265078#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; 265201#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 265199#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 265197#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 265195#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; 264639#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264644#$Ultimate##0 ~n := #in~n; 264757#L25 assume !(~n <= 0); 264740#L26 call #t~ret0 := fact(~n - 1);< 264747#$Ultimate##0 ~n := #in~n; 264949#L25 assume !(~n <= 0); 264736#L26 call #t~ret0 := fact(~n - 1);< 264948#$Ultimate##0 ~n := #in~n; 264949#L25 assume !(~n <= 0); 264736#L26 call #t~ret0 := fact(~n - 1);< 264948#$Ultimate##0 ~n := #in~n; 264949#L25 assume !(~n <= 0); 264736#L26 call #t~ret0 := fact(~n - 1);< 264948#$Ultimate##0 ~n := #in~n; 264952#L25 assume ~n <= 0;#res := 1; 264950#factFINAL assume true; 264947#factEXIT >#70#return; 264945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264939#factFINAL assume true; 264935#factEXIT >#70#return; 264931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264925#factFINAL assume true; 264921#factEXIT >#70#return; 264915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264906#factFINAL assume true; 264732#factEXIT >#70#return; 264730#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264727#factFINAL assume true; 264634#factEXIT >#78#return; 264626#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 264632#$Ultimate##0 ~n := #in~n; 264714#L25 assume ~n <= 0;#res := 1; 264713#factFINAL assume true; 264625#factEXIT >#80#return; 264630#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 264621#$Ultimate##0 ~n := #in~n; 265484#L25 assume !(~n <= 0); 264526#L26 call #t~ret0 := fact(~n - 1);< 264569#$Ultimate##0 ~n := #in~n; 264913#L25 assume !(~n <= 0); 264516#L26 call #t~ret0 := fact(~n - 1);< 264536#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264889#L25 assume ~n <= 0;#res := 1; 264888#factFINAL assume true; 264696#factEXIT >#70#return; 264694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264609#factFINAL assume true; 264598#factEXIT >#70#return; 264597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264593#factFINAL assume true; 264588#factEXIT >#70#return; 264587#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264566#factFINAL assume true; 264560#factEXIT >#70#return; 264535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 266064#factFINAL assume true; 265441#factEXIT >#82#return; 264444#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; 264443#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 264442#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 264440#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 264438#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; 264362#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264366#$Ultimate##0 ~n := #in~n; 264537#L25 assume !(~n <= 0); 264523#L26 call #t~ret0 := fact(~n - 1);< 264536#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264889#L25 assume ~n <= 0;#res := 1; 264888#factFINAL assume true; 264696#factEXIT >#70#return; 264694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264609#factFINAL assume true; 264598#factEXIT >#70#return; 264597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264593#factFINAL assume true; 264588#factEXIT >#70#return; 264587#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264566#factFINAL assume true; 264560#factEXIT >#70#return; 264559#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264558#factFINAL assume true; 264556#factEXIT >#70#return; 264557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264369#factFINAL assume true; 264370#factEXIT >#78#return; 264575#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 264359#$Ultimate##0 ~n := #in~n; 264663#L25 assume ~n <= 0;#res := 1; 264579#factFINAL assume true; 264574#factEXIT >#80#return; 264552#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 264573#$Ultimate##0 ~n := #in~n; 265458#L25 assume !(~n <= 0); 264519#L26 call #t~ret0 := fact(~n - 1);< 264553#$Ultimate##0 ~n := #in~n; 264604#L25 assume !(~n <= 0); 264527#L26 call #t~ret0 := fact(~n - 1);< 264561#$Ultimate##0 ~n := #in~n; 265456#L25 assume !(~n <= 0); 264520#L26 call #t~ret0 := fact(~n - 1);< 264591#$Ultimate##0 ~n := #in~n; 265466#L25 assume !(~n <= 0); 264530#L26 call #t~ret0 := fact(~n - 1);< 264536#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264889#L25 assume ~n <= 0;#res := 1; 264888#factFINAL assume true; 264696#factEXIT >#70#return; 264694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264609#factFINAL assume true; 264598#factEXIT >#70#return; 264597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264593#factFINAL assume true; 264588#factEXIT >#70#return; 264587#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264566#factFINAL assume true; 264560#factEXIT >#70#return; 264559#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264558#factFINAL assume true; 264556#factEXIT >#70#return; 264555#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264550#factFINAL assume true; 264543#factEXIT >#70#return; 264542#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264539#factFINAL assume true; 264515#factEXIT >#70#return; 264534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265450#factFINAL assume true; 265449#factEXIT >#82#return; 264451#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; 264571#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 264570#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 264368#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 264367#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; 264363#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 264366#$Ultimate##0 ~n := #in~n; 264537#L25 assume !(~n <= 0); 264523#L26 call #t~ret0 := fact(~n - 1);< 264536#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264890#L25 assume !(~n <= 0); 264522#L26 call #t~ret0 := fact(~n - 1);< 264697#$Ultimate##0 ~n := #in~n; 264889#L25 assume ~n <= 0;#res := 1; 264888#factFINAL assume true; 264696#factEXIT >#70#return; 264694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264609#factFINAL assume true; 264598#factEXIT >#70#return; 264597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264593#factFINAL assume true; 264588#factEXIT >#70#return; 264587#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264566#factFINAL assume true; 264560#factEXIT >#70#return; 264559#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264558#factFINAL assume true; 264556#factEXIT >#70#return; 264557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264369#factFINAL assume true; 264370#factEXIT >#78#return; 264354#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 264355#$Ultimate##0 ~n := #in~n; 264436#L25 assume ~n <= 0;#res := 1; 264435#factFINAL assume true; 264352#factEXIT >#80#return; 264172#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 264351#$Ultimate##0 ~n := #in~n; 264349#L25 assume !(~n <= 0); 264106#L26 call #t~ret0 := fact(~n - 1);< 264173#$Ultimate##0 ~n := #in~n; 265485#L25 assume !(~n <= 0); 264116#L26 call #t~ret0 := fact(~n - 1);< 264197#$Ultimate##0 ~n := #in~n; 264309#L25 assume !(~n <= 0); 264109#L26 call #t~ret0 := fact(~n - 1);< 264283#$Ultimate##0 ~n := #in~n; 264278#L25 assume !(~n <= 0); 264118#L26 call #t~ret0 := fact(~n - 1);< 264231#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264314#L25 assume ~n <= 0;#res := 1; 264272#factFINAL assume true; 264270#factEXIT >#70#return; 264268#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264266#factFINAL assume true; 264251#factEXIT >#70#return; 264246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264241#factFINAL assume true; 264228#factEXIT >#70#return; 264227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264223#factFINAL assume true; 264196#factEXIT >#70#return; 264195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264194#factFINAL assume true; 264188#factEXIT >#70#return; 264162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 265482#factFINAL assume true; 265481#factEXIT >#82#return; 263977#L30-8 [2023-11-06 22:39:30,526 INFO L750 eck$LassoCheckResult]: Loop: 263977#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; 263968#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 263954#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 263953#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 263952#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; 261395#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 261396#$Ultimate##0 ~n := #in~n; 264130#L25 assume !(~n <= 0); 264119#L26 call #t~ret0 := fact(~n - 1);< 264128#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264314#L25 assume ~n <= 0;#res := 1; 264272#factFINAL assume true; 264270#factEXIT >#70#return; 264268#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264266#factFINAL assume true; 264251#factEXIT >#70#return; 264246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264241#factFINAL assume true; 264228#factEXIT >#70#return; 264227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264223#factFINAL assume true; 264196#factEXIT >#70#return; 264195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264194#factFINAL assume true; 264188#factEXIT >#70#return; 264182#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264171#factFINAL assume true; 264161#factEXIT >#70#return; 264158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264155#factFINAL assume true; 264153#factEXIT >#70#return; 264152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264149#factFINAL assume true; 264147#factEXIT >#70#return; 264146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264145#factFINAL assume true; 264144#factEXIT >#70#return; 264143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264142#factFINAL assume true; 264141#factEXIT >#70#return; 264139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264138#factFINAL assume true; 264136#factEXIT >#70#return; 264123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264132#factFINAL assume true; 264102#factEXIT >#70#return; 264094#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264090#factFINAL assume true; 264081#factEXIT >#78#return; 264082#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 261396#$Ultimate##0 ~n := #in~n; 264130#L25 assume ~n <= 0;#res := 1; 264129#factFINAL assume true; 264095#factEXIT >#80#return; 264083#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 264091#$Ultimate##0 ~n := #in~n; 264140#L25 assume !(~n <= 0); 264120#L26 call #t~ret0 := fact(~n - 1);< 264135#$Ultimate##0 ~n := #in~n; 264347#L25 assume !(~n <= 0); 264122#L26 call #t~ret0 := fact(~n - 1);< 264133#$Ultimate##0 ~n := #in~n; 264174#L25 assume !(~n <= 0); 264103#L26 call #t~ret0 := fact(~n - 1);< 264154#$Ultimate##0 ~n := #in~n; 264932#L25 assume !(~n <= 0); 264110#L26 call #t~ret0 := fact(~n - 1);< 264163#$Ultimate##0 ~n := #in~n; 264240#L25 assume !(~n <= 0); 264112#L26 call #t~ret0 := fact(~n - 1);< 264189#$Ultimate##0 ~n := #in~n; 265485#L25 assume !(~n <= 0); 264116#L26 call #t~ret0 := fact(~n - 1);< 264197#$Ultimate##0 ~n := #in~n; 264309#L25 assume !(~n <= 0); 264109#L26 call #t~ret0 := fact(~n - 1);< 264283#$Ultimate##0 ~n := #in~n; 264278#L25 assume !(~n <= 0); 264118#L26 call #t~ret0 := fact(~n - 1);< 264231#$Ultimate##0 ~n := #in~n; 264317#L25 assume !(~n <= 0); 264108#L26 call #t~ret0 := fact(~n - 1);< 264271#$Ultimate##0 ~n := #in~n; 264314#L25 assume ~n <= 0;#res := 1; 264272#factFINAL assume true; 264270#factEXIT >#70#return; 264268#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264266#factFINAL assume true; 264251#factEXIT >#70#return; 264246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264241#factFINAL assume true; 264228#factEXIT >#70#return; 264227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264223#factFINAL assume true; 264196#factEXIT >#70#return; 264195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264194#factFINAL assume true; 264188#factEXIT >#70#return; 264182#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264171#factFINAL assume true; 264161#factEXIT >#70#return; 264158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264155#factFINAL assume true; 264153#factEXIT >#70#return; 264152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264149#factFINAL assume true; 264147#factEXIT >#70#return; 264146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264145#factFINAL assume true; 264144#factEXIT >#70#return; 264137#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 264151#factFINAL assume true; 264148#factEXIT >#82#return; 263977#L30-8 [2023-11-06 22:39:30,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1775199578, now seen corresponding path program 23 times [2023-11-06 22:39:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798142100] [2023-11-06 22:39:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:30,554 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:39:30,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2136344151] [2023-11-06 22:39:30,555 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:39:30,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:30,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:30,557 INFO L229 MonitoredProcess]: Starting monitored process 293 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:30,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (293)] Waiting until timeout for monitored process [2023-11-06 22:39:31,330 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-06 22:39:31,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:39:31,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-06 22:39:31,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9656 backedges. 4591 proven. 387 refuted. 0 times theorem prover too weak. 4678 trivial. 0 not checked. [2023-11-06 22:39:31,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9656 backedges. 1351 proven. 935 refuted. 0 times theorem prover too weak. 7370 trivial. 0 not checked. [2023-11-06 22:39:34,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:34,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798142100] [2023-11-06 22:39:34,898 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:39:34,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136344151] [2023-11-06 22:39:34,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136344151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:34,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:39:34,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 32 [2023-11-06 22:39:34,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404125954] [2023-11-06 22:39:34,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:34,900 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:39:34,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:34,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2103888956, now seen corresponding path program 20 times [2023-11-06 22:39:34,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:34,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991688283] [2023-11-06 22:39:34,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:34,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:34,911 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:39:34,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560382026] [2023-11-06 22:39:34,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:39:34,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:34,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:34,916 INFO L229 MonitoredProcess]: Starting monitored process 294 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:34,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (294)] Waiting until timeout for monitored process [2023-11-06 22:39:35,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:39:35,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:39:35,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 22:39:35,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 255 proven. 779 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2023-11-06 22:39:35,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 253 proven. 989 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2023-11-06 22:39:49,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991688283] [2023-11-06 22:39:49,872 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:39:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560382026] [2023-11-06 22:39:49,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560382026] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:49,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:39:49,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 46] total 51 [2023-11-06 22:39:49,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964783104] [2023-11-06 22:39:49,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:49,873 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:39:49,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:49,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-06 22:39:49,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2277, Unknown=0, NotChecked=0, Total=2652 [2023-11-06 22:39:49,875 INFO L87 Difference]: Start difference. First operand 6601 states and 14670 transitions. cyclomatic complexity: 8123 Second operand has 52 states, 47 states have (on average 2.148936170212766) internal successors, (101), 47 states have internal predecessors, (101), 28 states have call successors, (28), 1 states have call predecessors, (28), 23 states have return successors, (47), 26 states have call predecessors, (47), 28 states have call successors, (47) [2023-11-06 22:39:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:54,653 INFO L93 Difference]: Finished difference Result 10440 states and 26093 transitions. [2023-11-06 22:39:54,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10440 states and 26093 transitions. [2023-11-06 22:39:54,766 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 882 [2023-11-06 22:39:55,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10440 states to 10371 states and 26024 transitions. [2023-11-06 22:39:55,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2244 [2023-11-06 22:39:55,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2244 [2023-11-06 22:39:55,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10371 states and 26024 transitions. [2023-11-06 22:39:55,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:39:55,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10371 states and 26024 transitions. [2023-11-06 22:39:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10371 states and 26024 transitions. [2023-11-06 22:39:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10371 to 7165. [2023-11-06 22:39:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7165 states, 4204 states have (on average 1.0440057088487156) internal successors, (4389), 4196 states have internal predecessors, (4389), 2141 states have call successors, (2345), 815 states have call predecessors, (2345), 820 states have return successors, (10233), 2153 states have call predecessors, (10233), 2141 states have call successors, (10233) [2023-11-06 22:39:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7165 states to 7165 states and 16967 transitions. [2023-11-06 22:39:55,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7165 states and 16967 transitions. [2023-11-06 22:39:55,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-06 22:39:55,460 INFO L428 stractBuchiCegarLoop]: Abstraction has 7165 states and 16967 transitions. [2023-11-06 22:39:55,460 INFO L335 stractBuchiCegarLoop]: ======== Iteration 40 ============ [2023-11-06 22:39:55,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7165 states and 16967 transitions. [2023-11-06 22:39:55,495 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 644 [2023-11-06 22:39:55,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:39:55,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:39:55,497 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [64, 64, 43, 43, 43, 43, 21, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:55,498 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [27, 27, 24, 24, 24, 24, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:55,498 INFO L748 eck$LassoCheckResult]: Stem: 281913#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 281852#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 281853#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; 281875#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; 281914#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 282173#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 283452#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; 283447#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 283448#$Ultimate##0 ~n := #in~n; 283455#L25 assume ~n <= 0;#res := 1; 283451#factFINAL assume true; 283446#factEXIT >#72#return; 281901#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 281902#$Ultimate##0 ~n := #in~n; 286136#L25 assume ~n <= 0;#res := 1; 286135#factFINAL assume true; 286134#factEXIT >#74#return; 281826#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 281827#$Ultimate##0 ~n := #in~n; 284873#L25 assume ~n <= 0;#res := 1; 284872#factFINAL assume true; 284871#factEXIT >#76#return; 284870#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; 281882#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 281883#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 281897#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 281898#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; 284203#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 284208#$Ultimate##0 ~n := #in~n; 284253#L25 assume !(~n <= 0); 284250#L26 call #t~ret0 := fact(~n - 1);< 284251#$Ultimate##0 ~n := #in~n; 284254#L25 assume ~n <= 0;#res := 1; 284252#factFINAL assume true; 284249#factEXIT >#70#return; 284248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284202#factFINAL assume true; 284204#factEXIT >#78#return; 281909#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 281910#$Ultimate##0 ~n := #in~n; 284574#L25 assume ~n <= 0;#res := 1; 284572#factFINAL assume true; 284571#factEXIT >#80#return; 281858#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 284570#$Ultimate##0 ~n := #in~n; 284559#L25 assume !(~n <= 0); 281857#L26 call #t~ret0 := fact(~n - 1);< 281859#$Ultimate##0 ~n := #in~n; 284723#L25 assume ~n <= 0;#res := 1; 284722#factFINAL assume true; 284719#factEXIT >#70#return; 284716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284689#factFINAL assume true; 284688#factEXIT >#82#return; 284683#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; 284679#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 284669#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 284663#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 284660#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; 284357#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 284372#$Ultimate##0 ~n := #in~n; 284423#L25 assume !(~n <= 0); 284413#L26 call #t~ret0 := fact(~n - 1);< 284416#$Ultimate##0 ~n := #in~n; 284468#L25 assume !(~n <= 0); 284411#L26 call #t~ret0 := fact(~n - 1);< 284439#$Ultimate##0 ~n := #in~n; 284466#L25 assume ~n <= 0;#res := 1; 284465#factFINAL assume true; 284438#factEXIT >#70#return; 284429#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284419#factFINAL assume true; 284408#factEXIT >#70#return; 284400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284374#factFINAL assume true; 284352#factEXIT >#78#return; 284366#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 284350#$Ultimate##0 ~n := #in~n; 284915#L25 assume ~n <= 0;#res := 1; 284913#factFINAL assume true; 284908#factEXIT >#80#return; 284899#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 284907#$Ultimate##0 ~n := #in~n; 284928#L25 assume !(~n <= 0); 284925#L26 call #t~ret0 := fact(~n - 1);< 284927#$Ultimate##0 ~n := #in~n; 284936#L25 assume !(~n <= 0); 284923#L26 call #t~ret0 := fact(~n - 1);< 284935#$Ultimate##0 ~n := #in~n; 284941#L25 assume ~n <= 0;#res := 1; 284939#factFINAL assume true; 284934#factEXIT >#70#return; 284933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284929#factFINAL assume true; 284920#factEXIT >#70#return; 284919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284914#factFINAL assume true; 284897#factEXIT >#82#return; 284905#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; 285206#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 285203#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 285200#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 285197#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; 284799#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 284808#$Ultimate##0 ~n := #in~n; 285097#L25 assume !(~n <= 0); 284922#L26 call #t~ret0 := fact(~n - 1);< 284927#$Ultimate##0 ~n := #in~n; 284936#L25 assume !(~n <= 0); 284923#L26 call #t~ret0 := fact(~n - 1);< 284935#$Ultimate##0 ~n := #in~n; 284936#L25 assume !(~n <= 0); 284923#L26 call #t~ret0 := fact(~n - 1);< 284935#$Ultimate##0 ~n := #in~n; 284941#L25 assume ~n <= 0;#res := 1; 284939#factFINAL assume true; 284934#factEXIT >#70#return; 284933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284929#factFINAL assume true; 284920#factEXIT >#70#return; 284926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 285239#factFINAL assume true; 285228#factEXIT >#70#return; 285231#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284810#factFINAL assume true; 284794#factEXIT >#78#return; 284807#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 284780#$Ultimate##0 ~n := #in~n; 285196#L25 assume ~n <= 0;#res := 1; 285195#factFINAL assume true; 285194#factEXIT >#80#return; 284673#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 284732#$Ultimate##0 ~n := #in~n; 284733#L25 assume !(~n <= 0); 284642#L26 call #t~ret0 := fact(~n - 1);< 284667#$Ultimate##0 ~n := #in~n; 284731#L25 assume !(~n <= 0); 284643#L26 call #t~ret0 := fact(~n - 1);< 284648#$Ultimate##0 ~n := #in~n; 284724#L25 assume !(~n <= 0); 284634#L26 call #t~ret0 := fact(~n - 1);< 284721#$Ultimate##0 ~n := #in~n; 284726#L25 assume ~n <= 0;#res := 1; 284725#factFINAL assume true; 284720#factEXIT >#70#return; 284717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284690#factFINAL assume true; 284684#factEXIT >#70#return; 284680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284670#factFINAL assume true; 284664#factEXIT >#70#return; 284666#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 285472#factFINAL assume true; 285188#factEXIT >#82#return; 285172#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; 284878#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 284877#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 284876#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 284875#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; 284623#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 284629#$Ultimate##0 ~n := #in~n; 284657#L25 assume !(~n <= 0); 284635#L26 call #t~ret0 := fact(~n - 1);< 284648#$Ultimate##0 ~n := #in~n; 284724#L25 assume !(~n <= 0); 284634#L26 call #t~ret0 := fact(~n - 1);< 284721#$Ultimate##0 ~n := #in~n; 284724#L25 assume !(~n <= 0); 284634#L26 call #t~ret0 := fact(~n - 1);< 284721#$Ultimate##0 ~n := #in~n; 284724#L25 assume !(~n <= 0); 284634#L26 call #t~ret0 := fact(~n - 1);< 284721#$Ultimate##0 ~n := #in~n; 284726#L25 assume ~n <= 0;#res := 1; 284725#factFINAL assume true; 284720#factEXIT >#70#return; 284717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284690#factFINAL assume true; 284684#factEXIT >#70#return; 284680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284670#factFINAL assume true; 284664#factEXIT >#70#return; 284661#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284651#factFINAL assume true; 284633#factEXIT >#70#return; 284631#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284630#factFINAL assume true; 284619#factEXIT >#78#return; 284606#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 284610#$Ultimate##0 ~n := #in~n; 284618#L25 assume ~n <= 0;#res := 1; 284612#factFINAL assume true; 284603#factEXIT >#80#return; 284504#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 284596#$Ultimate##0 ~n := #in~n; 284817#L25 assume !(~n <= 0); 284390#L26 call #t~ret0 := fact(~n - 1);< 284507#$Ultimate##0 ~n := #in~n; 284874#L25 assume !(~n <= 0); 284394#L26 call #t~ret0 := fact(~n - 1);< 284399#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284566#L25 assume ~n <= 0;#res := 1; 284562#factFINAL assume true; 284555#factEXIT >#70#return; 284554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284550#factFINAL assume true; 284541#factEXIT >#70#return; 284528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284522#factFINAL assume true; 284515#factEXIT >#70#return; 284511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284503#factFINAL assume true; 284470#factEXIT >#70#return; 284398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 286345#factFINAL assume true; 284858#factEXIT >#82#return; 284586#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; 284513#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 284509#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 284446#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 284434#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; 284309#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 284312#$Ultimate##0 ~n := #in~n; 284406#L25 assume !(~n <= 0); 284384#L26 call #t~ret0 := fact(~n - 1);< 284399#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284566#L25 assume ~n <= 0;#res := 1; 284562#factFINAL assume true; 284555#factEXIT >#70#return; 284554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284550#factFINAL assume true; 284541#factEXIT >#70#return; 284528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284522#factFINAL assume true; 284515#factEXIT >#70#return; 284511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284503#factFINAL assume true; 284470#factEXIT >#70#return; 284469#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284467#factFINAL assume true; 284444#factEXIT >#70#return; 284445#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284819#factFINAL assume true; 284820#factEXIT >#78#return; 284864#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 284302#$Ultimate##0 ~n := #in~n; 284869#L25 assume ~n <= 0;#res := 1; 284868#factFINAL assume true; 284863#factEXIT >#80#return; 284432#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 284861#$Ultimate##0 ~n := #in~n; 285475#L25 assume !(~n <= 0); 284392#L26 call #t~ret0 := fact(~n - 1);< 284433#$Ultimate##0 ~n := #in~n; 285422#L25 assume !(~n <= 0); 284391#L26 call #t~ret0 := fact(~n - 1);< 284471#$Ultimate##0 ~n := #in~n; 286090#L25 assume !(~n <= 0); 284389#L26 call #t~ret0 := fact(~n - 1);< 284518#$Ultimate##0 ~n := #in~n; 284602#L25 assume !(~n <= 0); 284393#L26 call #t~ret0 := fact(~n - 1);< 284399#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284566#L25 assume ~n <= 0;#res := 1; 284562#factFINAL assume true; 284555#factEXIT >#70#return; 284554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284550#factFINAL assume true; 284541#factEXIT >#70#return; 284528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284522#factFINAL assume true; 284515#factEXIT >#70#return; 284511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284503#factFINAL assume true; 284470#factEXIT >#70#return; 284469#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284467#factFINAL assume true; 284444#factEXIT >#70#return; 284440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284430#factFINAL assume true; 284425#factEXIT >#70#return; 284418#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284403#factFINAL assume true; 284378#factEXIT >#70#return; 284396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 286331#factFINAL assume true; 286241#factEXIT >#82#return; 284588#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; 284417#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 284402#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 284377#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 284330#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; 284310#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 284312#$Ultimate##0 ~n := #in~n; 284406#L25 assume !(~n <= 0); 284384#L26 call #t~ret0 := fact(~n - 1);< 284399#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284563#L25 assume !(~n <= 0); 284379#L26 call #t~ret0 := fact(~n - 1);< 284556#$Ultimate##0 ~n := #in~n; 284566#L25 assume ~n <= 0;#res := 1; 284562#factFINAL assume true; 284555#factEXIT >#70#return; 284554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284550#factFINAL assume true; 284541#factEXIT >#70#return; 284528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284522#factFINAL assume true; 284515#factEXIT >#70#return; 284511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284503#factFINAL assume true; 284470#factEXIT >#70#return; 284469#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284467#factFINAL assume true; 284444#factEXIT >#70#return; 284440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284430#factFINAL assume true; 284425#factEXIT >#70#return; 284427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284867#factFINAL assume true; 284318#factEXIT >#78#return; 284297#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 284304#$Ultimate##0 ~n := #in~n; 284317#L25 assume ~n <= 0;#res := 1; 284306#factFINAL assume true; 284296#factEXIT >#80#return; 284282#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 284969#$Ultimate##0 ~n := #in~n; 284965#L25 assume !(~n <= 0); 284232#L26 call #t~ret0 := fact(~n - 1);< 284283#$Ultimate##0 ~n := #in~n; 285567#L25 assume !(~n <= 0); 284215#L26 call #t~ret0 := fact(~n - 1);< 284292#$Ultimate##0 ~n := #in~n; 285557#L25 assume !(~n <= 0); 284220#L26 call #t~ret0 := fact(~n - 1);< 284316#$Ultimate##0 ~n := #in~n; 284821#L25 assume !(~n <= 0); 284230#L26 call #t~ret0 := fact(~n - 1);< 284329#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284376#L25 assume ~n <= 0;#res := 1; 284375#factFINAL assume true; 284337#factEXIT >#70#return; 284335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284332#factFINAL assume true; 284327#factEXIT >#70#return; 284326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284322#factFINAL assume true; 284313#factEXIT >#70#return; 284305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284294#factFINAL assume true; 284291#factEXIT >#70#return; 284288#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284287#factFINAL assume true; 284285#factEXIT >#70#return; 284279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 286311#factFINAL assume true; 286290#factEXIT >#82#return; 281832#L30-8 [2023-11-06 22:39:55,499 INFO L750 eck$LassoCheckResult]: Loop: 281832#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; 281876#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 281877#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 284213#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 281880#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; 281822#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 281823#$Ultimate##0 ~n := #in~n; 284209#L25 assume !(~n <= 0); 284210#L26 call #t~ret0 := fact(~n - 1);< 284333#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284376#L25 assume ~n <= 0;#res := 1; 284375#factFINAL assume true; 284337#factEXIT >#70#return; 284335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284332#factFINAL assume true; 284327#factEXIT >#70#return; 284326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284322#factFINAL assume true; 284313#factEXIT >#70#return; 284305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284294#factFINAL assume true; 284291#factEXIT >#70#return; 284288#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284287#factFINAL assume true; 284285#factEXIT >#70#return; 284284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284281#factFINAL assume true; 284278#factEXIT >#70#return; 284277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284275#factFINAL assume true; 284273#factEXIT >#70#return; 284272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284270#factFINAL assume true; 284268#factEXIT >#70#return; 284267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284265#factFINAL assume true; 284262#factEXIT >#70#return; 284261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284260#factFINAL assume true; 284258#factEXIT >#70#return; 284257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284256#factFINAL assume true; 284255#factEXIT >#70#return; 284236#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284242#factFINAL assume true; 284214#factEXIT >#70#return; 284212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284211#factFINAL assume true; 284198#factEXIT >#78#return; 284200#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 281823#$Ultimate##0 ~n := #in~n; 284209#L25 assume ~n <= 0;#res := 1; 284207#factFINAL assume true; 284206#factEXIT >#80#return; 284199#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 284205#$Ultimate##0 ~n := #in~n; 284246#L25 assume !(~n <= 0); 284223#L26 call #t~ret0 := fact(~n - 1);< 284241#$Ultimate##0 ~n := #in~n; 285020#L25 assume !(~n <= 0); 284224#L26 call #t~ret0 := fact(~n - 1);< 284243#$Ultimate##0 ~n := #in~n; 286107#L25 assume !(~n <= 0); 284229#L26 call #t~ret0 := fact(~n - 1);< 284259#$Ultimate##0 ~n := #in~n; 284289#L25 assume !(~n <= 0); 284227#L26 call #t~ret0 := fact(~n - 1);< 284264#$Ultimate##0 ~n := #in~n; 286133#L25 assume !(~n <= 0); 284218#L26 call #t~ret0 := fact(~n - 1);< 284269#$Ultimate##0 ~n := #in~n; 286132#L25 assume !(~n <= 0); 284216#L26 call #t~ret0 := fact(~n - 1);< 284274#$Ultimate##0 ~n := #in~n; 281907#L25 assume !(~n <= 0); 284219#L26 call #t~ret0 := fact(~n - 1);< 284280#$Ultimate##0 ~n := #in~n; 285376#L25 assume !(~n <= 0); 284221#L26 call #t~ret0 := fact(~n - 1);< 284286#$Ultimate##0 ~n := #in~n; 285567#L25 assume !(~n <= 0); 284215#L26 call #t~ret0 := fact(~n - 1);< 284292#$Ultimate##0 ~n := #in~n; 285557#L25 assume !(~n <= 0); 284220#L26 call #t~ret0 := fact(~n - 1);< 284316#$Ultimate##0 ~n := #in~n; 284821#L25 assume !(~n <= 0); 284230#L26 call #t~ret0 := fact(~n - 1);< 284329#$Ultimate##0 ~n := #in~n; 284401#L25 assume !(~n <= 0); 284234#L26 call #t~ret0 := fact(~n - 1);< 284338#$Ultimate##0 ~n := #in~n; 284376#L25 assume ~n <= 0;#res := 1; 284375#factFINAL assume true; 284337#factEXIT >#70#return; 284335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284332#factFINAL assume true; 284327#factEXIT >#70#return; 284326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284322#factFINAL assume true; 284313#factEXIT >#70#return; 284305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284294#factFINAL assume true; 284291#factEXIT >#70#return; 284288#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284287#factFINAL assume true; 284285#factEXIT >#70#return; 284284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284281#factFINAL assume true; 284278#factEXIT >#70#return; 284277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284275#factFINAL assume true; 284273#factEXIT >#70#return; 284272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284270#factFINAL assume true; 284268#factEXIT >#70#return; 284267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284265#factFINAL assume true; 284262#factEXIT >#70#return; 284261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284260#factFINAL assume true; 284258#factEXIT >#70#return; 284257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284256#factFINAL assume true; 284255#factEXIT >#70#return; 284236#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284242#factFINAL assume true; 284214#factEXIT >#70#return; 284212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 284211#factFINAL assume true; 284198#factEXIT >#82#return; 281832#L30-8 [2023-11-06 22:39:55,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2105798310, now seen corresponding path program 24 times [2023-11-06 22:39:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313373840] [2023-11-06 22:39:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:55,518 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:39:55,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222900932] [2023-11-06 22:39:55,519 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:39:55,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:55,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:55,523 INFO L229 MonitoredProcess]: Starting monitored process 295 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:55,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (295)] Waiting until timeout for monitored process [2023-11-06 22:39:56,260 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2023-11-06 22:39:56,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:39:56,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-06 22:39:56,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9992 backedges. 1898 proven. 588 refuted. 0 times theorem prover too weak. 7506 trivial. 0 not checked. [2023-11-06 22:39:56,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9992 backedges. 1901 proven. 619 refuted. 0 times theorem prover too weak. 7472 trivial. 0 not checked. [2023-11-06 22:39:58,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:58,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313373840] [2023-11-06 22:39:58,764 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:39:58,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222900932] [2023-11-06 22:39:58,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222900932] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:58,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:39:58,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 29 [2023-11-06 22:39:58,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444015936] [2023-11-06 22:39:58,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:58,766 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:39:58,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2085121660, now seen corresponding path program 21 times [2023-11-06 22:39:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:58,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741127584] [2023-11-06 22:39:58,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:58,780 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:39:58,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1674450501] [2023-11-06 22:39:58,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:39:58,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:58,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:58,792 INFO L229 MonitoredProcess]: Starting monitored process 296 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:58,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (296)] Waiting until timeout for monitored process [2023-11-06 22:39:59,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2023-11-06 22:39:59,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:39:59,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:39:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:39:59,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:40:01,061 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:40:01,061 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:40:01,061 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:40:01,061 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:40:01,061 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:40:01,061 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,061 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:40:01,061 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:40:01,061 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration40_Loop [2023-11-06 22:40:01,061 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:40:01,061 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:40:01,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,251 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:40:01,251 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:40:01,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,253 INFO L229 MonitoredProcess]: Starting monitored process 297 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Waiting until timeout for monitored process [2023-11-06 22:40:01,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:01,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:01,267 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:01,267 INFO L440 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: [] [2023-11-06 22:40:01,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:01,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,271 INFO L229 MonitoredProcess]: Starting monitored process 298 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Waiting until timeout for monitored process [2023-11-06 22:40:01,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:01,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:01,285 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:01,286 INFO L440 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: [] [2023-11-06 22:40:01,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Ended with exit code 0 [2023-11-06 22:40:01,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,289 INFO L229 MonitoredProcess]: Starting monitored process 299 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Waiting until timeout for monitored process [2023-11-06 22:40:01,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:01,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:01,303 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:01,304 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=12} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=12} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:40:01,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:01,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,308 INFO L229 MonitoredProcess]: Starting monitored process 300 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Waiting until timeout for monitored process [2023-11-06 22:40:01,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:01,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:01,322 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:01,322 INFO L440 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: [] [2023-11-06 22:40:01,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Ended with exit code 0 [2023-11-06 22:40:01,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,326 INFO L229 MonitoredProcess]: Starting monitored process 301 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Waiting until timeout for monitored process [2023-11-06 22:40:01,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:01,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:01,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:01,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,344 INFO L229 MonitoredProcess]: Starting monitored process 302 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Waiting until timeout for monitored process [2023-11-06 22:40:01,350 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:40:01,350 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:01,363 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:40:01,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Ended with exit code 0 [2023-11-06 22:40:01,366 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:40:01,366 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:40:01,366 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:40:01,366 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:40:01,366 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:40:01,366 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,366 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:40:01,366 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:40:01,366 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration40_Loop [2023-11-06 22:40:01,366 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:40:01,366 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:40:01,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:01,491 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:40:01,491 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:40:01,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,493 INFO L229 MonitoredProcess]: Starting monitored process 303 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Waiting until timeout for monitored process [2023-11-06 22:40:01,495 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 [2023-11-06 22:40:01,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:01,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:01,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:01,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:01,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:01,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:01,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:01,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:01,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Ended with exit code 0 [2023-11-06 22:40:01,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,526 INFO L229 MonitoredProcess]: Starting monitored process 304 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Waiting until timeout for monitored process [2023-11-06 22:40:01,527 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 [2023-11-06 22:40:01,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:01,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:01,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:01,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:01,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:01,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:01,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:01,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:01,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Ended with exit code 0 [2023-11-06 22:40:01,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,544 INFO L229 MonitoredProcess]: Starting monitored process 305 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Waiting until timeout for monitored process [2023-11-06 22:40:01,546 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 [2023-11-06 22:40:01,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:01,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:01,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:01,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:01,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:01,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:01,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:01,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:01,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Ended with exit code 0 [2023-11-06 22:40:01,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,564 INFO L229 MonitoredProcess]: Starting monitored process 306 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Waiting until timeout for monitored process [2023-11-06 22:40:01,566 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 [2023-11-06 22:40:01,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:01,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:01,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:01,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:01,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:01,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:01,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:01,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:01,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Ended with exit code 0 [2023-11-06 22:40:01,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,582 INFO L229 MonitoredProcess]: Starting monitored process 307 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Waiting until timeout for monitored process [2023-11-06 22:40:01,587 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 [2023-11-06 22:40:01,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:01,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:01,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:01,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:01,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:01,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:01,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:01,600 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:40:01,603 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:40:01,603 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:40:01,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:01,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,607 INFO L229 MonitoredProcess]: Starting monitored process 308 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Waiting until timeout for monitored process [2023-11-06 22:40:01,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:40:01,608 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:40:01,608 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:40:01,608 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 23 Supporting invariants [] [2023-11-06 22:40:01,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:01,611 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:40:01,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:02,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 2671 conjuncts, 130 conjunts are in the unsatisfiable core [2023-11-06 22:40:02,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:04,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Ended with exit code 0 [2023-11-06 22:40:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:05,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-06 22:40:05,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2023-11-06 22:40:06,386 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 19 loop predicates [2023-11-06 22:40:06,387 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7165 states and 16967 transitions. cyclomatic complexity: 9856 Second operand has 22 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 6 states have call successors, (12), 2 states have call predecessors, (12), 15 states have return successors, (24), 17 states have call predecessors, (24), 6 states have call successors, (24) [2023-11-06 22:40:07,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7165 states and 16967 transitions. cyclomatic complexity: 9856. Second operand has 22 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 6 states have call successors, (12), 2 states have call predecessors, (12), 15 states have return successors, (24), 17 states have call predecessors, (24), 6 states have call successors, (24) Result 16635 states and 35380 transitions. Complement of second has 123 states. [2023-11-06 22:40:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 2 stem states 18 non-accepting loop states 1 accepting loop states [2023-11-06 22:40:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 6 states have call successors, (12), 2 states have call predecessors, (12), 15 states have return successors, (24), 17 states have call predecessors, (24), 6 states have call successors, (24) [2023-11-06 22:40:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 118 transitions. [2023-11-06 22:40:07,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 118 transitions. Stem has 400 letters. Loop has 164 letters. [2023-11-06 22:40:07,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:40:07,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 118 transitions. Stem has 564 letters. Loop has 164 letters. [2023-11-06 22:40:07,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:40:07,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 118 transitions. Stem has 400 letters. Loop has 328 letters. [2023-11-06 22:40:07,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:40:07,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16635 states and 35380 transitions. [2023-11-06 22:40:07,666 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 644 [2023-11-06 22:40:07,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16635 states to 10116 states and 23028 transitions. [2023-11-06 22:40:07,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1949 [2023-11-06 22:40:07,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1958 [2023-11-06 22:40:07,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10116 states and 23028 transitions. [2023-11-06 22:40:07,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:40:07,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10116 states and 23028 transitions. [2023-11-06 22:40:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states and 23028 transitions. [2023-11-06 22:40:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 7911. [2023-11-06 22:40:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7911 states, 4674 states have (on average 1.0404364569961488) internal successors, (4863), 4668 states have internal predecessors, (4863), 2273 states have call successors, (2503), 921 states have call predecessors, (2503), 964 states have return successors, (11225), 2321 states have call predecessors, (11225), 2273 states have call successors, (11225) [2023-11-06 22:40:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7911 states to 7911 states and 18591 transitions. [2023-11-06 22:40:08,338 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7911 states and 18591 transitions. [2023-11-06 22:40:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:08,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:40:08,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2023-11-06 22:40:08,339 INFO L87 Difference]: Start difference. First operand 7911 states and 18591 transitions. Second operand has 30 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 29 states have internal predecessors, (75), 16 states have call successors, (30), 1 states have call predecessors, (30), 11 states have return successors, (36), 16 states have call predecessors, (36), 16 states have call successors, (36) [2023-11-06 22:40:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:40:09,919 INFO L93 Difference]: Finished difference Result 12524 states and 31571 transitions. [2023-11-06 22:40:09,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12524 states and 31571 transitions. [2023-11-06 22:40:10,138 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 717 [2023-11-06 22:40:10,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12524 states to 12446 states and 31136 transitions. [2023-11-06 22:40:10,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2396 [2023-11-06 22:40:10,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2396 [2023-11-06 22:40:10,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12446 states and 31136 transitions. [2023-11-06 22:40:10,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:40:10,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12446 states and 31136 transitions. [2023-11-06 22:40:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12446 states and 31136 transitions. [2023-11-06 22:40:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12446 to 10066. [2023-11-06 22:40:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10066 states, 5777 states have (on average 1.0403323524320582) internal successors, (6010), 5771 states have internal predecessors, (6010), 3265 states have call successors, (3697), 1085 states have call predecessors, (3697), 1024 states have return successors, (15850), 3209 states have call predecessors, (15850), 3265 states have call successors, (15850) [2023-11-06 22:40:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10066 states to 10066 states and 25557 transitions. [2023-11-06 22:40:10,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10066 states and 25557 transitions. [2023-11-06 22:40:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:40:10,968 INFO L428 stractBuchiCegarLoop]: Abstraction has 10066 states and 25557 transitions. [2023-11-06 22:40:10,968 INFO L335 stractBuchiCegarLoop]: ======== Iteration 41 ============ [2023-11-06 22:40:10,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10066 states and 25557 transitions. [2023-11-06 22:40:11,016 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 687 [2023-11-06 22:40:11,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:40:11,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:40:11,018 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [64, 64, 43, 43, 43, 43, 21, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:11,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [29, 29, 26, 26, 26, 26, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:11,019 INFO L748 eck$LassoCheckResult]: Stem: 330473#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 330413#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~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#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; 330414#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; 330435#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; 330474#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 330848#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 332131#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; 332127#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 332128#$Ultimate##0 ~n := #in~n; 332141#L25 assume ~n <= 0;#res := 1; 332140#factFINAL assume true; 332126#factEXIT >#72#return; 330459#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 330460#$Ultimate##0 ~n := #in~n; 333108#L25 assume ~n <= 0;#res := 1; 333106#factFINAL assume true; 333104#factEXIT >#74#return; 330395#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 330396#$Ultimate##0 ~n := #in~n; 333129#L25 assume ~n <= 0;#res := 1; 333128#factFINAL assume true; 333127#factEXIT >#76#return; 330428#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; 330429#binomialCoefficient_returnLabel#1 main_#t~ret9#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;havoc main_#t~ret9#1; 330447#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 333286#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 333284#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; 333220#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 333279#$Ultimate##0 ~n := #in~n; 333277#L25 assume !(~n <= 0); 333225#L26 call #t~ret0 := fact(~n - 1);< 333266#$Ultimate##0 ~n := #in~n; 333263#L25 assume ~n <= 0;#res := 1; 333264#factFINAL assume true; 333224#factEXIT >#70#return; 333223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333219#factFINAL assume true; 333221#factEXIT >#78#return; 333330#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 333331#$Ultimate##0 ~n := #in~n; 333334#L25 assume ~n <= 0;#res := 1; 333332#factFINAL assume true; 333329#factEXIT >#80#return; 330418#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 333324#$Ultimate##0 ~n := #in~n; 333322#L25 assume !(~n <= 0); 330417#L26 call #t~ret0 := fact(~n - 1);< 330419#$Ultimate##0 ~n := #in~n; 333730#L25 assume ~n <= 0;#res := 1; 333729#factFINAL assume true; 333728#factEXIT >#70#return; 333727#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333726#factFINAL assume true; 333725#factEXIT >#82#return; 333724#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; 333723#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 333722#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 333721#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 333720#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; 333377#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 333410#$Ultimate##0 ~n := #in~n; 333433#L25 assume !(~n <= 0); 333422#L26 call #t~ret0 := fact(~n - 1);< 333427#$Ultimate##0 ~n := #in~n; 333439#L25 assume !(~n <= 0); 333421#L26 call #t~ret0 := fact(~n - 1);< 333437#$Ultimate##0 ~n := #in~n; 333440#L25 assume ~n <= 0;#res := 1; 333438#factFINAL assume true; 333436#factEXIT >#70#return; 333435#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333428#factFINAL assume true; 333418#factEXIT >#70#return; 333417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333416#factFINAL assume true; 333375#factEXIT >#78#return; 333399#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 333362#$Ultimate##0 ~n := #in~n; 334420#L25 assume ~n <= 0;#res := 1; 334418#factFINAL assume true; 334406#factEXIT >#80#return; 333632#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 334240#$Ultimate##0 ~n := #in~n; 334239#L25 assume !(~n <= 0); 333519#L26 call #t~ret0 := fact(~n - 1);< 333550#$Ultimate##0 ~n := #in~n; 334259#L25 assume !(~n <= 0); 333515#L26 call #t~ret0 := fact(~n - 1);< 333765#$Ultimate##0 ~n := #in~n; 333757#L25 assume ~n <= 0;#res := 1; 333758#factFINAL assume true; 333718#factEXIT >#70#return; 333719#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334423#factFINAL assume true; 334422#factEXIT >#70#return; 334421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334419#factFINAL assume true; 334401#factEXIT >#82#return; 334405#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; 334808#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 334806#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 334804#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 334801#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; 333531#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 333555#$Ultimate##0 ~n := #in~n; 333556#L25 assume !(~n <= 0); 333518#L26 call #t~ret0 := fact(~n - 1);< 333550#$Ultimate##0 ~n := #in~n; 334259#L25 assume !(~n <= 0); 333515#L26 call #t~ret0 := fact(~n - 1);< 333765#$Ultimate##0 ~n := #in~n; 334259#L25 assume !(~n <= 0); 333515#L26 call #t~ret0 := fact(~n - 1);< 333765#$Ultimate##0 ~n := #in~n; 333757#L25 assume ~n <= 0;#res := 1; 333758#factFINAL assume true; 333718#factEXIT >#70#return; 333719#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334423#factFINAL assume true; 334422#factEXIT >#70#return; 333619#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333620#factFINAL assume true; 333514#factEXIT >#70#return; 333526#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334363#factFINAL assume true; 334355#factEXIT >#78#return; 334357#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 334347#$Ultimate##0 ~n := #in~n; 334478#L25 assume ~n <= 0;#res := 1; 334476#factFINAL assume true; 334465#factEXIT >#80#return; 334455#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 334460#$Ultimate##0 ~n := #in~n; 334480#L25 assume !(~n <= 0); 333576#L26 call #t~ret0 := fact(~n - 1);< 333768#$Ultimate##0 ~n := #in~n; 333766#L25 assume !(~n <= 0); 333579#L26 call #t~ret0 := fact(~n - 1);< 333587#$Ultimate##0 ~n := #in~n; 334265#L25 assume !(~n <= 0); 333583#L26 call #t~ret0 := fact(~n - 1);< 333762#$Ultimate##0 ~n := #in~n; 334264#L25 assume ~n <= 0;#res := 1; 334261#factFINAL assume true; 333761#factEXIT >#70#return; 333759#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333751#factFINAL assume true; 333752#factEXIT >#70#return; 333713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333628#factFINAL assume true; 333622#factEXIT >#70#return; 333625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334463#factFINAL assume true; 334451#factEXIT >#82#return; 334456#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; 334866#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 334865#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 334863#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 334861#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; 333486#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 333504#$Ultimate##0 ~n := #in~n; 333551#L25 assume !(~n <= 0); 333553#L26 call #t~ret0 := fact(~n - 1);< 333587#$Ultimate##0 ~n := #in~n; 334265#L25 assume !(~n <= 0); 333583#L26 call #t~ret0 := fact(~n - 1);< 333762#$Ultimate##0 ~n := #in~n; 334265#L25 assume !(~n <= 0); 333583#L26 call #t~ret0 := fact(~n - 1);< 333762#$Ultimate##0 ~n := #in~n; 334265#L25 assume !(~n <= 0); 333583#L26 call #t~ret0 := fact(~n - 1);< 333762#$Ultimate##0 ~n := #in~n; 334264#L25 assume ~n <= 0;#res := 1; 334261#factFINAL assume true; 333761#factEXIT >#70#return; 333759#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333751#factFINAL assume true; 333752#factEXIT >#70#return; 333713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333628#factFINAL assume true; 333622#factEXIT >#70#return; 333623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333572#factFINAL assume true; 333585#factEXIT >#70#return; 333512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333510#factFINAL assume true; 333477#factEXIT >#78#return; 333498#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 333460#$Ultimate##0 ~n := #in~n; 334427#L25 assume ~n <= 0;#res := 1; 334373#factFINAL assume true; 334371#factEXIT >#80#return; 333748#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 333816#$Ultimate##0 ~n := #in~n; 335043#L25 assume !(~n <= 0); 333639#L26 call #t~ret0 := fact(~n - 1);< 333750#$Ultimate##0 ~n := #in~n; 334901#L25 assume !(~n <= 0); 333646#L26 call #t~ret0 := fact(~n - 1);< 333660#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334298#L25 assume ~n <= 0;#res := 1; 334292#factFINAL assume true; 334273#factEXIT >#70#return; 334271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334266#factFINAL assume true; 334262#factEXIT >#70#return; 334260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334257#factFINAL assume true; 334254#factEXIT >#70#return; 334253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333743#factFINAL assume true; 333735#factEXIT >#70#return; 333731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 335017#factFINAL assume true; 334321#factEXIT >#82#return; 334287#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; 335102#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 335099#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 334746#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 334747#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; 333605#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 333616#$Ultimate##0 ~n := #in~n; 333661#L25 assume !(~n <= 0); 333651#L26 call #t~ret0 := fact(~n - 1);< 333660#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334298#L25 assume ~n <= 0;#res := 1; 334292#factFINAL assume true; 334273#factEXIT >#70#return; 334271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334266#factFINAL assume true; 334262#factEXIT >#70#return; 334260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334257#factFINAL assume true; 334254#factEXIT >#70#return; 334253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333743#factFINAL assume true; 333735#factEXIT >#70#return; 333736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333681#factFINAL assume true; 333682#factEXIT >#70#return; 333734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334450#factFINAL assume true; 334328#factEXIT >#78#return; 334305#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 333600#$Ultimate##0 ~n := #in~n; 334313#L25 assume ~n <= 0;#res := 1; 334311#factFINAL assume true; 334302#factEXIT >#80#return; 333738#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 333763#$Ultimate##0 ~n := #in~n; 333760#L25 assume !(~n <= 0); 333650#L26 call #t~ret0 := fact(~n - 1);< 333742#$Ultimate##0 ~n := #in~n; 334907#L25 assume !(~n <= 0); 333643#L26 call #t~ret0 := fact(~n - 1);< 334904#$Ultimate##0 ~n := #in~n; 334785#L25 assume !(~n <= 0); 333647#L26 call #t~ret0 := fact(~n - 1);< 334258#$Ultimate##0 ~n := #in~n; 334299#L25 assume !(~n <= 0); 333655#L26 call #t~ret0 := fact(~n - 1);< 333660#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334298#L25 assume ~n <= 0;#res := 1; 334292#factFINAL assume true; 334273#factEXIT >#70#return; 334271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334266#factFINAL assume true; 334262#factEXIT >#70#return; 334260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334257#factFINAL assume true; 334254#factEXIT >#70#return; 334253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333743#factFINAL assume true; 333735#factEXIT >#70#return; 333736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333681#factFINAL assume true; 333682#factEXIT >#70#return; 333716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333717#factFINAL assume true; 333634#factEXIT >#70#return; 333656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334110#factFINAL assume true; 334096#factEXIT >#70#return; 333849#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334312#factFINAL assume true; 334309#factEXIT >#82#return; 334289#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; 334809#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 334218#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 334216#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 334210#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; 333607#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 333616#$Ultimate##0 ~n := #in~n; 333661#L25 assume !(~n <= 0); 333651#L26 call #t~ret0 := fact(~n - 1);< 333660#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334293#L25 assume !(~n <= 0); 333654#L26 call #t~ret0 := fact(~n - 1);< 334274#$Ultimate##0 ~n := #in~n; 334298#L25 assume ~n <= 0;#res := 1; 334292#factFINAL assume true; 334273#factEXIT >#70#return; 334271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334266#factFINAL assume true; 334262#factEXIT >#70#return; 334260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334257#factFINAL assume true; 334254#factEXIT >#70#return; 334253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333743#factFINAL assume true; 333735#factEXIT >#70#return; 333736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333681#factFINAL assume true; 333682#factEXIT >#70#return; 333734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 334450#factFINAL assume true; 334328#factEXIT >#78#return; 333591#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 333601#$Ultimate##0 ~n := #in~n; 333603#L25 assume ~n <= 0;#res := 1; 333602#factFINAL assume true; 333589#factEXIT >#80#return; 330475#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 330476#$Ultimate##0 ~n := #in~n; 333799#L25 assume !(~n <= 0); 333236#L26 call #t~ret0 := fact(~n - 1);< 333313#$Ultimate##0 ~n := #in~n; 333789#L25 assume !(~n <= 0); 333246#L26 call #t~ret0 := fact(~n - 1);< 333318#$Ultimate##0 ~n := #in~n; 333790#L25 assume !(~n <= 0); 333257#L26 call #t~ret0 := fact(~n - 1);< 333326#$Ultimate##0 ~n := #in~n; 333373#L25 assume !(~n <= 0); 333235#L26 call #t~ret0 := fact(~n - 1);< 333345#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333372#L25 assume ~n <= 0;#res := 1; 333371#factFINAL assume true; 333350#factEXIT >#70#return; 333348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333346#factFINAL assume true; 333343#factEXIT >#70#return; 333342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333339#factFINAL assume true; 333335#factEXIT >#70#return; 333333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333327#factFINAL assume true; 333325#factEXIT >#70#return; 333323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333319#factFINAL assume true; 333315#factEXIT >#70#return; 333314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333312#factFINAL assume true; 333309#factEXIT >#70#return; 333310#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 335957#factFINAL assume true; 335941#factEXIT >#82#return; 330391#L30-8 [2023-11-06 22:40:11,019 INFO L750 eck$LassoCheckResult]: Loop: 330391#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; 330415#binomialCoefficient_returnLabel#2 main_#t~ret10#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;havoc main_#t~ret10#1; 330436#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 333928#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 333927#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; 330385#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 330386#$Ultimate##0 ~n := #in~n; 333775#L25 assume !(~n <= 0); 333226#L26 call #t~ret0 := fact(~n - 1);< 333227#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333372#L25 assume ~n <= 0;#res := 1; 333371#factFINAL assume true; 333350#factEXIT >#70#return; 333348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333346#factFINAL assume true; 333343#factEXIT >#70#return; 333342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333339#factFINAL assume true; 333335#factEXIT >#70#return; 333333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333327#factFINAL assume true; 333325#factEXIT >#70#return; 333323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333319#factFINAL assume true; 333315#factEXIT >#70#return; 333314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333312#factFINAL assume true; 333309#factEXIT >#70#return; 333308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333306#factFINAL assume true; 333304#factEXIT >#70#return; 333303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333300#factFINAL assume true; 333298#factEXIT >#70#return; 333297#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333294#factFINAL assume true; 333291#factEXIT >#70#return; 333290#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333289#factFINAL assume true; 333287#factEXIT >#70#return; 333285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333281#factFINAL assume true; 333280#factEXIT >#70#return; 333278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333276#factFINAL assume true; 333267#factEXIT >#70#return; 333265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333228#factFINAL assume true; 333259#factEXIT >#70#return; 333275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333368#factFINAL assume true; 333217#factEXIT >#78#return; 330470#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 330386#$Ultimate##0 ~n := #in~n; 333775#L25 assume ~n <= 0;#res := 1; 333773#factFINAL assume true; 333767#factEXIT >#80#return; 333218#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 333222#$Ultimate##0 ~n := #in~n; 333663#L25 assume !(~n <= 0); 333252#L26 call #t~ret0 := fact(~n - 1);< 333262#$Ultimate##0 ~n := #in~n; 333864#L25 assume !(~n <= 0); 333251#L26 call #t~ret0 := fact(~n - 1);< 333260#$Ultimate##0 ~n := #in~n; 333441#L25 assume !(~n <= 0); 333253#L26 call #t~ret0 := fact(~n - 1);< 333288#$Ultimate##0 ~n := #in~n; 334481#L25 assume !(~n <= 0); 333254#L26 call #t~ret0 := fact(~n - 1);< 333293#$Ultimate##0 ~n := #in~n; 333798#L25 assume !(~n <= 0); 333232#L26 call #t~ret0 := fact(~n - 1);< 333299#$Ultimate##0 ~n := #in~n; 335774#L25 assume !(~n <= 0); 333231#L26 call #t~ret0 := fact(~n - 1);< 333305#$Ultimate##0 ~n := #in~n; 330465#L25 assume !(~n <= 0); 333234#L26 call #t~ret0 := fact(~n - 1);< 333311#$Ultimate##0 ~n := #in~n; 333627#L25 assume !(~n <= 0); 333241#L26 call #t~ret0 := fact(~n - 1);< 333617#$Ultimate##0 ~n := #in~n; 333566#L25 assume !(~n <= 0); 333244#L26 call #t~ret0 := fact(~n - 1);< 333564#$Ultimate##0 ~n := #in~n; 333562#L25 assume !(~n <= 0); 333243#L26 call #t~ret0 := fact(~n - 1);< 333326#$Ultimate##0 ~n := #in~n; 333373#L25 assume !(~n <= 0); 333235#L26 call #t~ret0 := fact(~n - 1);< 333345#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333374#L25 assume !(~n <= 0); 333249#L26 call #t~ret0 := fact(~n - 1);< 333351#$Ultimate##0 ~n := #in~n; 333372#L25 assume ~n <= 0;#res := 1; 333371#factFINAL assume true; 333350#factEXIT >#70#return; 333348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333346#factFINAL assume true; 333343#factEXIT >#70#return; 333342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333339#factFINAL assume true; 333335#factEXIT >#70#return; 333333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333327#factFINAL assume true; 333325#factEXIT >#70#return; 333323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333319#factFINAL assume true; 333315#factEXIT >#70#return; 333314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333312#factFINAL assume true; 333309#factEXIT >#70#return; 333308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333306#factFINAL assume true; 333304#factEXIT >#70#return; 333303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333300#factFINAL assume true; 333298#factEXIT >#70#return; 333297#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333294#factFINAL assume true; 333291#factEXIT >#70#return; 333290#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333289#factFINAL assume true; 333287#factEXIT >#70#return; 333285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333281#factFINAL assume true; 333280#factEXIT >#70#return; 333278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333276#factFINAL assume true; 333267#factEXIT >#70#return; 333265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333228#factFINAL assume true; 333259#factEXIT >#70#return; 333275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 333368#factFINAL assume true; 333217#factEXIT >#82#return; 330391#L30-8 [2023-11-06 22:40:11,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1770120870, now seen corresponding path program 25 times [2023-11-06 22:40:11,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201151615] [2023-11-06 22:40:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:11,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:11,048 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:40:11,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597758787] [2023-11-06 22:40:11,048 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:40:11,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:40:11,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:11,050 INFO L229 MonitoredProcess]: Starting monitored process 309 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:40:11,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (309)] Waiting until timeout for monitored process [2023-11-06 22:40:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:11,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 22:40:11,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9992 backedges. 4675 proven. 105 refuted. 0 times theorem prover too weak. 5212 trivial. 0 not checked. [2023-11-06 22:40:12,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9992 backedges. 1171 proven. 514 refuted. 0 times theorem prover too weak. 8307 trivial. 0 not checked. [2023-11-06 22:40:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201151615] [2023-11-06 22:40:14,055 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:40:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597758787] [2023-11-06 22:40:14,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597758787] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:14,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 30 [2023-11-06 22:40:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084352386] [2023-11-06 22:40:14,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:14,057 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:40:14,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:14,057 INFO L85 PathProgramCache]: Analyzing trace with hash 532959484, now seen corresponding path program 22 times [2023-11-06 22:40:14,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:14,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289222064] [2023-11-06 22:40:14,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:14,068 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:40:14,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157966174] [2023-11-06 22:40:14,068 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:40:14,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:40:14,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:14,074 INFO L229 MonitoredProcess]: Starting monitored process 310 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:40:14,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (310)] Waiting until timeout for monitored process [2023-11-06 22:40:14,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:40:14,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:40:14,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:40:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:40:15,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:40:17,016 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:40:17,017 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:40:17,017 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:40:17,017 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:40:17,017 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 22:40:17,017 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,018 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:40:17,018 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:40:17,018 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration41_Loop [2023-11-06 22:40:17,018 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:40:17,018 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:40:17,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,178 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:40:17,178 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 22:40:17,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,185 INFO L229 MonitoredProcess]: Starting monitored process 311 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,187 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,187 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (311)] Waiting until timeout for monitored process [2023-11-06 22:40:17,209 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:17,209 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=13} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=13} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:40:17,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (311)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,214 INFO L229 MonitoredProcess]: Starting monitored process 312 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (312)] Waiting until timeout for monitored process [2023-11-06 22:40:17,239 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:17,239 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=6227020800} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=6227020800} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:40:17,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (312)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,245 INFO L229 MonitoredProcess]: Starting monitored process 313 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (313)] Waiting until timeout for monitored process [2023-11-06 22:40:17,278 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:17,278 INFO L440 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: [] [2023-11-06 22:40:17,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (313)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,284 INFO L229 MonitoredProcess]: Starting monitored process 314 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (314)] Waiting until timeout for monitored process [2023-11-06 22:40:17,325 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:17,325 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:40:17,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (314)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,330 INFO L229 MonitoredProcess]: Starting monitored process 315 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (315)] Waiting until timeout for monitored process [2023-11-06 22:40:17,356 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:17,356 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=13} Honda state: {ULTIMATE.start_main_~x~0#1=13} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:40:17,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (315)] Ended with exit code 0 [2023-11-06 22:40:17,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,361 INFO L229 MonitoredProcess]: Starting monitored process 316 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (316)] Waiting until timeout for monitored process [2023-11-06 22:40:17,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,381 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:17,381 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=6227020800} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=6227020800} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:40:17,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (316)] Ended with exit code 0 [2023-11-06 22:40:17,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,385 INFO L229 MonitoredProcess]: Starting monitored process 317 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (317)] Waiting until timeout for monitored process [2023-11-06 22:40:17,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,399 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:17,399 INFO L440 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: [] [2023-11-06 22:40:17,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (317)] Ended with exit code 0 [2023-11-06 22:40:17,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,403 INFO L229 MonitoredProcess]: Starting monitored process 318 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (318)] Waiting until timeout for monitored process [2023-11-06 22:40:17,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,418 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:17,418 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=13} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=13} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:40:17,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (318)] Ended with exit code 0 [2023-11-06 22:40:17,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,422 INFO L229 MonitoredProcess]: Starting monitored process 319 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (319)] Waiting until timeout for monitored process [2023-11-06 22:40:17,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,435 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:17,436 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 22:40:17,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (319)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,440 INFO L229 MonitoredProcess]: Starting monitored process 320 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (320)] Waiting until timeout for monitored process [2023-11-06 22:40:17,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,453 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 22:40:17,454 INFO L440 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: [] [2023-11-06 22:40:17,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (320)] Ended with exit code 0 [2023-11-06 22:40:17,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,458 INFO L229 MonitoredProcess]: Starting monitored process 321 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (321)] Waiting until timeout for monitored process [2023-11-06 22:40:17,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 22:40:17,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (321)] Ended with exit code 0 [2023-11-06 22:40:17,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,476 INFO L229 MonitoredProcess]: Starting monitored process 322 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (322)] Waiting until timeout for monitored process [2023-11-06 22:40:17,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 22:40:17,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 22:40:17,491 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 22:40:17,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (322)] Ended with exit code 0 [2023-11-06 22:40:17,494 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:40:17,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:40:17,494 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:40:17,494 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:40:17,494 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:40:17,494 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:40:17,494 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:40:17,495 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration41_Loop [2023-11-06 22:40:17,495 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:40:17,495 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:40:17,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 22:40:17,623 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:40:17,623 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:40:17,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,625 INFO L229 MonitoredProcess]: Starting monitored process 323 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (323)] Waiting until timeout for monitored process [2023-11-06 22:40:17,633 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 [2023-11-06 22:40:17,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:17,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (323)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,677 INFO L229 MonitoredProcess]: Starting monitored process 324 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (324)] Waiting until timeout for monitored process [2023-11-06 22:40:17,681 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 [2023-11-06 22:40:17,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:17,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (324)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,716 INFO L229 MonitoredProcess]: Starting monitored process 325 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,721 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 [2023-11-06 22:40:17,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (325)] Waiting until timeout for monitored process [2023-11-06 22:40:17,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:17,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (325)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,762 INFO L229 MonitoredProcess]: Starting monitored process 326 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,769 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 [2023-11-06 22:40:17,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (326)] Waiting until timeout for monitored process [2023-11-06 22:40:17,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:17,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (326)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,800 INFO L229 MonitoredProcess]: Starting monitored process 327 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,805 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 [2023-11-06 22:40:17,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (327)] Waiting until timeout for monitored process [2023-11-06 22:40:17,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:17,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (327)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,836 INFO L229 MonitoredProcess]: Starting monitored process 328 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,841 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 [2023-11-06 22:40:17,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (328)] Waiting until timeout for monitored process [2023-11-06 22:40:17,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:17,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (328)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,872 INFO L229 MonitoredProcess]: Starting monitored process 329 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:40:17,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (329)] Waiting until timeout for monitored process [2023-11-06 22:40:17,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:17,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (329)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,906 INFO L229 MonitoredProcess]: Starting monitored process 330 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 22:40:17,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (330)] Waiting until timeout for monitored process [2023-11-06 22:40:17,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:17,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (330)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,938 INFO L229 MonitoredProcess]: Starting monitored process 331 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,941 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 [2023-11-06 22:40:17,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (331)] Waiting until timeout for monitored process [2023-11-06 22:40:17,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:17,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (331)] Ended with exit code 0 [2023-11-06 22:40:17,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,963 INFO L229 MonitoredProcess]: Starting monitored process 332 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (332)] Waiting until timeout for monitored process [2023-11-06 22:40:17,966 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 [2023-11-06 22:40:17,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:40:17,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (332)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:17,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:17,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:17,982 INFO L229 MonitoredProcess]: Starting monitored process 333 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:17,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (333)] Waiting until timeout for monitored process [2023-11-06 22:40:17,985 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 [2023-11-06 22:40:17,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:40:17,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:40:17,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:40:17,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:40:17,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:40:17,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:40:17,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:40:17,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:40:18,000 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 22:40:18,001 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 22:40:18,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:40:18,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:18,004 INFO L229 MonitoredProcess]: Starting monitored process 334 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:18,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (334)] Waiting until timeout for monitored process [2023-11-06 22:40:18,005 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:40:18,005 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 22:40:18,005 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:40:18,005 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 25 Supporting invariants [] [2023-11-06 22:40:18,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (333)] Ended with exit code 0 [2023-11-06 22:40:18,008 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 22:40:18,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:18,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 2671 conjuncts, 130 conjunts are in the unsatisfiable core [2023-11-06 22:40:18,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:19,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_095dac3f-9403-4fc8-ba9d-7ec72f84047d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (334)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:21,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-06 22:40:21,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 1228 refuted. 0 times theorem prover too weak. 1046 trivial. 0 not checked. [2023-11-06 22:40:22,499 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 20 loop predicates [2023-11-06 22:40:22,499 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10066 states and 25557 transitions. cyclomatic complexity: 15549 Second operand has 23 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 6 states have call successors, (12), 2 states have call predecessors, (12), 16 states have return successors, (25), 18 states have call predecessors, (25), 6 states have call successors, (25)